MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  opiota Structured version   Visualization version   GIF version

Theorem opiota 7470
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
StepHypRef Expression
1 opiota.4 . . . . . . 7 (𝑥 = 𝐶 → (𝜑𝜓))
2 opiota.5 . . . . . . 7 (𝑦 = 𝐷 → (𝜓𝜒))
31, 2ceqsrex2v 3543 . . . . . 6 ((𝐶𝐴𝐷𝐵) → (∃𝑥𝐴𝑦𝐵 ((𝑥 = 𝐶𝑦 = 𝐷) ∧ 𝜑) ↔ 𝜒))
43bicomd 214 . . . . 5 ((𝐶𝐴𝐷𝐵) → (𝜒 ↔ ∃𝑥𝐴𝑦𝐵 ((𝑥 = 𝐶𝑦 = 𝐷) ∧ 𝜑)))
5 opex 5135 . . . . . . . 8 𝐶, 𝐷⟩ ∈ V
65a1i 11 . . . . . . 7 (∃!𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ⟨𝐶, 𝐷⟩ ∈ V)
7 id 22 . . . . . . 7 (∃!𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ∃!𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
8 eqeq1 2821 . . . . . . . . . . 11 (𝑧 = ⟨𝐶, 𝐷⟩ → (𝑧 = ⟨𝑥, 𝑦⟩ ↔ ⟨𝐶, 𝐷⟩ = ⟨𝑥, 𝑦⟩))
9 eqcom 2824 . . . . . . . . . . . 12 (⟨𝐶, 𝐷⟩ = ⟨𝑥, 𝑦⟩ ↔ ⟨𝑥, 𝑦⟩ = ⟨𝐶, 𝐷⟩)
10 vex 3405 . . . . . . . . . . . . 13 𝑥 ∈ V
11 vex 3405 . . . . . . . . . . . . 13 𝑦 ∈ V
1210, 11opth 5147 . . . . . . . . . . . 12 (⟨𝑥, 𝑦⟩ = ⟨𝐶, 𝐷⟩ ↔ (𝑥 = 𝐶𝑦 = 𝐷))
139, 12bitri 266 . . . . . . . . . . 11 (⟨𝐶, 𝐷⟩ = ⟨𝑥, 𝑦⟩ ↔ (𝑥 = 𝐶𝑦 = 𝐷))
148, 13syl6bb 278 . . . . . . . . . 10 (𝑧 = ⟨𝐶, 𝐷⟩ → (𝑧 = ⟨𝑥, 𝑦⟩ ↔ (𝑥 = 𝐶𝑦 = 𝐷)))
1514anbi1d 617 . . . . . . . . 9 (𝑧 = ⟨𝐶, 𝐷⟩ → ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ((𝑥 = 𝐶𝑦 = 𝐷) ∧ 𝜑)))
16152rexbidv 3256 . . . . . . . 8 (𝑧 = ⟨𝐶, 𝐷⟩ → (∃𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥𝐴𝑦𝐵 ((𝑥 = 𝐶𝑦 = 𝐷) ∧ 𝜑)))
1716adantl 469 . . . . . . 7 ((∃!𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ∧ 𝑧 = ⟨𝐶, 𝐷⟩) → (∃𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥𝐴𝑦𝐵 ((𝑥 = 𝐶𝑦 = 𝐷) ∧ 𝜑)))
18 nfeu1 2653 . . . . . . 7 𝑧∃!𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)
19 nfvd 2006 . . . . . . 7 (∃!𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → Ⅎ𝑧𝑥𝐴𝑦𝐵 ((𝑥 = 𝐶𝑦 = 𝐷) ∧ 𝜑))
20 nfcvd 2960 . . . . . . 7 (∃!𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → 𝑧𝐶, 𝐷⟩)
216, 7, 17, 18, 19, 20iota2df 6097 . . . . . 6 (∃!𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (∃𝑥𝐴𝑦𝐵 ((𝑥 = 𝐶𝑦 = 𝐷) ∧ 𝜑) ↔ (℩𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) = ⟨𝐶, 𝐷⟩))
22 eqcom 2824 . . . . . . 7 (⟨𝐶, 𝐷⟩ = 𝐼𝐼 = ⟨𝐶, 𝐷⟩)
23 opiota.1 . . . . . . . 8 𝐼 = (℩𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
2423eqeq1i 2822 . . . . . . 7 (𝐼 = ⟨𝐶, 𝐷⟩ ↔ (℩𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) = ⟨𝐶, 𝐷⟩)
2522, 24bitri 266 . . . . . 6 (⟨𝐶, 𝐷⟩ = 𝐼 ↔ (℩𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) = ⟨𝐶, 𝐷⟩)
2621, 25syl6bbr 280 . . . . 5 (∃!𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (∃𝑥𝐴𝑦𝐵 ((𝑥 = 𝐶𝑦 = 𝐷) ∧ 𝜑) ↔ ⟨𝐶, 𝐷⟩ = 𝐼))
274, 26sylan9bbr 502 . . . 4 ((∃!𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ∧ (𝐶𝐴𝐷𝐵)) → (𝜒 ↔ ⟨𝐶, 𝐷⟩ = 𝐼))
2827pm5.32da 570 . . 3 (∃!𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (((𝐶𝐴𝐷𝐵) ∧ 𝜒) ↔ ((𝐶𝐴𝐷𝐵) ∧ ⟨𝐶, 𝐷⟩ = 𝐼)))
29 opelxpi 5361 . . . . . . . . . 10 ((𝑥𝐴𝑦𝐵) → ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵))
30 simpl 470 . . . . . . . . . . 11 ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → 𝑧 = ⟨𝑥, 𝑦⟩)
3130eleq1d 2881 . . . . . . . . . 10 ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (𝑧 ∈ (𝐴 × 𝐵) ↔ ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵)))
3229, 31syl5ibrcom 238 . . . . . . . . 9 ((𝑥𝐴𝑦𝐵) → ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → 𝑧 ∈ (𝐴 × 𝐵)))
3332rexlimivv 3235 . . . . . . . 8 (∃𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → 𝑧 ∈ (𝐴 × 𝐵))
3433abssi 3885 . . . . . . 7 {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} ⊆ (𝐴 × 𝐵)
35 iotacl 6096 . . . . . . 7 (∃!𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (℩𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) ∈ {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)})
3634, 35sseldi 3807 . . . . . 6 (∃!𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (℩𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) ∈ (𝐴 × 𝐵))
3723, 36syl5eqel 2900 . . . . 5 (∃!𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → 𝐼 ∈ (𝐴 × 𝐵))
38 opelxp 5359 . . . . . 6 (⟨𝐶, 𝐷⟩ ∈ (𝐴 × 𝐵) ↔ (𝐶𝐴𝐷𝐵))
39 eleq1 2884 . . . . . 6 (⟨𝐶, 𝐷⟩ = 𝐼 → (⟨𝐶, 𝐷⟩ ∈ (𝐴 × 𝐵) ↔ 𝐼 ∈ (𝐴 × 𝐵)))
4038, 39syl5bbr 276 . . . . 5 (⟨𝐶, 𝐷⟩ = 𝐼 → ((𝐶𝐴𝐷𝐵) ↔ 𝐼 ∈ (𝐴 × 𝐵)))
4137, 40syl5ibrcom 238 . . . 4 (∃!𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (⟨𝐶, 𝐷⟩ = 𝐼 → (𝐶𝐴𝐷𝐵)))
4241pm4.71rd 554 . . 3 (∃!𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (⟨𝐶, 𝐷⟩ = 𝐼 ↔ ((𝐶𝐴𝐷𝐵) ∧ ⟨𝐶, 𝐷⟩ = 𝐼)))
43 1st2nd2 7446 . . . . 5 (𝐼 ∈ (𝐴 × 𝐵) → 𝐼 = ⟨(1st𝐼), (2nd𝐼)⟩)
4437, 43syl 17 . . . 4 (∃!𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → 𝐼 = ⟨(1st𝐼), (2nd𝐼)⟩)
4544eqeq2d 2827 . . 3 (∃!𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (⟨𝐶, 𝐷⟩ = 𝐼 ↔ ⟨𝐶, 𝐷⟩ = ⟨(1st𝐼), (2nd𝐼)⟩))
4628, 42, 453bitr2d 298 . 2 (∃!𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → (((𝐶𝐴𝐷𝐵) ∧ 𝜒) ↔ ⟨𝐶, 𝐷⟩ = ⟨(1st𝐼), (2nd𝐼)⟩))
47 df-3an 1102 . 2 ((𝐶𝐴𝐷𝐵𝜒) ↔ ((𝐶𝐴𝐷𝐵) ∧ 𝜒))
48 opiota.2 . . . . 5 𝑋 = (1st𝐼)
4948eqeq2i 2829 . . . 4 (𝐶 = 𝑋𝐶 = (1st𝐼))
50 opiota.3 . . . . 5 𝑌 = (2nd𝐼)
5150eqeq2i 2829 . . . 4 (𝐷 = 𝑌𝐷 = (2nd𝐼))
5249, 51anbi12i 614 . . 3 ((𝐶 = 𝑋𝐷 = 𝑌) ↔ (𝐶 = (1st𝐼) ∧ 𝐷 = (2nd𝐼)))
53 fvex 6430 . . . 4 (1st𝐼) ∈ V
54 fvex 6430 . . . 4 (2nd𝐼) ∈ V
5553, 54opth2 5151 . . 3 (⟨𝐶, 𝐷⟩ = ⟨(1st𝐼), (2nd𝐼)⟩ ↔ (𝐶 = (1st𝐼) ∧ 𝐷 = (2nd𝐼)))
5652, 55bitr4i 269 . 2 ((𝐶 = 𝑋𝐷 = 𝑌) ↔ ⟨𝐶, 𝐷⟩ = ⟨(1st𝐼), (2nd𝐼)⟩)
5746, 47, 563bitr4g 305 1 (∃!𝑧𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ((𝐶𝐴𝐷𝐵𝜒) ↔ (𝐶 = 𝑋𝐷 = 𝑌)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 197  wa 384  w3a 1100   = wceq 1637  wcel 2157  ∃!weu 2641  {cab 2803  wrex 3108  Vcvv 3402  cop 4387   × cxp 5322  cio 6071  cfv 6110  1st c1st 7405  2nd c2nd 7406
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1877  ax-4 1894  ax-5 2001  ax-6 2069  ax-7 2105  ax-8 2159  ax-9 2166  ax-10 2186  ax-11 2202  ax-12 2215  ax-13 2422  ax-ext 2795  ax-sep 4988  ax-nul 4996  ax-pow 5048  ax-pr 5109  ax-un 7188
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 866  df-3an 1102  df-tru 1641  df-ex 1860  df-nf 1864  df-sb 2062  df-mo 2635  df-eu 2642  df-clab 2804  df-cleq 2810  df-clel 2813  df-nfc 2948  df-ral 3112  df-rex 3113  df-rab 3116  df-v 3404  df-sbc 3645  df-dif 3783  df-un 3785  df-in 3787  df-ss 3794  df-nul 4128  df-if 4291  df-sn 4382  df-pr 4384  df-op 4388  df-uni 4642  df-br 4856  df-opab 4918  df-mpt 4935  df-id 5232  df-xp 5330  df-rel 5331  df-cnv 5332  df-co 5333  df-dm 5334  df-rn 5335  df-iota 6073  df-fun 6112  df-fv 6118  df-1st 7407  df-2nd 7408
This theorem is referenced by:  oeeui  7928
  Copyright terms: Public domain W3C validator