Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  anor Structured version   Visualization version   GIF version

Theorem anor 510
 Description: Conjunction in terms of disjunction (De Morgan's law). Theorem *4.5 of [WhiteheadRussell] p. 120. (Contributed by NM, 3-Jan-1993.) (Proof shortened by Wolf Lammen, 3-Nov-2012.)
Assertion
Ref Expression
anor ((𝜑𝜓) ↔ ¬ (¬ 𝜑 ∨ ¬ 𝜓))

Proof of Theorem anor
StepHypRef Expression
1 ianor 509 . . 3 (¬ (𝜑𝜓) ↔ (¬ 𝜑 ∨ ¬ 𝜓))
21bicomi 214 . 2 ((¬ 𝜑 ∨ ¬ 𝜓) ↔ ¬ (𝜑𝜓))
32con2bii 347 1 ((𝜑𝜓) ↔ ¬ (¬ 𝜑 ∨ ¬ 𝜓))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   ↔ wb 196   ∨ wo 383   ∧ wa 384 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386 This theorem is referenced by:  pm3.1  519  pm3.11  520  dn1  1008  3anor  1053  bropopvvv  7252  ifpananb  37677  iunrelexp0  37820
 Copyright terms: Public domain W3C validator