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

Theorem opth 5452
Description: The ordered pair theorem. If two ordered pairs are equal, their first elements are equal and their second elements are equal. Exercise 6 of [TakeutiZaring] p. 16. Note that 𝐶 and 𝐷 are not required to be sets due our specific ordered pair definition. (Contributed by NM, 28-May-1995.)
Hypotheses
Ref Expression
opth1.1 𝐴 ∈ V
opth1.2 𝐵 ∈ V
Assertion
Ref Expression
opth (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))

Proof of Theorem opth
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 opth1.1 . . . 4 𝐴 ∈ V
2 opth1.2 . . . 4 𝐵 ∈ V
31, 2opth1 5451 . . 3 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → 𝐴 = 𝐶)
41, 2opi1 5444 . . . . . . 7 {𝐴} ∈ ⟨𝐴, 𝐵⟩
5 id 23 . . . . . . 7 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → ⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩)
64, 5eleqtrid 2870 . . . . . 6 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → {𝐴} ∈ ⟨𝐶, 𝐷⟩)
7 oprcl 4862 . . . . . 6 ({𝐴} ∈ ⟨𝐶, 𝐷⟩ → (𝐶 ∈ V ∧ 𝐷 ∈ V))
86, 7syl 18 . . . . 5 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → (𝐶 ∈ V ∧ 𝐷 ∈ V))
98simprd 501 . . . 4 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → 𝐷 ∈ V)
103opeq1d 4851 . . . . . . . 8 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → ⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐵⟩)
1110, 5eqtr3d 2800 . . . . . . 7 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → ⟨𝐶, 𝐵⟩ = ⟨𝐶, 𝐷⟩)
128simpld 500 . . . . . . . 8 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → 𝐶 ∈ V)
13 dfopg 4843 . . . . . . . 8 ((𝐶 ∈ V ∧ 𝐵 ∈ V) → ⟨𝐶, 𝐵⟩ = {{𝐶}, {𝐶, 𝐵}})
1412, 2, 13sylancl 598 . . . . . . 7 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → ⟨𝐶, 𝐵⟩ = {{𝐶}, {𝐶, 𝐵}})
1511, 14eqtr3d 2800 . . . . . 6 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → ⟨𝐶, 𝐷⟩ = {{𝐶}, {𝐶, 𝐵}})
16 dfopg 4843 . . . . . . 7 ((𝐶 ∈ V ∧ 𝐷 ∈ V) → ⟨𝐶, 𝐷⟩ = {{𝐶}, {𝐶, 𝐷}})
178, 16syl 18 . . . . . 6 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → ⟨𝐶, 𝐷⟩ = {{𝐶}, {𝐶, 𝐷}})
1815, 17eqtr3d 2800 . . . . 5 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → {{𝐶}, {𝐶, 𝐵}} = {{𝐶}, {𝐶, 𝐷}})
19 prex 5403 . . . . . 6 {𝐶, 𝐵} ∈ V
20 prex 5403 . . . . . 6 {𝐶, 𝐷} ∈ V
2119, 20preqr2 4809 . . . . 5 ({{𝐶}, {𝐶, 𝐵}} = {{𝐶}, {𝐶, 𝐷}} → {𝐶, 𝐵} = {𝐶, 𝐷})
2218, 21syl 18 . . . 4 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → {𝐶, 𝐵} = {𝐶, 𝐷})
23 preq2 4697 . . . . . . 7 (𝑥 = 𝐷 → {𝐶, 𝑥} = {𝐶, 𝐷})
2423eqeq2d 2774 . . . . . 6 (𝑥 = 𝐷 → ({𝐶, 𝐵} = {𝐶, 𝑥} ↔ {𝐶, 𝐵} = {𝐶, 𝐷}))
25 eqeq2 2775 . . . . . 6 (𝑥 = 𝐷 → (𝐵 = 𝑥 ↔ 𝐵 = 𝐷))
2624, 25imbi12d 347 . . . . 5 (𝑥 = 𝐷 → (({𝐶, 𝐵} = {𝐶, 𝑥} → 𝐵 = 𝑥) ↔ ({𝐶, 𝐵} = {𝐶, 𝐷} → 𝐵 = 𝐷)))
27 vex 3458 . . . . . 6 𝑥 ∈ V
282, 27preqr2 4809 . . . . 5 ({𝐶, 𝐵} = {𝐶, 𝑥} → 𝐵 = 𝑥)
2926, 28vtoclg 3521 . . . 4 (𝐷 ∈ V → ({𝐶, 𝐵} = {𝐶, 𝐷} → 𝐵 = 𝐷))
309, 22, 29sylc 66 . . 3 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → 𝐵 = 𝐷)
313, 30jca 521 . 2 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ → (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))
32 opeq12 4847 . 2 ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → ⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩)
3331, 32impbii 212 1 (⟨𝐴, 𝐵⟩ = ⟨𝐶, 𝐷⟩ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454  {csn 4588  {cpr 4590  ⟨cop 4840
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841
This theorem is used by:  opthg  5453  otth2  5459  copsexgw  5467  copsexgwOLD  5468  copsexg  5469  copsex2g  5472  copsex4g  5474  opcom  5480  moop2  5481  propssopi  5487  brtp  5504  vopelopabsb  5510  brab2d  5519  ralxpf  5834  cnvopab  6149  cnvcnvsn  6239  opreu2reurex  6323  funopg  6602  funsndifnop  7187  tpres  7238  f1opr  7507  oprabv  7511  xpopth  8076  eqop  8077  opiota  8105  soxp  8178  fnwelem  8180  xpdom2  9129  xpf1o  9196  unxpdomlem2  9286  unxpdomlem3  9287  xpwdomg  9616  djulf1o  10030  djurf1o  10031  fseqenlem1  10142  iundom2g  10663  eqresr  11261  cnref1o  13153  hashfun  14623  fsumcom2  15984  fprodcom2  16195  qredeu  16877  qnumdenbi  16964  crth  16999  prmreclem3  17140  imasaddfnlem  17750  fnpr2ob  17780  dprd2da  20309  dprd2d2  20311  rngqiprngimf1  21647  ucnima  24654  numclwwlk1lem2f1  31015  br8d  33300  xppreima2  33343  aciunf1lem  33354  ofpreima  33357  soinfdom  35841  erdszelem9  36172  goeleq12bg  36322  gonanegoal  36325  gonan0  36365  goaln0  36366  gonarlem  36367  gonar  36368  goalrlem  36369  goalr  36370  fmla0disjsuc  36371  fmlasucdisj  36372  satffunlem  36374  satffunlem1lem1  36375  satffunlem2lem1  36377  msubff1  36529  mvhf1  36532  br8  36736  br6  36737  br4  36738  brsegle  37088  nmulprop  37154  copsex2gd  38330  copsex2b  38332  poimirlem4  38810  poimirlem9  38815  dib1dim  42488  diclspsn  42517  dihopelvalcpre  42571  dihmeetlem4preN  42629  dihmeetlem13N  42642  dih1dimatlem  42652  dihatlat  42657  pellexlem3  44104  pellex  44108  snhesn  45108  opelopab4  45855  ichnreuop  48888  ichreuopeq  48889  gpgedg2ov  49498  gpgedg2iv  49499  pgnioedg1  49540  pgnioedg2  49541  pgnioedg3  49542  pgnioedg4  49543  pgnioedg5  49544  pgnbgreunbgrlem2lem1  49546  pgnbgreunbgrlem2lem2  49547  pgnbgreunbgrlem2lem3  49548  pgnbgreunbgrlem5lem1  49552  pgnbgreunbgrlem5lem2  49553  pgnbgreunbgrlem5lem3  49554  brab2dd  50331  idfudiag1  51052
  Copyright terms: Public domain W3C validator