ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  eqvinop GIF version

Theorem eqvinop 4341
Description: A variable introduction law for ordered pairs. Analog 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 4338 . . . . . . 7 (⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩ ↔ (𝑥 = 𝐵𝑦 = 𝐶))
43anbi2i 457 . . . . . 6 ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐵𝑦 = 𝐶)))
5 ancom 266 . . . . . 6 ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐵𝑦 = 𝐶)) ↔ ((𝑥 = 𝐵𝑦 = 𝐶) ∧ 𝐴 = ⟨𝑥, 𝑦⟩))
6 anass 401 . . . . . 6 (((𝑥 = 𝐵𝑦 = 𝐶) ∧ 𝐴 = ⟨𝑥, 𝑦⟩) ↔ (𝑥 = 𝐵 ∧ (𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)))
74, 5, 63bitri 206 . . . . 5 ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ (𝑥 = 𝐵 ∧ (𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)))
87exbii 1654 . . . 4 (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ ∃𝑦(𝑥 = 𝐵 ∧ (𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)))
9 19.42v 1955 . . . 4 (∃𝑦(𝑥 = 𝐵 ∧ (𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)) ↔ (𝑥 = 𝐵 ∧ ∃𝑦(𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)))
10 opeq2 3868 . . . . . . 7 (𝑦 = 𝐶 → ⟨𝑥, 𝑦⟩ = ⟨𝑥, 𝐶⟩)
1110eqeq2d 2243 . . . . . 6 (𝑦 = 𝐶 → (𝐴 = ⟨𝑥, 𝑦⟩ ↔ 𝐴 = ⟨𝑥, 𝐶⟩))
122, 11ceqsexv 2843 . . . . 5 (∃𝑦(𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩) ↔ 𝐴 = ⟨𝑥, 𝐶⟩)
1312anbi2i 457 . . . 4 ((𝑥 = 𝐵 ∧ ∃𝑦(𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)) ↔ (𝑥 = 𝐵𝐴 = ⟨𝑥, 𝐶⟩))
148, 9, 133bitri 206 . . 3 (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ (𝑥 = 𝐵𝐴 = ⟨𝑥, 𝐶⟩))
1514exbii 1654 . 2 (∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ ∃𝑥(𝑥 = 𝐵𝐴 = ⟨𝑥, 𝐶⟩))
16 opeq1 3867 . . . 4 (𝑥 = 𝐵 → ⟨𝑥, 𝐶⟩ = ⟨𝐵, 𝐶⟩)
1716eqeq2d 2243 . . 3 (𝑥 = 𝐵 → (𝐴 = ⟨𝑥, 𝐶⟩ ↔ 𝐴 = ⟨𝐵, 𝐶⟩))
181, 17ceqsexv 2843 . 2 (∃𝑥(𝑥 = 𝐵𝐴 = ⟨𝑥, 𝐶⟩) ↔ 𝐴 = ⟨𝐵, 𝐶⟩)
1915, 18bitr2i 185 1 (𝐴 = ⟨𝐵, 𝐶⟩ ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩))
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105   = wceq 1398  wex 1541  wcel 2202  Vcvv 2803  cop 3676
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682
This theorem is referenced by:  copsexg  4342  ralxpf  4882  rexxpf  4883  oprabid  6060
  Copyright terms: Public domain W3C validator