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

Theorem eqvinop 5477
Description: A variable introduction law for ordered pairs. Analogue of Lemma 15 of [Monk2] p. 109. (Contributed by NM, 28-May-1995.)
Hypotheses
Ref Expression
eqvinop.1 𝐵 ∈ V
eqvinop.2 𝐶 ∈ V
Assertion
Ref Expression
eqvinop (𝐴 = ⟨𝐵, 𝐶⟩ ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦

Proof of Theorem eqvinop
StepHypRef Expression
1 eqvinop.1 . . . . . . . 8 𝐵 ∈ V
2 eqvinop.2 . . . . . . . 8 𝐶 ∈ V
31, 2opth2 5470 . . . . . . 7 (⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩ ↔ (𝑥 = 𝐵𝑦 = 𝐶))
43anbi2i 623 . . . . . 6 ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐵𝑦 = 𝐶)))
5 ancom 461 . . . . . 6 ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐵𝑦 = 𝐶)) ↔ ((𝑥 = 𝐵𝑦 = 𝐶) ∧ 𝐴 = ⟨𝑥, 𝑦⟩))
6 anass 469 . . . . . 6 (((𝑥 = 𝐵𝑦 = 𝐶) ∧ 𝐴 = ⟨𝑥, 𝑦⟩) ↔ (𝑥 = 𝐵 ∧ (𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)))
74, 5, 63bitri 296 . . . . 5 ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ (𝑥 = 𝐵 ∧ (𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)))
87exbii 1850 . . . 4 (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ ∃𝑦(𝑥 = 𝐵 ∧ (𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)))
9 19.42v 1957 . . . 4 (∃𝑦(𝑥 = 𝐵 ∧ (𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)) ↔ (𝑥 = 𝐵 ∧ ∃𝑦(𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)))
10 opeq2 4864 . . . . . . 7 (𝑦 = 𝐶 → ⟨𝑥, 𝑦⟩ = ⟨𝑥, 𝐶⟩)
1110eqeq2d 2742 . . . . . 6 (𝑦 = 𝐶 → (𝐴 = ⟨𝑥, 𝑦⟩ ↔ 𝐴 = ⟨𝑥, 𝐶⟩))
122, 11ceqsexv 3519 . . . . 5 (∃𝑦(𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩) ↔ 𝐴 = ⟨𝑥, 𝐶⟩)
1312anbi2i 623 . . . 4 ((𝑥 = 𝐵 ∧ ∃𝑦(𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)) ↔ (𝑥 = 𝐵𝐴 = ⟨𝑥, 𝐶⟩))
148, 9, 133bitri 296 . . 3 (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ (𝑥 = 𝐵𝐴 = ⟨𝑥, 𝐶⟩))
1514exbii 1850 . 2 (∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ ∃𝑥(𝑥 = 𝐵𝐴 = ⟨𝑥, 𝐶⟩))
16 opeq1 4863 . . . 4 (𝑥 = 𝐵 → ⟨𝑥, 𝐶⟩ = ⟨𝐵, 𝐶⟩)
1716eqeq2d 2742 . . 3 (𝑥 = 𝐵 → (𝐴 = ⟨𝑥, 𝐶⟩ ↔ 𝐴 = ⟨𝐵, 𝐶⟩))
181, 17ceqsexv 3519 . 2 (∃𝑥(𝑥 = 𝐵𝐴 = ⟨𝑥, 𝐶⟩) ↔ 𝐴 = ⟨𝐵, 𝐶⟩)
1915, 18bitr2i 275 1 (𝐴 = ⟨𝐵, 𝐶⟩ ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 396   = wceq 1541  wex 1781  wcel 2106  Vcvv 3470  cop 4625
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-ext 2702  ax-sep 5289  ax-nul 5296  ax-pr 5417
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-sb 2068  df-clab 2709  df-cleq 2723  df-clel 2809  df-rab 3430  df-v 3472  df-dif 3944  df-un 3946  df-in 3948  df-ss 3958  df-nul 4316  df-if 4520  df-sn 4620  df-pr 4622  df-op 4626
This theorem is referenced by:  copsexgw  5480  copsexg  5481  ralxpf  5835  oprabidw  7421  oprabid  7422
  Copyright terms: Public domain W3C validator