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

Theorem copsexg 5370
 Description: Substitution of class 𝐴 for ordered pair ⟨𝑥, 𝑦⟩. Usage of this theorem is discouraged because it depends on ax-13 2392. Use the weaker copsexgw 5369 when possible. (Contributed by NM, 27-Dec-1996.) (Revised by Andrew Salmon, 11-Jul-2011.) (Proof shortened by Wolf Lammen, 25-Aug-2019.) (New usage is discouraged.)
Assertion
Ref Expression
copsexg (𝐴 = ⟨𝑥, 𝑦⟩ → (𝜑 ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
Distinct variable groups:   𝑥,𝐴   𝑦,𝐴
Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem copsexg
Dummy variables 𝑧 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 3483 . . . 4 𝑥 ∈ V
2 vex 3483 . . . 4 𝑦 ∈ V
31, 2eqvinop 5366 . . 3 (𝐴 = ⟨𝑥, 𝑦⟩ ↔ ∃𝑧𝑤(𝐴 = ⟨𝑧, 𝑤⟩ ∧ ⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩))
4 19.8a 2182 . . . . . . . . 9 (∃𝑦(⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ∃𝑥𝑦(⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
5419.23bi 2192 . . . . . . . 8 ((⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → ∃𝑥𝑦(⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
65ex 416 . . . . . . 7 (⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ → (𝜑 → ∃𝑥𝑦(⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
7 vex 3483 . . . . . . . . 9 𝑧 ∈ V
8 vex 3483 . . . . . . . . 9 𝑤 ∈ V
97, 8opth 5356 . . . . . . . 8 (⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ↔ (𝑧 = 𝑥𝑤 = 𝑦))
109anbi1i 626 . . . . . . . . . 10 ((⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ((𝑧 = 𝑥𝑤 = 𝑦) ∧ 𝜑))
11102exbii 1850 . . . . . . . . 9 (∃𝑥𝑦(⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥𝑦((𝑧 = 𝑥𝑤 = 𝑦) ∧ 𝜑))
12 nfe1 2155 . . . . . . . . . . 11 𝑥𝑥(𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑))
13 19.8a 2182 . . . . . . . . . . . . . . . 16 ((𝑤 = 𝑦𝜑) → ∃𝑦(𝑤 = 𝑦𝜑))
1413anim2i 619 . . . . . . . . . . . . . . 15 ((𝑧 = 𝑥 ∧ (𝑤 = 𝑦𝜑)) → (𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑)))
1514anassrs 471 . . . . . . . . . . . . . 14 (((𝑧 = 𝑥𝑤 = 𝑦) ∧ 𝜑) → (𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑)))
1615eximi 1836 . . . . . . . . . . . . 13 (∃𝑦((𝑧 = 𝑥𝑤 = 𝑦) ∧ 𝜑) → ∃𝑦(𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑)))
17 biidd 265 . . . . . . . . . . . . . 14 (∀𝑦 𝑦 = 𝑥 → ((𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑)) ↔ (𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑))))
1817drex1 2465 . . . . . . . . . . . . 13 (∀𝑦 𝑦 = 𝑥 → (∃𝑦(𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑)) ↔ ∃𝑥(𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑))))
1916, 18syl5ib 247 . . . . . . . . . . . 12 (∀𝑦 𝑦 = 𝑥 → (∃𝑦((𝑧 = 𝑥𝑤 = 𝑦) ∧ 𝜑) → ∃𝑥(𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑))))
20 anass 472 . . . . . . . . . . . . . . 15 (((𝑧 = 𝑥𝑤 = 𝑦) ∧ 𝜑) ↔ (𝑧 = 𝑥 ∧ (𝑤 = 𝑦𝜑)))
2120exbii 1849 . . . . . . . . . . . . . 14 (∃𝑦((𝑧 = 𝑥𝑤 = 𝑦) ∧ 𝜑) ↔ ∃𝑦(𝑧 = 𝑥 ∧ (𝑤 = 𝑦𝜑)))
22 19.40 1888 . . . . . . . . . . . . . . 15 (∃𝑦(𝑧 = 𝑥 ∧ (𝑤 = 𝑦𝜑)) → (∃𝑦 𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑)))
23 nfeqf2 2397 . . . . . . . . . . . . . . . . 17 (¬ ∀𝑦 𝑦 = 𝑥 → Ⅎ𝑦 𝑧 = 𝑥)
242319.9d 2205 . . . . . . . . . . . . . . . 16 (¬ ∀𝑦 𝑦 = 𝑥 → (∃𝑦 𝑧 = 𝑥𝑧 = 𝑥))
2524anim1d 613 . . . . . . . . . . . . . . 15 (¬ ∀𝑦 𝑦 = 𝑥 → ((∃𝑦 𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑)) → (𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑))))
2622, 25syl5 34 . . . . . . . . . . . . . 14 (¬ ∀𝑦 𝑦 = 𝑥 → (∃𝑦(𝑧 = 𝑥 ∧ (𝑤 = 𝑦𝜑)) → (𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑))))
2721, 26syl5bi 245 . . . . . . . . . . . . 13 (¬ ∀𝑦 𝑦 = 𝑥 → (∃𝑦((𝑧 = 𝑥𝑤 = 𝑦) ∧ 𝜑) → (𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑))))
28 19.8a 2182 . . . . . . . . . . . . 13 ((𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑)) → ∃𝑥(𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑)))
2927, 28syl6 35 . . . . . . . . . . . 12 (¬ ∀𝑦 𝑦 = 𝑥 → (∃𝑦((𝑧 = 𝑥𝑤 = 𝑦) ∧ 𝜑) → ∃𝑥(𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑))))
3019, 29pm2.61i 185 . . . . . . . . . . 11 (∃𝑦((𝑧 = 𝑥𝑤 = 𝑦) ∧ 𝜑) → ∃𝑥(𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑)))
3112, 30exlimi 2219 . . . . . . . . . 10 (∃𝑥𝑦((𝑧 = 𝑥𝑤 = 𝑦) ∧ 𝜑) → ∃𝑥(𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑)))
32 euequ 2684 . . . . . . . . . . . . . 14 ∃!𝑥 𝑥 = 𝑧
33 equcom 2026 . . . . . . . . . . . . . . 15 (𝑥 = 𝑧𝑧 = 𝑥)
3433eubii 2671 . . . . . . . . . . . . . 14 (∃!𝑥 𝑥 = 𝑧 ↔ ∃!𝑥 𝑧 = 𝑥)
3532, 34mpbi 233 . . . . . . . . . . . . 13 ∃!𝑥 𝑧 = 𝑥
36 eupick 2721 . . . . . . . . . . . . 13 ((∃!𝑥 𝑧 = 𝑥 ∧ ∃𝑥(𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑))) → (𝑧 = 𝑥 → ∃𝑦(𝑤 = 𝑦𝜑)))
3735, 36mpan 689 . . . . . . . . . . . 12 (∃𝑥(𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑)) → (𝑧 = 𝑥 → ∃𝑦(𝑤 = 𝑦𝜑)))
3837com12 32 . . . . . . . . . . 11 (𝑧 = 𝑥 → (∃𝑥(𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑)) → ∃𝑦(𝑤 = 𝑦𝜑)))
39 euequ 2684 . . . . . . . . . . . . . 14 ∃!𝑦 𝑦 = 𝑤
40 equcom 2026 . . . . . . . . . . . . . . 15 (𝑦 = 𝑤𝑤 = 𝑦)
4140eubii 2671 . . . . . . . . . . . . . 14 (∃!𝑦 𝑦 = 𝑤 ↔ ∃!𝑦 𝑤 = 𝑦)
4239, 41mpbi 233 . . . . . . . . . . . . 13 ∃!𝑦 𝑤 = 𝑦
43 eupick 2721 . . . . . . . . . . . . 13 ((∃!𝑦 𝑤 = 𝑦 ∧ ∃𝑦(𝑤 = 𝑦𝜑)) → (𝑤 = 𝑦𝜑))
4442, 43mpan 689 . . . . . . . . . . . 12 (∃𝑦(𝑤 = 𝑦𝜑) → (𝑤 = 𝑦𝜑))
4544com12 32 . . . . . . . . . . 11 (𝑤 = 𝑦 → (∃𝑦(𝑤 = 𝑦𝜑) → 𝜑))
4638, 45sylan9 511 . . . . . . . . . 10 ((𝑧 = 𝑥𝑤 = 𝑦) → (∃𝑥(𝑧 = 𝑥 ∧ ∃𝑦(𝑤 = 𝑦𝜑)) → 𝜑))
4731, 46syl5 34 . . . . . . . . 9 ((𝑧 = 𝑥𝑤 = 𝑦) → (∃𝑥𝑦((𝑧 = 𝑥𝑤 = 𝑦) ∧ 𝜑) → 𝜑))
4811, 47syl5bi 245 . . . . . . . 8 ((𝑧 = 𝑥𝑤 = 𝑦) → (∃𝑥𝑦(⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → 𝜑))
499, 48sylbi 220 . . . . . . 7 (⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ → (∃𝑥𝑦(⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑) → 𝜑))
506, 49impbid 215 . . . . . 6 (⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ → (𝜑 ↔ ∃𝑥𝑦(⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
51 eqeq1 2828 . . . . . . 7 (𝐴 = ⟨𝑧, 𝑤⟩ → (𝐴 = ⟨𝑥, 𝑦⟩ ↔ ⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩))
5251anbi1d 632 . . . . . . . . 9 (𝐴 = ⟨𝑧, 𝑤⟩ → ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
53522exbidv 1926 . . . . . . . 8 (𝐴 = ⟨𝑧, 𝑤⟩ → (∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥𝑦(⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
5453bibi2d 346 . . . . . . 7 (𝐴 = ⟨𝑧, 𝑤⟩ → ((𝜑 ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)) ↔ (𝜑 ↔ ∃𝑥𝑦(⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑))))
5551, 54imbi12d 348 . . . . . 6 (𝐴 = ⟨𝑧, 𝑤⟩ → ((𝐴 = ⟨𝑥, 𝑦⟩ → (𝜑 ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))) ↔ (⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ → (𝜑 ↔ ∃𝑥𝑦(⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))))
5650, 55mpbiri 261 . . . . 5 (𝐴 = ⟨𝑧, 𝑤⟩ → (𝐴 = ⟨𝑥, 𝑦⟩ → (𝜑 ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))))
5756adantr 484 . . . 4 ((𝐴 = ⟨𝑧, 𝑤⟩ ∧ ⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩) → (𝐴 = ⟨𝑥, 𝑦⟩ → (𝜑 ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))))
5857exlimivv 1934 . . 3 (∃𝑧𝑤(𝐴 = ⟨𝑧, 𝑤⟩ ∧ ⟨𝑧, 𝑤⟩ = ⟨𝑥, 𝑦⟩) → (𝐴 = ⟨𝑥, 𝑦⟩ → (𝜑 ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))))
593, 58sylbi 220 . 2 (𝐴 = ⟨𝑥, 𝑦⟩ → (𝐴 = ⟨𝑥, 𝑦⟩ → (𝜑 ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))))
6059pm2.43i 52 1 (𝐴 = ⟨𝑥, 𝑦⟩ → (𝜑 ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 399  ∀wal 1536   = wceq 1538  ∃wex 1781  ∃!weu 2654  ⟨cop 4556 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 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-13 2392  ax-ext 2796  ax-sep 5190  ax-nul 5197  ax-pr 5318 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2624  df-eu 2655  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-v 3482  df-dif 3922  df-un 3924  df-in 3926  df-ss 3936  df-nul 4277  df-if 4451  df-sn 4551  df-pr 4553  df-op 4557 This theorem is referenced by:  opabid  5401
 Copyright terms: Public domain W3C validator