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

Theorem sess1 4138
Description: Subset theorem for the set-like predicate. (Contributed by Mario Carneiro, 24-Jun-2015.)
Assertion
Ref Expression
sess1  |-  ( R 
C_  S  ->  ( S Se  A  ->  R Se  A
) )

Proof of Theorem sess1
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpl 107 . . . . . 6  |-  ( ( R  C_  S  /\  y  e.  A )  ->  R  C_  S )
21ssbrd 3861 . . . . 5  |-  ( ( R  C_  S  /\  y  e.  A )  ->  ( y R x  ->  y S x ) )
32ss2rabdv 3091 . . . 4  |-  ( R 
C_  S  ->  { y  e.  A  |  y R x }  C_  { y  e.  A  | 
y S x }
)
4 ssexg 3953 . . . . 5  |-  ( ( { y  e.  A  |  y R x }  C_  { y  e.  A  |  y S x }  /\  { y  e.  A  | 
y S x }  e.  _V )  ->  { y  e.  A  |  y R x }  e.  _V )
54ex 113 . . . 4  |-  ( { y  e.  A  | 
y R x }  C_ 
{ y  e.  A  |  y S x }  ->  ( {
y  e.  A  | 
y S x }  e.  _V  ->  { y  e.  A  |  y R x }  e.  _V ) )
63, 5syl 14 . . 3  |-  ( R 
C_  S  ->  ( { y  e.  A  |  y S x }  e.  _V  ->  { y  e.  A  | 
y R x }  e.  _V ) )
76ralimdv 2438 . 2  |-  ( R 
C_  S  ->  ( A. x  e.  A  { y  e.  A  |  y S x }  e.  _V  ->  A. x  e.  A  {
y  e.  A  | 
y R x }  e.  _V ) )
8 df-se 4134 . 2  |-  ( S Se  A  <->  A. x  e.  A  { y  e.  A  |  y S x }  e.  _V )
9 df-se 4134 . 2  |-  ( R Se  A  <->  A. x  e.  A  { y  e.  A  |  y R x }  e.  _V )
107, 8, 93imtr4g 203 1  |-  ( R 
C_  S  ->  ( S Se  A  ->  R Se  A
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    e. wcel 1436   A.wral 2355   {crab 2359   _Vcvv 2615    C_ wss 2988   class class class wbr 3820   Se wse 4130
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 663  ax-5 1379  ax-7 1380  ax-gen 1381  ax-ie1 1425  ax-ie2 1426  ax-8 1438  ax-10 1439  ax-11 1440  ax-i12 1441  ax-bndl 1442  ax-4 1443  ax-17 1462  ax-i9 1466  ax-ial 1470  ax-i5r 1471  ax-ext 2067  ax-sep 3932
This theorem depends on definitions:  df-bi 115  df-tru 1290  df-nf 1393  df-sb 1690  df-clab 2072  df-cleq 2078  df-clel 2081  df-nfc 2214  df-ral 2360  df-rab 2364  df-v 2617  df-in 2994  df-ss 3001  df-br 3821  df-se 4134
This theorem is referenced by:  seeq1  4140
  Copyright terms: Public domain W3C validator