Theorem 19.32 2268

Description: Theorem 19.32 of [Margaris] p. 90. See 19.32v 1969 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

Step	Hyp	Ref	Expression
1		19.32.1	. . . 4 ⊢ Ⅎ𝑥𝜑
2	1	nfn 1886	. . 3 ⊢ Ⅎ𝑥 ¬ 𝜑
3	2	19.21 2242	. 2 ⊢ (∀𝑥(¬ 𝜑 → 𝜓) ↔ (¬ 𝜑 → ∀𝑥𝜓))
4		df-or 861	. . 3 ⊢ ((𝜑 ∨ 𝜓) ↔ (¬ 𝜑 → 𝜓))
5	4	albii 1848	. 2 ⊢ (∀𝑥(𝜑 ∨ 𝜓) ↔ ∀𝑥(¬ 𝜑 → 𝜓))
6		df-or 861	. 2 ⊢ ((𝜑 ∨ ∀𝑥𝜓) ↔ (¬ 𝜑 → ∀𝑥𝜓))
7	3, 5, 6	3bitr4i 306	1 ⊢ (∀𝑥(𝜑 ∨ 𝜓) ↔ (𝜑 ∨ ∀𝑥𝜓))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∨ wo 860  ∀wal 1567  Ⅎwnf 1812

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-12 2212

This proof depends on definitions:  df-bi 210  df-or 861  df-ex 1809  df-nf 1813

This theorem is used by:  19.31  2269  2eu3  2680  axi12  2732  axbnd  2733