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

Theorem eqvinop 4221
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 4218 . . . . . . 7 (⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩ ↔ (𝑥 = 𝐵𝑦 = 𝐶))
43anbi2i 453 . . . . . 6 ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐵𝑦 = 𝐶)))
5 ancom 264 . . . . . 6 ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 = 𝐵𝑦 = 𝐶)) ↔ ((𝑥 = 𝐵𝑦 = 𝐶) ∧ 𝐴 = ⟨𝑥, 𝑦⟩))
6 anass 399 . . . . . 6 (((𝑥 = 𝐵𝑦 = 𝐶) ∧ 𝐴 = ⟨𝑥, 𝑦⟩) ↔ (𝑥 = 𝐵 ∧ (𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)))
74, 5, 63bitri 205 . . . . 5 ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ (𝑥 = 𝐵 ∧ (𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)))
87exbii 1593 . . . 4 (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ ∃𝑦(𝑥 = 𝐵 ∧ (𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)))
9 19.42v 1894 . . . 4 (∃𝑦(𝑥 = 𝐵 ∧ (𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)) ↔ (𝑥 = 𝐵 ∧ ∃𝑦(𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)))
10 opeq2 3759 . . . . . . 7 (𝑦 = 𝐶 → ⟨𝑥, 𝑦⟩ = ⟨𝑥, 𝐶⟩)
1110eqeq2d 2177 . . . . . 6 (𝑦 = 𝐶 → (𝐴 = ⟨𝑥, 𝑦⟩ ↔ 𝐴 = ⟨𝑥, 𝐶⟩))
122, 11ceqsexv 2765 . . . . 5 (∃𝑦(𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩) ↔ 𝐴 = ⟨𝑥, 𝐶⟩)
1312anbi2i 453 . . . 4 ((𝑥 = 𝐵 ∧ ∃𝑦(𝑦 = 𝐶𝐴 = ⟨𝑥, 𝑦⟩)) ↔ (𝑥 = 𝐵𝐴 = ⟨𝑥, 𝐶⟩))
148, 9, 133bitri 205 . . 3 (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ (𝑥 = 𝐵𝐴 = ⟨𝑥, 𝐶⟩))
1514exbii 1593 . 2 (∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩) ↔ ∃𝑥(𝑥 = 𝐵𝐴 = ⟨𝑥, 𝐶⟩))
16 opeq1 3758 . . . 4 (𝑥 = 𝐵 → ⟨𝑥, 𝐶⟩ = ⟨𝐵, 𝐶⟩)
1716eqeq2d 2177 . . 3 (𝑥 = 𝐵 → (𝐴 = ⟨𝑥, 𝐶⟩ ↔ 𝐴 = ⟨𝐵, 𝐶⟩))
181, 17ceqsexv 2765 . 2 (∃𝑥(𝑥 = 𝐵𝐴 = ⟨𝑥, 𝐶⟩) ↔ 𝐴 = ⟨𝐵, 𝐶⟩)
1915, 18bitr2i 184 1 (𝐴 = ⟨𝐵, 𝐶⟩ ↔ ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ = ⟨𝐵, 𝐶⟩))
Colors of variables: wff set class
Syntax hints:  wa 103  wb 104   = wceq 1343  wex 1480  wcel 2136  Vcvv 2726  cop 3579
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-14 2139  ax-ext 2147  ax-sep 4100  ax-pow 4153  ax-pr 4187
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-v 2728  df-un 3120  df-in 3122  df-ss 3129  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585
This theorem is referenced by:  copsexg  4222  ralxpf  4750  rexxpf  4751  oprabid  5874
  Copyright terms: Public domain W3C validator