ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  tpeq1 Unicode version

Theorem tpeq1 3478
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 3469 . . 3  |-  ( A  =  B  ->  { A ,  C }  =  { B ,  C }
)
21uneq1d 3125 . 2  |-  ( A  =  B  ->  ( { A ,  C }  u.  { D } )  =  ( { B ,  C }  u.  { D } ) )
3 df-tp 3406 . 2  |-  { A ,  C ,  D }  =  ( { A ,  C }  u.  { D } )
4 df-tp 3406 . 2  |-  { B ,  C ,  D }  =  ( { B ,  C }  u.  { D } )
52, 3, 43eqtr4g 2138 1  |-  ( A  =  B  ->  { A ,  C ,  D }  =  { B ,  C ,  D } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1284    u. cun 2971   {csn 3398   {cpr 3399   {ctp 3400
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-v 2603  df-un 2977  df-sn 3404  df-pr 3405  df-tp 3406
This theorem is referenced by:  tpeq1d  3481
  Copyright terms: Public domain W3C validator