MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tpeq1 Unicode version

Theorem tpeq1 3837
Description: Equality theorem for unordered triples. (Contributed by NM, 13-Sep-2011.)
Assertion
Ref Expression
tpeq1  |-  ( A  =  B  ->  { A ,  C ,  D }  =  { B ,  C ,  D } )

Proof of Theorem tpeq1
StepHypRef Expression
1 preq1 3828 . . 3  |-  ( A  =  B  ->  { A ,  C }  =  { B ,  C }
)
21uneq1d 3445 . 2  |-  ( A  =  B  ->  ( { A ,  C }  u.  { D } )  =  ( { B ,  C }  u.  { D } ) )
3 df-tp 3767 . 2  |-  { A ,  C ,  D }  =  ( { A ,  C }  u.  { D } )
4 df-tp 3767 . 2  |-  { B ,  C ,  D }  =  ( { B ,  C }  u.  { D } )
52, 3, 43eqtr4g 2446 1  |-  ( A  =  B  ->  { A ,  C ,  D }  =  { B ,  C ,  D } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1649    u. cun 3263   {csn 3759   {cpr 3760   {ctp 3761
This theorem is referenced by:  tpeq1d  3840  hashtpg  11620  erngset  30916  erngset-rN  30924  dvh4dimN  31564
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2370
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2376  df-cleq 2382  df-clel 2385  df-nfc 2514  df-v 2903  df-un 3270  df-sn 3765  df-pr 3766  df-tp 3767
  Copyright terms: Public domain W3C validator