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

Theorem opthg2 4772
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 4770 . 2 ((𝐶𝑉𝐷𝑊) → (⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩ ↔ (𝐶 = 𝐴𝐷 = 𝐵)))
2 eqcom 2521 . 2 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ↔ ⟨𝐶, 𝐷⟩ = ⟨𝐴, 𝐵⟩)
3 eqcom 2521 . . 3 (𝐴 = 𝐶𝐶 = 𝐴)
4 eqcom 2521 . . 3 (𝐵 = 𝐷𝐷 = 𝐵)
53, 4anbi12i 728 . 2 ((𝐴 = 𝐶𝐵 = 𝐷) ↔ (𝐶 = 𝐴𝐷 = 𝐵))
61, 2, 53bitr4g 301 1 ((𝐶𝑉𝐷𝑊) → (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ↔ (𝐴 = 𝐶𝐵 = 𝐷)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 194  wa 382   = wceq 1474  wcel 1938  cop 4034
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1700  ax-4 1713  ax-5 1793  ax-6 1838  ax-7 1885  ax-9 1947  ax-10 1966  ax-11 1971  ax-12 1983  ax-13 2137  ax-ext 2494  ax-sep 4607  ax-nul 4616  ax-pr 4732
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-3an 1032  df-tru 1477  df-ex 1695  df-nf 1699  df-sb 1831  df-clab 2501  df-cleq 2507  df-clel 2510  df-nfc 2644  df-rab 2809  df-v 3079  df-dif 3447  df-un 3449  df-in 3451  df-ss 3458  df-nul 3778  df-if 3940  df-sn 4029  df-pr 4031  df-op 4035
This theorem is referenced by:  opth2  4773  fliftel  6341  symg2bas  17537  projf1o  38283
  Copyright terms: Public domain W3C validator