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

Theorem opeqex 4342
Description: Equivalence of existence implied by equality of ordered pairs. (Contributed by NM, 28-May-2008.)
Assertion
Ref Expression
opeqex (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝐶 ∈ V ∧ 𝐷 ∈ V)))

Proof of Theorem opeqex
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 eleq2 2295 . . 3 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → (𝑥 ∈ ⟨𝐴, 𝐵⟩ ↔ 𝑥 ∈ ⟨𝐶, 𝐷⟩))
21exbidv 1873 . 2 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → (∃𝑥 𝑥 ∈ ⟨𝐴, 𝐵⟩ ↔ ∃𝑥 𝑥 ∈ ⟨𝐶, 𝐷⟩))
3 opm 4326 . 2 (∃𝑥 𝑥 ∈ ⟨𝐴, 𝐵⟩ ↔ (𝐴 ∈ V ∧ 𝐵 ∈ V))
4 opm 4326 . 2 (∃𝑥 𝑥 ∈ ⟨𝐶, 𝐷⟩ ↔ (𝐶 ∈ V ∧ 𝐷 ∈ V))
52, 3, 43bitr3g 222 1 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → ((𝐴 ∈ V ∧ 𝐵 ∈ V) ↔ (𝐶 ∈ V ∧ 𝐷 ∈ V)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1397  wex 1540  wcel 2202  Vcvv 2802  cop 3672
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678
This theorem is referenced by:  epelg  4387
  Copyright terms: Public domain W3C validator