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

Theorem 19.32 2269
Description: Theorem 19.32 of [Margaris] p. 90. See 19.32v 1973 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 1890 . . 3 Ⅎ𝑥 ¬ 𝜑
3219.21 2243 . 2 (∀𝑥(¬ 𝜑 → 𝜓) ↔ (¬ 𝜑 → ∀𝑥𝜓))
4 df-or 862 . . 3 ((𝜑 ∨ 𝜓) ↔ (¬ 𝜑 → 𝜓))
54albii 1852 . 2 (∀𝑥(𝜑 ∨ 𝜓) ↔ ∀𝑥(¬ 𝜑 → 𝜓))
6 df-or 862 . 2 ((𝜑 ∨ ∀𝑥𝜓) ↔ (¬ 𝜑 → ∀𝑥𝜓))
73, 5, 63bitr4i 306 1 (∀𝑥(𝜑 ∨ 𝜓) ↔ (𝜑 ∨ ∀𝑥𝜓))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∨ wo 861  ∀wal 1568  Ⅎwnf 1816
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-12 2213
This proof depends on definitions:  df-bi 210  df-or 862  df-ex 1813  df-nf 1817
This theorem is used by:  19.31  2270  2eu3  2678  axi12  2730  axbnd  2731
  Copyright terms: Public domain W3C validator