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

Theorem eqvinop 5378
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 5372 . . . . . . 7 (⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩ ↔ (𝑥 = 𝐵𝑦 = 𝐶))
43anbi2i 624 . . . . . 6 ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐵𝑦 = 𝐶)))
5 ancom 463 . . . . . 6 ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐵𝑦 = 𝐶)) ↔ ((𝑥 = 𝐵𝑦 = 𝐶) ∧ 𝐴 = ⟨𝑥, 𝑦⟩))
6 anass 471 . . . . . 6 (((𝑥 = 𝐵𝑦 = 𝐶) ∧ 𝐴 = ⟨𝑥, 𝑦⟩) ↔ (𝑥 = 𝐵 ∧ (𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)))
74, 5, 63bitri 299 . . . . 5 ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ (𝑥 = 𝐵 ∧ (𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)))
87exbii 1848 . . . 4 (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ ∃𝑦(𝑥 = 𝐵 ∧ (𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)))
9 19.42v 1954 . . . 4 (∃𝑦(𝑥 = 𝐵 ∧ (𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)) ↔ (𝑥 = 𝐵 ∧ ∃𝑦(𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)))
10 opeq2 4804 . . . . . . 7 (𝑦 = 𝐶 → ⟨𝑥, 𝑦⟩ = ⟨𝑥, 𝐶⟩)
1110eqeq2d 2832 . . . . . 6 (𝑦 = 𝐶 → (𝐴 = ⟨𝑥, 𝑦⟩ ↔ 𝐴 = ⟨𝑥, 𝐶⟩))
122, 11ceqsexv 3541 . . . . 5 (∃𝑦(𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩) ↔ 𝐴 = ⟨𝑥, 𝐶⟩)
1312anbi2i 624 . . . 4 ((𝑥 = 𝐵 ∧ ∃𝑦(𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)) ↔ (𝑥 = 𝐵𝐴 = ⟨𝑥, 𝐶⟩))
148, 9, 133bitri 299 . . 3 (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ (𝑥 = 𝐵𝐴 = ⟨𝑥, 𝐶⟩))
1514exbii 1848 . 2 (∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ ∃𝑥(𝑥 = 𝐵𝐴 = ⟨𝑥, 𝐶⟩))
16 opeq1 4803 . . . 4 (𝑥 = 𝐵 → ⟨𝑥, 𝐶⟩ = ⟨𝐵, 𝐶⟩)
1716eqeq2d 2832 . . 3 (𝑥 = 𝐵 → (𝐴 = ⟨𝑥, 𝐶⟩ ↔ 𝐴 = ⟨𝐵, 𝐶⟩))
181, 17ceqsexv 3541 . 2 (∃𝑥(𝑥 = 𝐵𝐴 = ⟨𝑥, 𝐶⟩) ↔ 𝐴 = ⟨𝐵, 𝐶⟩)
1915, 18bitr2i 278 1 (𝐴 = ⟨𝐵, 𝐶⟩ ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩))
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 398   = wceq 1537  wex 1780  wcel 2114  Vcvv 3494  cop 4573
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pr 5330
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-rab 3147  df-v 3496  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574
This theorem is referenced by:  copsexgw  5381  copsexg  5382  ralxpf  5717  oprabidw  7187  oprabid  7188
  Copyright terms: Public domain W3C validator