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

Theorem nbn2 719
Description: The negation of a wff is equivalent to the wff's equivalence to falsehood. (Contributed by Juha Arpiainen, 19-Jan-06.)
Assertion
Ref Expression
nbn2 |- (-. ph -> (-. ps <-> (ph <-> ps)))

Proof of Theorem nbn2
StepHypRef Expression
1 pm5.21 675 . . 3 |- ((-. ph /\ -. ps) -> (ph <-> ps))
21ex 373 . 2 |- (-. ph -> (-. ps -> (ph <-> ps)))
3 pm4.11 520 . . . 4 |- ((ph <-> ps) <-> (-. ph <-> -. ps))
43biimp 151 . . 3 |- ((ph <-> ps) -> (-. ph <-> -. ps))
54biimpcd 155 . 2 |- (-. ph -> ((ph <-> ps) -> -. ps))
62, 5impbid 514 1 |- (-. ph -> (-. ps <-> (ph <-> ps)))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   <-> wb 146
This theorem is referenced by:  nbn 720  biass 742
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