HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem nbn 721
Description: The negation of a wff is equivalent to the wff's equivalence to falsehood.
Hypothesis
Ref Expression
nbn.1 |- -. ph
Assertion
Ref Expression
nbn |- (-. ps <-> (ps <-> ph))

Proof of Theorem nbn
StepHypRef Expression
1 nbn.1 . . 3 |- -. ph
2 nbn2 720 . . 3 |- (-. ph -> (-. ps <-> (ph <-> ps)))
31, 2ax-mp 7 . 2 |- (-. ps <-> (ph <-> ps))
4 bicom 519 . 2 |- ((ph <-> ps) <-> (ps <-> ph))
53, 4bitr 173 1 |- (-. ps <-> (ps <-> ph))
Colors of variables: wff set class
Syntax hints:  -. wn 2   <-> wb 146
This theorem is referenced by:  nbn3 722  ne0f 2283  disj 2307  axnul2 2703  dm0rn0 3325  reldm0 3326  intirr 3433
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7
This theorem depends on definitions:  df-bi 147  df-an 225
Copyright terms: Public domain