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

Theorem sstpr 3840
Description: The subsets of a triple. (Contributed by Jim Kingdon, 11-Aug-2018.)
Assertion
Ref Expression
sstpr  |-  ( ( ( ( A  =  (/)  \/  A  =  { B } )  \/  ( A  =  { C }  \/  A  =  { B ,  C }
) )  \/  (
( A  =  { D }  \/  A  =  { B ,  D } )  \/  ( A  =  { C ,  D }  \/  A  =  { B ,  C ,  D } ) ) )  ->  A  C_  { B ,  C ,  D }
)

Proof of Theorem sstpr
StepHypRef Expression
1 ssprr 3839 . . 3  |-  ( ( ( A  =  (/)  \/  A  =  { B } )  \/  ( A  =  { C }  \/  A  =  { B ,  C }
) )  ->  A  C_ 
{ B ,  C } )
2 prsstp12 3826 . . 3  |-  { B ,  C }  C_  { B ,  C ,  D }
31, 2sstrdi 3239 . 2  |-  ( ( ( A  =  (/)  \/  A  =  { B } )  \/  ( A  =  { C }  \/  A  =  { B ,  C }
) )  ->  A  C_ 
{ B ,  C ,  D } )
4 snsstp3 3825 . . . . 5  |-  { D }  C_  { B ,  C ,  D }
5 sseq1 3250 . . . . 5  |-  ( A  =  { D }  ->  ( A  C_  { B ,  C ,  D }  <->  { D }  C_  { B ,  C ,  D }
) )
64, 5mpbiri 168 . . . 4  |-  ( A  =  { D }  ->  A  C_  { B ,  C ,  D }
)
7 prsstp13 3827 . . . . 5  |-  { B ,  D }  C_  { B ,  C ,  D }
8 sseq1 3250 . . . . 5  |-  ( A  =  { B ,  D }  ->  ( A 
C_  { B ,  C ,  D }  <->  { B ,  D }  C_ 
{ B ,  C ,  D } ) )
97, 8mpbiri 168 . . . 4  |-  ( A  =  { B ,  D }  ->  A  C_  { B ,  C ,  D } )
106, 9jaoi 723 . . 3  |-  ( ( A  =  { D }  \/  A  =  { B ,  D }
)  ->  A  C_  { B ,  C ,  D }
)
11 prsstp23 3828 . . . . 5  |-  { C ,  D }  C_  { B ,  C ,  D }
12 sseq1 3250 . . . . 5  |-  ( A  =  { C ,  D }  ->  ( A 
C_  { B ,  C ,  D }  <->  { C ,  D }  C_ 
{ B ,  C ,  D } ) )
1311, 12mpbiri 168 . . . 4  |-  ( A  =  { C ,  D }  ->  A  C_  { B ,  C ,  D } )
14 eqimss 3281 . . . 4  |-  ( A  =  { B ,  C ,  D }  ->  A  C_  { B ,  C ,  D }
)
1513, 14jaoi 723 . . 3  |-  ( ( A  =  { C ,  D }  \/  A  =  { B ,  C ,  D } )  ->  A  C_  { B ,  C ,  D }
)
1610, 15jaoi 723 . 2  |-  ( ( ( A  =  { D }  \/  A  =  { B ,  D } )  \/  ( A  =  { C ,  D }  \/  A  =  { B ,  C ,  D } ) )  ->  A  C_  { B ,  C ,  D }
)
173, 16jaoi 723 1  |-  ( ( ( ( A  =  (/)  \/  A  =  { B } )  \/  ( A  =  { C }  \/  A  =  { B ,  C }
) )  \/  (
( A  =  { D }  \/  A  =  { B ,  D } )  \/  ( A  =  { C ,  D }  \/  A  =  { B ,  C ,  D } ) ) )  ->  A  C_  { B ,  C ,  D }
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    \/ wo 715    = wceq 1397    C_ wss 3200   (/)c0 3494   {csn 3669   {cpr 3670   {ctp 3671
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-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-3or 1005  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-v 2804  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-sn 3675  df-pr 3676  df-tp 3677
This theorem is referenced by:  pwtpss  3890
  Copyright terms: Public domain W3C validator