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

Theorem tpass 3787
Description: Split off the first element of an unordered triple. (Contributed by Mario Carneiro, 5-Jan-2016.)
Assertion
Ref Expression
tpass  |-  { A ,  B ,  C }  =  ( { A }  u.  { B ,  C } )

Proof of Theorem tpass
StepHypRef Expression
1 df-tp 3697 . 2  |-  { B ,  C ,  A }  =  ( { B ,  C }  u.  { A } )
2 tprot 3784 . 2  |-  { A ,  B ,  C }  =  { B ,  C ,  A }
3 uncom 3363 . 2  |-  ( { A }  u.  { B ,  C }
)  =  ( { B ,  C }  u.  { A } )
41, 2, 33eqtr4i 2263 1  |-  { A ,  B ,  C }  =  ( { A }  u.  { B ,  C } )
Colors of variables: wff set class
Syntax hints:    = wceq 1398    u. cun 3209   {csn 3689   {cpr 3690   {ctp 3691
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-v 2815  df-un 3215  df-sn 3695  df-pr 3696  df-tp 3697
This theorem is referenced by:  qdassr  3789
  Copyright terms: Public domain W3C validator