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

Theorem sstp 3965
Description: The subsets of a triple. (Contributed by Mario Carneiro, 2-Jul-2016.)
Assertion
Ref Expression
sstp  |-  ( A 
C_  { B ,  C ,  D }  <->  ( ( ( A  =  (/)  \/  A  =  { B } )  \/  ( A  =  { C }  \/  A  =  { B ,  C }
) )  \/  (
( A  =  { D }  \/  A  =  { B ,  D } )  \/  ( A  =  { C ,  D }  \/  A  =  { B ,  C ,  D } ) ) ) )

Proof of Theorem sstp
StepHypRef Expression
1 df-tp 3824 . . 3  |-  { B ,  C ,  D }  =  ( { B ,  C }  u.  { D } )
21sseq2i 3375 . 2  |-  ( A 
C_  { B ,  C ,  D }  <->  A 
C_  ( { B ,  C }  u.  { D } ) )
3 0ss 3658 . . 3  |-  (/)  C_  A
43biantrur 494 . 2  |-  ( A 
C_  ( { B ,  C }  u.  { D } )  <->  ( (/)  C_  A  /\  A  C_  ( { B ,  C }  u.  { D } ) ) )
5 ssunsn2 3960 . . 3  |-  ( (
(/)  C_  A  /\  A  C_  ( { B ,  C }  u.  { D } ) )  <->  ( ( (/)  C_  A  /\  A  C_  { B ,  C }
)  \/  ( (
(/)  u.  { D } )  C_  A  /\  A  C_  ( { B ,  C }  u.  { D } ) ) ) )
63biantrur 494 . . . . 5  |-  ( A 
C_  { B ,  C }  <->  ( (/)  C_  A  /\  A  C_  { B ,  C } ) )
7 sspr 3964 . . . . 5  |-  ( A 
C_  { B ,  C }  <->  ( ( A  =  (/)  \/  A  =  { B } )  \/  ( A  =  { C }  \/  A  =  { B ,  C } ) ) )
86, 7bitr3i 244 . . . 4  |-  ( (
(/)  C_  A  /\  A  C_ 
{ B ,  C } )  <->  ( ( A  =  (/)  \/  A  =  { B } )  \/  ( A  =  { C }  \/  A  =  { B ,  C } ) ) )
9 uncom 3493 . . . . . . . 8  |-  ( (/)  u. 
{ D } )  =  ( { D }  u.  (/) )
10 un0 3654 . . . . . . . 8  |-  ( { D }  u.  (/) )  =  { D }
119, 10eqtri 2458 . . . . . . 7  |-  ( (/)  u. 
{ D } )  =  { D }
1211sseq1i 3374 . . . . . 6  |-  ( (
(/)  u.  { D } )  C_  A  <->  { D }  C_  A
)
13 uncom 3493 . . . . . . 7  |-  ( { B ,  C }  u.  { D } )  =  ( { D }  u.  { B ,  C } )
1413sseq2i 3375 . . . . . 6  |-  ( A 
C_  ( { B ,  C }  u.  { D } )  <->  A  C_  ( { D }  u.  { B ,  C }
) )
1512, 14anbi12i 680 . . . . 5  |-  ( ( ( (/)  u.  { D } )  C_  A  /\  A  C_  ( { B ,  C }  u.  { D } ) )  <->  ( { D }  C_  A  /\  A  C_  ( { D }  u.  { B ,  C } ) ) )
16 ssunpr 3963 . . . . 5  |-  ( ( { D }  C_  A  /\  A  C_  ( { D }  u.  { B ,  C }
) )  <->  ( ( A  =  { D }  \/  A  =  ( { D }  u.  { B } ) )  \/  ( A  =  ( { D }  u.  { C } )  \/  A  =  ( { D }  u.  { B ,  C }
) ) ) )
17 uncom 3493 . . . . . . . . 9  |-  ( { D }  u.  { B } )  =  ( { B }  u.  { D } )
18 df-pr 3823 . . . . . . . . 9  |-  { B ,  D }  =  ( { B }  u.  { D } )
1917, 18eqtr4i 2461 . . . . . . . 8  |-  ( { D }  u.  { B } )  =  { B ,  D }
2019eqeq2i 2448 . . . . . . 7  |-  ( A  =  ( { D }  u.  { B } )  <->  A  =  { B ,  D }
)
2120orbi2i 507 . . . . . 6  |-  ( ( A  =  { D }  \/  A  =  ( { D }  u.  { B } ) )  <-> 
( A  =  { D }  \/  A  =  { B ,  D } ) )
22 uncom 3493 . . . . . . . . 9  |-  ( { D }  u.  { C } )  =  ( { C }  u.  { D } )
23 df-pr 3823 . . . . . . . . 9  |-  { C ,  D }  =  ( { C }  u.  { D } )
2422, 23eqtr4i 2461 . . . . . . . 8  |-  ( { D }  u.  { C } )  =  { C ,  D }
2524eqeq2i 2448 . . . . . . 7  |-  ( A  =  ( { D }  u.  { C } )  <->  A  =  { C ,  D }
)
261, 13eqtr2i 2459 . . . . . . . 8  |-  ( { D }  u.  { B ,  C }
)  =  { B ,  C ,  D }
2726eqeq2i 2448 . . . . . . 7  |-  ( A  =  ( { D }  u.  { B ,  C } )  <->  A  =  { B ,  C ,  D } )
2825, 27orbi12i 509 . . . . . 6  |-  ( ( A  =  ( { D }  u.  { C } )  \/  A  =  ( { D }  u.  { B ,  C } ) )  <-> 
( A  =  { C ,  D }  \/  A  =  { B ,  C ,  D } ) )
2921, 28orbi12i 509 . . . . 5  |-  ( ( ( A  =  { D }  \/  A  =  ( { D }  u.  { B } ) )  \/  ( A  =  ( { D }  u.  { C } )  \/  A  =  ( { D }  u.  { B ,  C }
) ) )  <->  ( ( A  =  { D }  \/  A  =  { B ,  D }
)  \/  ( A  =  { C ,  D }  \/  A  =  { B ,  C ,  D } ) ) )
3015, 16, 293bitri 264 . . . 4  |-  ( ( ( (/)  u.  { D } )  C_  A  /\  A  C_  ( { B ,  C }  u.  { D } ) )  <->  ( ( A  =  { D }  \/  A  =  { B ,  D }
)  \/  ( A  =  { C ,  D }  \/  A  =  { B ,  C ,  D } ) ) )
318, 30orbi12i 509 . . 3  |-  ( ( ( (/)  C_  A  /\  A  C_  { B ,  C } )  \/  (
( (/)  u.  { D } )  C_  A  /\  A  C_  ( { B ,  C }  u.  { D } ) ) )  <->  ( (
( A  =  (/)  \/  A  =  { B } )  \/  ( A  =  { C }  \/  A  =  { B ,  C }
) )  \/  (
( A  =  { D }  \/  A  =  { B ,  D } )  \/  ( A  =  { C ,  D }  \/  A  =  { B ,  C ,  D } ) ) ) )
325, 31bitri 242 . 2  |-  ( (
(/)  C_  A  /\  A  C_  ( { B ,  C }  u.  { D } ) )  <->  ( (
( A  =  (/)  \/  A  =  { B } )  \/  ( A  =  { C }  \/  A  =  { B ,  C }
) )  \/  (
( A  =  { D }  \/  A  =  { B ,  D } )  \/  ( A  =  { C ,  D }  \/  A  =  { B ,  C ,  D } ) ) ) )
332, 4, 323bitri 264 1  |-  ( A 
C_  { B ,  C ,  D }  <->  ( ( ( A  =  (/)  \/  A  =  { B } )  \/  ( A  =  { C }  \/  A  =  { B ,  C }
) )  \/  (
( A  =  { D }  \/  A  =  { B ,  D } )  \/  ( A  =  { C ,  D }  \/  A  =  { B ,  C ,  D } ) ) ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 178    \/ wo 359    /\ wa 360    = wceq 1653    u. cun 3320    C_ wss 3322   (/)c0 3630   {csn 3816   {cpr 3817   {ctp 3818
This theorem is referenced by:  pwtp  4014
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2419
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ral 2712  df-v 2960  df-dif 3325  df-un 3327  df-in 3329  df-ss 3336  df-nul 3631  df-sn 3822  df-pr 3823  df-tp 3824
  Copyright terms: Public domain W3C validator