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

Theorem opth2 4773
Description: Ordered pair theorem. (Contributed by NM, 21-Sep-2014.)
Hypotheses
Ref Expression
opth2.1 𝐶 ∈ V
opth2.2 𝐷 ∈ V
Assertion
Ref Expression
opth2 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ↔ (𝐴 = 𝐶𝐵 = 𝐷))

Proof of Theorem opth2
StepHypRef Expression
1 opth2.1 . 2 𝐶 ∈ V
2 opth2.2 . 2 𝐷 ∈ V
3 opthg2 4772 . 2 ((𝐶 ∈ V ∧ 𝐷 ∈ V) → (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ↔ (𝐴 = 𝐶𝐵 = 𝐷)))
41, 2, 3mp2an 703 1 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ↔ (𝐴 = 𝐶𝐵 = 𝐷))
Colors of variables: wff setvar class
Syntax hints:  wb 194  wa 382   = wceq 1474  wcel 1938  Vcvv 3077  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:  eqvinop  4779  opelxp  4964  fsn  6191  opiota  6992  canthwe  9227  ltresr  9715  mat1dimelbas  19997  fmucndlem  21806  diblsmopel  35353  cdlemn7  35385  dihordlem7  35396  xihopellsmN  35436  dihopellsm  35437  dihpN  35518
  Copyright terms: Public domain W3C validator