HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem opeq2 1877
Description: Equality theorem for ordered pairs.
Assertion
Ref Expression
opeq2 |- (A = B -> <.C, A>. = <.C, B>.)

Proof of Theorem opeq2
StepHypRef Expression
1 preq2 1871 . . 3 |- (A = B -> {C, A} = {C, B})
2 preq2 1871 . . 3 |- ({C, A} = {C, B} -> {{C}, {C, A}} = {{C}, {C, B}})
31, 2syl 12 . 2 |- (A = B -> {{C}, {C, A}} = {{C}, {C, B}})
4 df-op 1815 . 2 |- <.C, A>. = {{C}, {C, A}}
5 df-op 1815 . 2 |- <.C, B>. = {{C}, {C, B}}
63, 4, 53eqtr4g 1147 1 |- (A = B -> <.C, A>. = <.C, B>.)
Colors of variables: wff set class
Syntax hints:   -> wi 2   = wceq 1091  {csn 1808  {cpr 1809  <.cop 1810
This theorem is referenced by:  opeq12 1878  opthg 1899  eqvinop 1901  moop2 1910  breq2 2066  opabid 2099  cbvopab2v 2109  opelxpg 2454  opelcog 2511  dfdmf 2526  opeldm 2534  dfrnf 2561  elrn 2562  iss 2599  intirr 2628  cnvopab 2632  elxp4 2640  elxp5 2641  fnopabg 2745  fcoi2 2766  tz6.12f 2844  funopfvg 2854  funopfv 2886  fsn 2895  fnressn 2897  fressnfv 2898  tfrlem11 2959  opreq2 3007  elrnoprab 3054  fundmen 3333  mapsnen 3334  xpsnen 3339  xpassen 3344  xpmapenlem2 3392  aceq3lem 3555  recmulpq 3864  elreal 4044  addresr 4050  seqval 4665
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-un 1490  df-sn 1811  df-pr 1812  df-op 1815
metamath.org