Theorem 2reu5 3721

Description: Double restricted existential uniqueness in terms of restricted existential quantification and restricted universal quantification, analogous to 2eu5 2683 and reu3 3690. (Contributed by Alexander van der Vekens, 17-Jun-2017.)

Assertion

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

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

Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem 2reu5

Step	Hyp	Ref	Expression
1		r19.29r 3129	. . . . . . . 8 ⊢ ((∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))) → ∃𝑥 ∈ 𝐴 (∃𝑦 ∈ 𝐵 𝜑 ∧ ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))))
2		r19.29r 3129	. . . . . . . . 9 ⊢ ((∃𝑦 ∈ 𝐵 𝜑 ∧ ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))) → ∃𝑦 ∈ 𝐵 (𝜑 ∧ (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))))
3	2	reximi 3103	. . . . . . . 8 ⊢ (∃𝑥 ∈ 𝐴 (∃𝑦 ∈ 𝐵 𝜑 ∧ ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))) → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝜑 ∧ (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))))
4		pm3.35 814	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))) → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))
5	4	reximi 3103	. . . . . . . . 9 ⊢ (∃𝑦 ∈ 𝐵 (𝜑 ∧ (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))) → ∃𝑦 ∈ 𝐵 (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))
6	5	reximi 3103	. . . . . . . 8 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝜑 ∧ (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))) → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))
7		eleq1w 2846	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴))
8		eleq1w 2846	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑤 → (𝑦 ∈ 𝐵 ↔ 𝑤 ∈ 𝐵))
9	7, 8	bi2anan9 649	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ↔ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵)))
10	9	biimpac 483	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 = 𝑧 ∧ 𝑦 = 𝑤)) → (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐵))
11	10	ancomd 466	. . . . . . . . . 10 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 = 𝑧 ∧ 𝑦 = 𝑤)) → (𝑤 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴))
12	11	ex 417	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (𝑤 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴)))
13	12	rexlimivv 3207	. . . . . . . 8 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (𝑤 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴))
14	1, 3, 6, 13	4syl 20	. . . . . . 7 ⊢ ((∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))) → (𝑤 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴))
15	14	ex 417	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤)) → (𝑤 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴)))
16	15	pm4.71rd 571	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤)) ↔ ((𝑤 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤)))))
17		anass 473	. . . . 5 ⊢ (((𝑤 ∈ 𝐵 ∧ 𝑧 ∈ 𝐴) ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))) ↔ (𝑤 ∈ 𝐵 ∧ (𝑧 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤)))))
18	16, 17	bitrdi 290	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤)) ↔ (𝑤 ∈ 𝐵 ∧ (𝑧 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))))))
19	18	2exbidv 1954	. . 3 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 → (∃𝑧∃𝑤∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤)) ↔ ∃𝑧∃𝑤(𝑤 ∈ 𝐵 ∧ (𝑧 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))))))
20	19	pm5.32i 584	. 2 ⊢ ((∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ ∃𝑧∃𝑤∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))) ↔ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ ∃𝑧∃𝑤(𝑤 ∈ 𝐵 ∧ (𝑧 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))))))
21		2reu5lem3 3720	. 2 ⊢ ((∃!𝑥 ∈ 𝐴 ∃!𝑦 ∈ 𝐵 𝜑 ∧ ∀𝑥 ∈ 𝐴 ∃*𝑦 ∈ 𝐵 𝜑) ↔ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ ∃𝑧∃𝑤∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))))
22		df-rex 3090	. . . 4 ⊢ (∃𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤)) ↔ ∃𝑧(𝑧 ∈ 𝐴 ∧ ∃𝑤 ∈ 𝐵 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))))
23		r19.42v 3197	. . . . . 6 ⊢ (∃𝑤 ∈ 𝐵 (𝑧 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))) ↔ (𝑧 ∈ 𝐴 ∧ ∃𝑤 ∈ 𝐵 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))))
24		df-rex 3090	. . . . . 6 ⊢ (∃𝑤 ∈ 𝐵 (𝑧 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))) ↔ ∃𝑤(𝑤 ∈ 𝐵 ∧ (𝑧 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤)))))
25	23, 24	bitr3i 280	. . . . 5 ⊢ ((𝑧 ∈ 𝐴 ∧ ∃𝑤 ∈ 𝐵 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))) ↔ ∃𝑤(𝑤 ∈ 𝐵 ∧ (𝑧 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤)))))
26	25	exbii 1878	. . . 4 ⊢ (∃𝑧(𝑧 ∈ 𝐴 ∧ ∃𝑤 ∈ 𝐵 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))) ↔ ∃𝑧∃𝑤(𝑤 ∈ 𝐵 ∧ (𝑧 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤)))))
27	22, 26	bitri 278	. . 3 ⊢ (∃𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤)) ↔ ∃𝑧∃𝑤(𝑤 ∈ 𝐵 ∧ (𝑧 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤)))))
28	27	anbi2i 634	. 2 ⊢ ((∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ ∃𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))) ↔ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ ∃𝑧∃𝑤(𝑤 ∈ 𝐵 ∧ (𝑧 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))))))
29	20, 21, 28	3bitr4i 306	1 ⊢ ((∃!𝑥 ∈ 𝐴 ∃!𝑦 ∈ 𝐵 𝜑 ∧ ∀𝑥 ∈ 𝐴 ∃*𝑦 ∈ 𝐵 𝜑) ↔ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝜑 ∧ ∃𝑧 ∈ 𝐴 ∃𝑤 ∈ 𝐵 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400  ∃wex 1809   ∈ wcel 2143  ∀wral 3079  ∃wrex 3089  ∃!wreu 3367  ∃*wrmo 3368

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-10 2176  ax-11 2192  ax-12 2213

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-ex 1810  df-nf 1814  df-mo 2567  df-eu 2597  df-clel 2838  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370

This theorem is used by: (None)