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

Theorem tpcoma 3492
Description: Swap 1st and 2nd members of an undordered triple. (Contributed by NM, 22-May-2015.)
Assertion
Ref Expression
tpcoma  |-  { A ,  B ,  C }  =  { B ,  A ,  C }

Proof of Theorem tpcoma
StepHypRef Expression
1 prcom 3474 . . 3  |-  { A ,  B }  =  { B ,  A }
21uneq1i 3121 . 2  |-  ( { A ,  B }  u.  { C } )  =  ( { B ,  A }  u.  { C } )
3 df-tp 3411 . 2  |-  { A ,  B ,  C }  =  ( { A ,  B }  u.  { C } )
4 df-tp 3411 . 2  |-  { B ,  A ,  C }  =  ( { B ,  A }  u.  { C } )
52, 3, 43eqtr4i 2086 1  |-  { A ,  B ,  C }  =  { B ,  A ,  C }
Colors of variables: wff set class
Syntax hints:    = wceq 1259    u. cun 2943   {csn 3403   {cpr 3404   {ctp 3405
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038
This theorem depends on definitions:  df-bi 114  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-v 2576  df-un 2950  df-pr 3410  df-tp 3411
This theorem is referenced by:  tpcomb  3493
  Copyright terms: Public domain W3C validator