Theorem opiota 7991

Description: The property of a uniquely specified ordered pair. The proof uses properties of the ℩ description binder. (Contributed by Mario Carneiro, 21-May-2015.)

Hypotheses

Ref	Expression
opiota.1	⊢ 𝐼 = (℩𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
opiota.2	⊢ 𝑋 = (1st ‘𝐼)
opiota.3	⊢ 𝑌 = (2nd ‘𝐼)
opiota.4	⊢ (𝑥 = 𝐶 → (𝜑 ↔ 𝜓))
opiota.5	⊢ (𝑦 = 𝐷 → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
opiota	⊢ (∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵 ∧ 𝜒) ↔ (𝐶 = 𝑋 ∧ 𝐷 = 𝑌)))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝜒,𝑦   𝜑,𝑧   𝑥,𝐷,𝑦,𝑧   𝜓,𝑥

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑦,𝑧)   𝜒(𝑥,𝑧)   𝐼(𝑥,𝑦,𝑧)   𝑋(𝑥,𝑦,𝑧)   𝑌(𝑥,𝑦,𝑧)

Proof of Theorem opiota

Step	Hyp	Ref	Expression
1		opiota.4	. . . . . . 7 ⊢ (𝑥 = 𝐶 → (𝜑 ↔ 𝜓))
2		opiota.5	. . . . . . 7 ⊢ (𝑦 = 𝐷 → (𝜓 ↔ 𝜒))
3	1, 2	ceqsrex2v 3608	. . . . . 6 ⊢ ((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ((𝑥 = 𝐶 ∧ 𝑦 = 𝐷) ∧ 𝜑) ↔ 𝜒))
4	3	bicomd 222	. . . . 5 ⊢ ((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → (𝜒 ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ((𝑥 = 𝐶 ∧ 𝑦 = 𝐷) ∧ 𝜑)))
5		opex 5421	. . . . . . . 8 ⊢ ⟨𝐶, 𝐷⟩ ∈ V
6	5	a1i 11	. . . . . . 7 ⊢ (∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ⟨𝐶, 𝐷⟩ ∈ V)
7		id 22	. . . . . . 7 ⊢ (∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
8		eqeq1 2740	. . . . . . . . . . 11 ⊢ (𝑧 = ⟨𝐶, 𝐷⟩ → (𝑧 = ⟨𝑥, 𝑦⟩ ↔ ⟨𝐶, 𝐷⟩ = ⟨𝑥, 𝑦⟩))
9		eqcom 2743	. . . . . . . . . . . 12 ⊢ (⟨𝐶, 𝐷⟩ = ⟨𝑥, 𝑦⟩ ↔ ⟨𝑥, 𝑦⟩ = ⟨𝐶, 𝐷⟩)
10		vex 3449	. . . . . . . . . . . . 13 ⊢ 𝑥 ∈ V
11		vex 3449	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
12	10, 11	opth 5433	. . . . . . . . . . . 12 ⊢ (⟨𝑥, 𝑦⟩ = ⟨𝐶, 𝐷⟩ ↔ (𝑥 = 𝐶 ∧ 𝑦 = 𝐷))
13	9, 12	bitri 274	. . . . . . . . . . 11 ⊢ (⟨𝐶, 𝐷⟩ = ⟨𝑥, 𝑦⟩ ↔ (𝑥 = 𝐶 ∧ 𝑦 = 𝐷))
14	8, 13	bitrdi 286	. . . . . . . . . 10 ⊢ (𝑧 = ⟨𝐶, 𝐷⟩ → (𝑧 = ⟨𝑥, 𝑦⟩ ↔ (𝑥 = 𝐶 ∧ 𝑦 = 𝐷)))
15	14	anbi1d 630	. . . . . . . . 9 ⊢ (𝑧 = ⟨𝐶, 𝐷⟩ → ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ((𝑥 = 𝐶 ∧ 𝑦 = 𝐷) ∧ 𝜑)))
16	15	2rexbidv 3213	. . . . . . . 8 ⊢ (𝑧 = ⟨𝐶, 𝐷⟩ → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ((𝑥 = 𝐶 ∧ 𝑦 = 𝐷) ∧ 𝜑)))
17	16	adantl 482	. . . . . . 7 ⊢ ((∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ∧ 𝑧 = ⟨𝐶, 𝐷⟩) → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ((𝑥 = 𝐶 ∧ 𝑦 = 𝐷) ∧ 𝜑)))
18		nfeu1 2586	. . . . . . 7 ⊢ Ⅎ𝑧∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
19		nfvd 1918	. . . . . . 7 ⊢ (∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → Ⅎ𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ((𝑥 = 𝐶 ∧ 𝑦 = 𝐷) ∧ 𝜑))
20		nfcvd 2908	. . . . . . 7 ⊢ (∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → Ⅎ𝑧⟨𝐶, 𝐷⟩)
21	6, 7, 17, 18, 19, 20	iota2df 6483	. . . . . 6 ⊢ (∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ((𝑥 = 𝐶 ∧ 𝑦 = 𝐷) ∧ 𝜑) ↔ (℩𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) = ⟨𝐶, 𝐷⟩))
22		eqcom 2743	. . . . . . 7 ⊢ (⟨𝐶, 𝐷⟩ = 𝐼 ↔ 𝐼 = ⟨𝐶, 𝐷⟩)
23		opiota.1	. . . . . . . 8 ⊢ 𝐼 = (℩𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
24	23	eqeq1i 2741	. . . . . . 7 ⊢ (𝐼 = ⟨𝐶, 𝐷⟩ ↔ (℩𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) = ⟨𝐶, 𝐷⟩)
25	22, 24	bitri 274	. . . . . 6 ⊢ (⟨𝐶, 𝐷⟩ = 𝐼 ↔ (℩𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) = ⟨𝐶, 𝐷⟩)
26	21, 25	bitr4di 288	. . . . 5 ⊢ (∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 ((𝑥 = 𝐶 ∧ 𝑦 = 𝐷) ∧ 𝜑) ↔ ⟨𝐶, 𝐷⟩ = 𝐼))
27	4, 26	sylan9bbr 511	. . . 4 ⊢ ((∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ∧ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵)) → (𝜒 ↔ ⟨𝐶, 𝐷⟩ = 𝐼))
28	27	pm5.32da 579	. . 3 ⊢ (∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) ∧ 𝜒) ↔ ((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) ∧ ⟨𝐶, 𝐷⟩ = 𝐼)))
29		opelxpi 5670	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵))
30		simpl 483	. . . . . . . . . . 11 ⊢ ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → 𝑧 = ⟨𝑥, 𝑦⟩)
31	30	eleq1d 2822	. . . . . . . . . 10 ⊢ ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (𝑧 ∈ (𝐴 × 𝐵) ↔ ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵)))
32	29, 31	syl5ibrcom 246	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → 𝑧 ∈ (𝐴 × 𝐵)))
33	32	rexlimivv 3196	. . . . . . . 8 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → 𝑧 ∈ (𝐴 × 𝐵))
34	33	abssi 4027	. . . . . . 7 ⊢ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} ⊆ (𝐴 × 𝐵)
35		iotacl 6482	. . . . . . 7 ⊢ (∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (℩𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)})
36	34, 35	sselid 3942	. . . . . 6 ⊢ (∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (℩𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) ∈ (𝐴 × 𝐵))
37	23, 36	eqeltrid 2842	. . . . 5 ⊢ (∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → 𝐼 ∈ (𝐴 × 𝐵))
38		opelxp 5669	. . . . . 6 ⊢ (⟨𝐶, 𝐷⟩ ∈ (𝐴 × 𝐵) ↔ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵))
39		eleq1 2825	. . . . . 6 ⊢ (⟨𝐶, 𝐷⟩ = 𝐼 → (⟨𝐶, 𝐷⟩ ∈ (𝐴 × 𝐵) ↔ 𝐼 ∈ (𝐴 × 𝐵)))
40	38, 39	bitr3id 284	. . . . 5 ⊢ (⟨𝐶, 𝐷⟩ = 𝐼 → ((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) ↔ 𝐼 ∈ (𝐴 × 𝐵)))
41	37, 40	syl5ibrcom 246	. . . 4 ⊢ (∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (⟨𝐶, 𝐷⟩ = 𝐼 → (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵)))
42	41	pm4.71rd 563	. . 3 ⊢ (∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (⟨𝐶, 𝐷⟩ = 𝐼 ↔ ((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) ∧ ⟨𝐶, 𝐷⟩ = 𝐼)))
43		1st2nd2 7960	. . . . 5 ⊢ (𝐼 ∈ (𝐴 × 𝐵) → 𝐼 = ⟨(1st ‘𝐼), (2nd ‘𝐼)⟩)
44	37, 43	syl 17	. . . 4 ⊢ (∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → 𝐼 = ⟨(1st ‘𝐼), (2nd ‘𝐼)⟩)
45	44	eqeq2d 2747	. . 3 ⊢ (∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (⟨𝐶, 𝐷⟩ = 𝐼 ↔ ⟨𝐶, 𝐷⟩ = ⟨(1st ‘𝐼), (2nd ‘𝐼)⟩))
46	28, 42, 45	3bitr2d 306	. 2 ⊢ (∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) ∧ 𝜒) ↔ ⟨𝐶, 𝐷⟩ = ⟨(1st ‘𝐼), (2nd ‘𝐼)⟩))
47		df-3an 1089	. 2 ⊢ ((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵 ∧ 𝜒) ↔ ((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) ∧ 𝜒))
48		opiota.2	. . . . 5 ⊢ 𝑋 = (1st ‘𝐼)
49	48	eqeq2i 2749	. . . 4 ⊢ (𝐶 = 𝑋 ↔ 𝐶 = (1st ‘𝐼))
50		opiota.3	. . . . 5 ⊢ 𝑌 = (2nd ‘𝐼)
51	50	eqeq2i 2749	. . . 4 ⊢ (𝐷 = 𝑌 ↔ 𝐷 = (2nd ‘𝐼))
52	49, 51	anbi12i 627	. . 3 ⊢ ((𝐶 = 𝑋 ∧ 𝐷 = 𝑌) ↔ (𝐶 = (1st ‘𝐼) ∧ 𝐷 = (2nd ‘𝐼)))
53		fvex 6855	. . . 4 ⊢ (1st ‘𝐼) ∈ V
54		fvex 6855	. . . 4 ⊢ (2nd ‘𝐼) ∈ V
55	53, 54	opth2 5437	. . 3 ⊢ (⟨𝐶, 𝐷⟩ = ⟨(1st ‘𝐼), (2nd ‘𝐼)⟩ ↔ (𝐶 = (1st ‘𝐼) ∧ 𝐷 = (2nd ‘𝐼)))
56	52, 55	bitr4i 277	. 2 ⊢ ((𝐶 = 𝑋 ∧ 𝐷 = 𝑌) ↔ ⟨𝐶, 𝐷⟩ = ⟨(1st ‘𝐼), (2nd ‘𝐼)⟩)
57	46, 47, 56	3bitr4g 313	1 ⊢ (∃!𝑧∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵 ∧ 𝜒) ↔ (𝐶 = 𝑋 ∧ 𝐷 = 𝑌)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106  ∃!weu 2566  {cab 2713  ∃wrex 3073  Vcvv 3445  ⟨cop 4592   × cxp 5631  ℩cio 6446  ‘cfv 6496  1^st c1st 7919  2^nd c2nd 7920

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pr 5384  ax-un 7672

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-sbc 3740  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-iota 6448  df-fun 6498  df-fv 6504  df-1st 7921  df-2nd 7922

This theorem is referenced by:  oeeui  8549