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

Theorem sstpr 3783
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 3782 . . 3  |-  ( ( ( A  =  (/)  \/  A  =  { B } )  \/  ( A  =  { C }  \/  A  =  { B ,  C }
) )  ->  A  C_ 
{ B ,  C } )
2 prsstp12 3771 . . 3  |-  { B ,  C }  C_  { B ,  C ,  D }
31, 2sstrdi 3191 . 2  |-  ( ( ( A  =  (/)  \/  A  =  { B } )  \/  ( A  =  { C }  \/  A  =  { B ,  C }
) )  ->  A  C_ 
{ B ,  C ,  D } )
4 snsstp3 3770 . . . . 5  |-  { D }  C_  { B ,  C ,  D }
5 sseq1 3202 . . . . 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 3772 . . . . 5  |-  { B ,  D }  C_  { B ,  C ,  D }
8 sseq1 3202 . . . . 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 3773 . . . . 5  |-  { C ,  D }  C_  { B ,  C ,  D }
12 sseq1 3202 . . . . 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 3233 . . . 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 3153   (/)c0 3446   {csn 3618   {cpr 3619   {ctp 3620
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175
This theorem depends on definitions:  df-bi 117  df-3or 981  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-v 2762  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-sn 3624  df-pr 3625  df-tp 3626
This theorem is referenced by:  pwtpss  3832
  Copyright terms: Public domain W3C validator