Theorem 2rexrsb 46364

Description: An equivalent expression for double restricted existence, analogous to 2exsb 2350. (Contributed by Alexander van der Vekens, 1-Jul-2017.)

Assertion

Ref	Expression
2rexrsb	⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝜑))

Distinct variable groups:   𝑥,𝑤,𝑦,𝑧,𝐵   𝑤,𝐴,𝑥,𝑧   𝜑,𝑧,𝑤

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐴(𝑦)

Proof of Theorem 2rexrsb

Step	Hyp	Ref	Expression
1		rexrsb 46362	. . . 4 ⊢ (∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑤 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑦 = 𝑤 → 𝜑))
2	1	rexbii 3088	. . 3 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑥 ∈ 𝐴 ∃𝑤 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑦 = 𝑤 → 𝜑))
3		rexcom 3281	. . 3 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑤 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑦 = 𝑤 → 𝜑) ↔ ∃𝑤 ∈ 𝐵 ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑦 = 𝑤 → 𝜑))
4	2, 3	bitri 275	. 2 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑤 ∈ 𝐵 ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑦 = 𝑤 → 𝜑))
5		rexrsb 46362	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑦 = 𝑤 → 𝜑) ↔ ∃𝑧 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝑥 = 𝑧 → ∀𝑦 ∈ 𝐵 (𝑦 = 𝑤 → 𝜑)))
6		impexp 450	. . . . . . . . 9 ⊢ (((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝜑) ↔ (𝑥 = 𝑧 → (𝑦 = 𝑤 → 𝜑)))
7	6	ralbii 3087	. . . . . . . 8 ⊢ (∀𝑦 ∈ 𝐵 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝜑) ↔ ∀𝑦 ∈ 𝐵 (𝑥 = 𝑧 → (𝑦 = 𝑤 → 𝜑)))
8		r19.21v 3173	. . . . . . . 8 ⊢ (∀𝑦 ∈ 𝐵 (𝑥 = 𝑧 → (𝑦 = 𝑤 → 𝜑)) ↔ (𝑥 = 𝑧 → ∀𝑦 ∈ 𝐵 (𝑦 = 𝑤 → 𝜑)))
9	7, 8	bitr2i 276	. . . . . . 7 ⊢ ((𝑥 = 𝑧 → ∀𝑦 ∈ 𝐵 (𝑦 = 𝑤 → 𝜑)) ↔ ∀𝑦 ∈ 𝐵 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝜑))
10	9	ralbii 3087	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 (𝑥 = 𝑧 → ∀𝑦 ∈ 𝐵 (𝑦 = 𝑤 → 𝜑)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝜑))
11	10	rexbii 3088	. . . . 5 ⊢ (∃𝑧 ∈ 𝐴 ∀𝑥 ∈ 𝐴 (𝑥 = 𝑧 → ∀𝑦 ∈ 𝐵 (𝑦 = 𝑤 → 𝜑)) ↔ ∃𝑧 ∈ 𝐴 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝜑))
12	5, 11	bitri 275	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑦 = 𝑤 → 𝜑) ↔ ∃𝑧 ∈ 𝐴 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝜑))
13	12	rexbii 3088	. . 3 ⊢ (∃𝑤 ∈ 𝐵 ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑦 = 𝑤 → 𝜑) ↔ ∃𝑤 ∈ 𝐵 ∃𝑧 ∈ 𝐴 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝜑))
14		rexcom 3281	. . 3 ⊢ (∃𝑤 ∈ 𝐵 ∃𝑧 ∈ 𝐴 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝜑) ↔ ∃𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝜑))
15	13, 14	bitri 275	. 2 ⊢ (∃𝑤 ∈ 𝐵 ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑦 = 𝑤 → 𝜑) ↔ ∃𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝜑))
16	4, 15	bitri 275	1 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ↔ ∃𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝜑))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395  ∀wral 3055  ∃wrex 3064

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  ax-6 1963  ax-7 2003  ax-8 2100  ax-10 2129  ax-11 2146  ax-12 2163

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-ex 1774  df-nf 1778  df-clel 2804  df-nfc 2879  df-ral 3056  df-rex 3065

This theorem is referenced by: (None)