Theorem r19.32 47697

Description: Theorem 19.32 of [Margaris] p. 90 with restricted quantifiers, analogous to r19.32v 3197. (Contributed by Alexander van der Vekens, 29-Jun-2017.)

Hypothesis

Ref	Expression
r19.32.1	⊢ Ⅎ𝑥𝜑

Assertion

Ref	Expression
r19.32	⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ↔ (𝜑 ∨ ∀𝑥 ∈ 𝐴 𝜓))

Proof of Theorem r19.32

Step	Hyp	Ref	Expression
1		r19.32.1	. . . 4 ⊢ Ⅎ𝑥𝜑
2	1	nfn 1879	. . 3 ⊢ Ⅎ𝑥 ¬ 𝜑
3	2	r19.21 3259	. 2 ⊢ (∀𝑥 ∈ 𝐴 (¬ 𝜑 → 𝜓) ↔ (¬ 𝜑 → ∀𝑥 ∈ 𝐴 𝜓))
4		df-or 859	. . 3 ⊢ ((𝜑 ∨ 𝜓) ↔ (¬ 𝜑 → 𝜓))
5	4	ralbii 3110	. 2 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ↔ ∀𝑥 ∈ 𝐴 (¬ 𝜑 → 𝜓))
6		df-or 859	. 2 ⊢ ((𝜑 ∨ ∀𝑥 ∈ 𝐴 𝜓) ↔ (¬ 𝜑 → ∀𝑥 ∈ 𝐴 𝜓))
7	3, 5, 6	3bitr4i 305	1 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ↔ (𝜑 ∨ ∀𝑥 ∈ 𝐴 𝜓))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∨ wo 858  Ⅎwnf 1805  ∀wral 3078

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-12 2214

This theorem depends on definitions:  df-bi 209  df-or 859  df-ex 1802  df-nf 1806  df-ral 3079

This theorem is referenced by:  2reu3  47709