Theorem 2ralor 3088

Description: Distribute restricted universal quantification over "or". (Contributed by Jeff Madsen, 19-Jun-2010.)

Assertion

Ref	Expression
2ralor	⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 ∨ 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∨ ∀𝑦 ∈ 𝐵 𝜓))

Distinct variable groups:   𝜑,𝑦   𝜓,𝑥   𝑦,𝐴   𝑥,𝐵   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝐴(𝑥)   𝐵(𝑦)

Proof of Theorem 2ralor

Step	Hyp	Ref	Expression
1		rexnal 2978	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝜑 ↔ ¬ ∀𝑥 ∈ 𝐴 𝜑)
2		rexnal 2978	. . . 4 ⊢ (∃𝑦 ∈ 𝐵 ¬ 𝜓 ↔ ¬ ∀𝑦 ∈ 𝐵 𝜓)
3	1, 2	anbi12i 729	. . 3 ⊢ ((∃𝑥 ∈ 𝐴 ¬ 𝜑 ∧ ∃𝑦 ∈ 𝐵 ¬ 𝜓) ↔ (¬ ∀𝑥 ∈ 𝐴 𝜑 ∧ ¬ ∀𝑦 ∈ 𝐵 𝜓))
4		ioran 510	. . . . . . 7 ⊢ (¬ (𝜑 ∨ 𝜓) ↔ (¬ 𝜑 ∧ ¬ 𝜓))
5	4	rexbii 3023	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐵 ¬ (𝜑 ∨ 𝜓) ↔ ∃𝑦 ∈ 𝐵 (¬ 𝜑 ∧ ¬ 𝜓))
6		rexnal 2978	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐵 ¬ (𝜑 ∨ 𝜓) ↔ ¬ ∀𝑦 ∈ 𝐵 (𝜑 ∨ 𝜓))
7	5, 6	bitr3i 265	. . . . 5 ⊢ (∃𝑦 ∈ 𝐵 (¬ 𝜑 ∧ ¬ 𝜓) ↔ ¬ ∀𝑦 ∈ 𝐵 (𝜑 ∨ 𝜓))
8	7	rexbii 3023	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (¬ 𝜑 ∧ ¬ 𝜓) ↔ ∃𝑥 ∈ 𝐴 ¬ ∀𝑦 ∈ 𝐵 (𝜑 ∨ 𝜓))
9		reeanv 3086	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (¬ 𝜑 ∧ ¬ 𝜓) ↔ (∃𝑥 ∈ 𝐴 ¬ 𝜑 ∧ ∃𝑦 ∈ 𝐵 ¬ 𝜓))
10		rexnal 2978	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ¬ ∀𝑦 ∈ 𝐵 (𝜑 ∨ 𝜓) ↔ ¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 ∨ 𝜓))
11	8, 9, 10	3bitr3ri 290	. . 3 ⊢ (¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 ∨ 𝜓) ↔ (∃𝑥 ∈ 𝐴 ¬ 𝜑 ∧ ∃𝑦 ∈ 𝐵 ¬ 𝜓))
12		ioran 510	. . 3 ⊢ (¬ (∀𝑥 ∈ 𝐴 𝜑 ∨ ∀𝑦 ∈ 𝐵 𝜓) ↔ (¬ ∀𝑥 ∈ 𝐴 𝜑 ∧ ¬ ∀𝑦 ∈ 𝐵 𝜓))
13	3, 11, 12	3bitr4i 291	. 2 ⊢ (¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 ∨ 𝜓) ↔ ¬ (∀𝑥 ∈ 𝐴 𝜑 ∨ ∀𝑦 ∈ 𝐵 𝜓))
14	13	con4bii 310	1 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 ∨ 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∨ ∀𝑦 ∈ 𝐵 𝜓))

Syntax hints:  ¬ wn 3   ↔ wb 195   ∨ wo 382   ∧ wa 383  ∀wral 2896  ∃wrex 2897

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-ral 2901  df-rex 2902

This theorem is referenced by:  ispridl2  33007