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

Theorem opthg2 4003
Description: Ordered pair theorem. (Contributed by NM, 14-Oct-2005.) (Revised by Mario Carneiro, 26-Apr-2015.)
Assertion
Ref Expression
opthg2 ((𝐶𝑉𝐷𝑊) → (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ↔ (𝐴 = 𝐶𝐵 = 𝐷)))

Proof of Theorem opthg2
StepHypRef Expression
1 opthg 4002 . 2 ((𝐶𝑉𝐷𝑊) → (⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝐶 = 𝐴𝐷 = 𝐵)))
2 eqcom 2058 . 2 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ↔ ⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩)
3 eqcom 2058 . . 3 (𝐴 = 𝐶𝐶 = 𝐴)
4 eqcom 2058 . . 3 (𝐵 = 𝐷𝐷 = 𝐵)
53, 4anbi12i 441 . 2 ((𝐴 = 𝐶𝐵 = 𝐷) ↔ (𝐶 = 𝐴𝐷 = 𝐵))
61, 2, 53bitr4g 216 1 ((𝐶𝑉𝐷𝑊) → (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ↔ (𝐴 = 𝐶𝐵 = 𝐷)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 101  wb 102   = wceq 1259  wcel 1409  cop 3405
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-sep 3902  ax-pow 3954  ax-pr 3971
This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-v 2576  df-un 2949  df-in 2951  df-ss 2958  df-pw 3388  df-sn 3408  df-pr 3409  df-op 3411
This theorem is referenced by:  opth2  4004  fliftel  5460  axprecex  7011
  Copyright terms: Public domain W3C validator