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

Theorem opthg2 5417
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 5415 . 2 ((𝐶𝑉𝐷𝑊) → (⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝐶 = 𝐴𝐷 = 𝐵)))
2 eqcom 2738 . 2 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ↔ ⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩)
3 eqcom 2738 . . 3 (𝐴 = 𝐶𝐶 = 𝐴)
4 eqcom 2738 . . 3 (𝐵 = 𝐷𝐷 = 𝐵)
53, 4anbi12i 628 . 2 ((𝐴 = 𝐶𝐵 = 𝐷) ↔ (𝐶 = 𝐴𝐷 = 𝐵))
61, 2, 53bitr4g 314 1 ((𝐶𝑉𝐷𝑊) → (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ↔ (𝐴 = 𝐶𝐵 = 𝐷)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wcel 2111  cop 4579
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 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pr 5368
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-ss 3914  df-nul 4281  df-if 4473  df-sn 4574  df-pr 4576  df-op 4580
This theorem is referenced by:  opth2  5418  brsnop  5460  fliftel  7243  symg2bas  19305  projf1o  45304  gpgedgiov  48175
  Copyright terms: Public domain W3C validator