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

Theorem sstpr 3787
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 3786 . . 3  |-  ( ( ( A  =  (/)  \/  A  =  { B } )  \/  ( A  =  { C }  \/  A  =  { B ,  C }
) )  ->  A  C_ 
{ B ,  C } )
2 prsstp12 3775 . . 3  |-  { B ,  C }  C_  { B ,  C ,  D }
31, 2sstrdi 3195 . 2  |-  ( ( ( A  =  (/)  \/  A  =  { B } )  \/  ( A  =  { C }  \/  A  =  { B ,  C }
) )  ->  A  C_ 
{ B ,  C ,  D } )
4 snsstp3 3774 . . . . 5  |-  { D }  C_  { B ,  C ,  D }
5 sseq1 3206 . . . . 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 3776 . . . . 5  |-  { B ,  D }  C_  { B ,  C ,  D }
8 sseq1 3206 . . . . 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 717 . . 3  |-  ( ( A  =  { D }  \/  A  =  { B ,  D }
)  ->  A  C_  { B ,  C ,  D }
)
11 prsstp23 3777 . . . . 5  |-  { C ,  D }  C_  { B ,  C ,  D }
12 sseq1 3206 . . . . 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 3237 . . . 4  |-  ( A  =  { B ,  C ,  D }  ->  A  C_  { B ,  C ,  D }
)
1513, 14jaoi 717 . . 3  |-  ( ( A  =  { C ,  D }  \/  A  =  { B ,  C ,  D } )  ->  A  C_  { B ,  C ,  D }
)
1610, 15jaoi 717 . 2  |-  ( ( ( A  =  { D }  \/  A  =  { B ,  D } )  \/  ( A  =  { C ,  D }  \/  A  =  { B ,  C ,  D } ) )  ->  A  C_  { B ,  C ,  D }
)
173, 16jaoi 717 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 709    = wceq 1364    C_ wss 3157   (/)c0 3450   {csn 3622   {cpr 3623   {ctp 3624
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178
This theorem depends on definitions:  df-bi 117  df-3or 981  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-v 2765  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-sn 3628  df-pr 3629  df-tp 3630
This theorem is referenced by:  pwtpss  3836
  Copyright terms: Public domain W3C validator