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

Theorem anor 252
Description: Conjunction in terms of disjunction (DeMorgan's law). Theorem *4.5 of [WhiteheadRussell] p. 120.
Assertion
Ref Expression
anor |- ((ph /\ ps) <-> -. (-. ph \/ -. ps))

Proof of Theorem anor
StepHypRef Expression
1 df-an 198 . 2 |- ((ph /\ ps) <-> -. (ph -> -. ps))
2 imor 204 . . 3 |- ((ph -> -. ps) <-> (-. ph \/ -. ps))
32negbii 162 . 2 |- (-. (ph -> -. ps) <-> -. (-. ph \/ -. ps))
41, 3bitr 151 1 |- ((ph /\ ps) <-> -. (-. ph \/ -. ps))
Colors of variables: wff set class
Syntax hints:  -. wn 1   -> wi 2   <-> wb 127   \/ wo 195   /\ wa 196
This theorem is referenced by:  ianor 253  ioran 254  andi 456
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198
metamath.org