Theorem 2ralorOLD 3220

Description: Obsolete version of 2ralor 3219 as of 20-Nov-2024. (Contributed by Jeff Madsen, 19-Jun-2010.) (New usage is discouraged.) (Proof modification is discouraged.)

Assertion

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

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

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

Proof of Theorem 2ralorOLD

Step	Hyp	Ref	Expression
1		rexnal 3090	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝜑 ↔ ¬ ∀𝑥 ∈ 𝐴 𝜑)
2		rexnal 3090	. . . 4 ⊢ (∃𝑦 ∈ 𝐵 ¬ 𝜓 ↔ ¬ ∀𝑦 ∈ 𝐵 𝜓)
3	1, 2	anbi12i 626	. . 3 ⊢ ((∃𝑥 ∈ 𝐴 ¬ 𝜑 ∧ ∃𝑦 ∈ 𝐵 ¬ 𝜓) ↔ (¬ ∀𝑥 ∈ 𝐴 𝜑 ∧ ¬ ∀𝑦 ∈ 𝐵 𝜓))
4		ioran 981	. . . . . . 7 ⊢ (¬ (𝜑 ∨ 𝜓) ↔ (¬ 𝜑 ∧ ¬ 𝜓))
5	4	rexbii 3084	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐵 ¬ (𝜑 ∨ 𝜓) ↔ ∃𝑦 ∈ 𝐵 (¬ 𝜑 ∧ ¬ 𝜓))
6		rexnal 3090	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐵 ¬ (𝜑 ∨ 𝜓) ↔ ¬ ∀𝑦 ∈ 𝐵 (𝜑 ∨ 𝜓))
7	5, 6	bitr3i 276	. . . . 5 ⊢ (∃𝑦 ∈ 𝐵 (¬ 𝜑 ∧ ¬ 𝜓) ↔ ¬ ∀𝑦 ∈ 𝐵 (𝜑 ∨ 𝜓))
8	7	rexbii 3084	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (¬ 𝜑 ∧ ¬ 𝜓) ↔ ∃𝑥 ∈ 𝐴 ¬ ∀𝑦 ∈ 𝐵 (𝜑 ∨ 𝜓))
9		reeanv 3217	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (¬ 𝜑 ∧ ¬ 𝜓) ↔ (∃𝑥 ∈ 𝐴 ¬ 𝜑 ∧ ∃𝑦 ∈ 𝐵 ¬ 𝜓))
10		rexnal 3090	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ¬ ∀𝑦 ∈ 𝐵 (𝜑 ∨ 𝜓) ↔ ¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 ∨ 𝜓))
11	8, 9, 10	3bitr3ri 301	. . 3 ⊢ (¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 ∨ 𝜓) ↔ (∃𝑥 ∈ 𝐴 ¬ 𝜑 ∧ ∃𝑦 ∈ 𝐵 ¬ 𝜓))
12		ioran 981	. . 3 ⊢ (¬ (∀𝑥 ∈ 𝐴 𝜑 ∨ ∀𝑦 ∈ 𝐵 𝜓) ↔ (¬ ∀𝑥 ∈ 𝐴 𝜑 ∧ ¬ ∀𝑦 ∈ 𝐵 𝜓))
13	3, 11, 12	3bitr4i 302	. 2 ⊢ (¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 ∨ 𝜓) ↔ ¬ (∀𝑥 ∈ 𝐴 𝜑 ∨ ∀𝑦 ∈ 𝐵 𝜓))
14	13	con4bii 320	1 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 ∨ 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∨ ∀𝑦 ∈ 𝐵 𝜓))

Syntax hints:  ¬ wn 3   ↔ wb 205   ∧ wa 394   ∨ wo 845  ∀wral 3051  ∃wrex 3060

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-ex 1774  df-ral 3052  df-rex 3061

This theorem is referenced by: (None)