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

Theorem 19.32 2233
 Description: Theorem 19.32 of [Margaris] p. 90. See 19.32v 1941 for a version requiring fewer axioms. (Contributed by NM, 14-May-1993.) (Revised by Mario Carneiro, 24-Sep-2016.)
Hypothesis
Ref Expression
19.32.1 𝑥𝜑
Assertion
Ref Expression
19.32 (∀𝑥(𝜑𝜓) ↔ (𝜑 ∨ ∀𝑥𝜓))

Proof of Theorem 19.32
StepHypRef Expression
1 19.32.1 . . . 4 𝑥𝜑
21nfn 1858 . . 3 𝑥 ¬ 𝜑
3219.21 2205 . 2 (∀𝑥𝜑𝜓) ↔ (¬ 𝜑 → ∀𝑥𝜓))
4 df-or 845 . . 3 ((𝜑𝜓) ↔ (¬ 𝜑𝜓))
54albii 1821 . 2 (∀𝑥(𝜑𝜓) ↔ ∀𝑥𝜑𝜓))
6 df-or 845 . 2 ((𝜑 ∨ ∀𝑥𝜓) ↔ (¬ 𝜑 → ∀𝑥𝜓))
73, 5, 63bitr4i 306 1 (∀𝑥(𝜑𝜓) ↔ (𝜑 ∨ ∀𝑥𝜓))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∨ wo 844  ∀wal 1536  Ⅎwnf 1785 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-12 2175 This theorem depends on definitions:  df-bi 210  df-or 845  df-ex 1782  df-nf 1786 This theorem is referenced by:  19.31  2234  2eu3  2715  axi12  2768  axbnd  2769
 Copyright terms: Public domain W3C validator