Theorem sess1 4440

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.

Step	Hyp	Ref	Expression
1		simpl 109	. . . . . 6 |- ( ( R C_ S /\ y e. A ) -> R C_ S )
2	1	ssbrd 4136	. . . . 5 |- ( ( R C_ S /\ y e. A ) -> ( y R x -> y S x ) )
3	2	ss2rabdv 3309	. . . 4 |- ( R C_ S -> { y e. A | y R x } C_ { y e. A | y S x } )
4		ssexg 4233	. . . . 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 )
5	4	ex 115	. . . 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 ) )
6	3, 5	syl 14	. . 3 |- ( R C_ S -> ( { y e. A | y S x } e. _V -> { y e. A | y R x } e. _V ) )
7	6	ralimdv 2601	. 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 4436	. 2 |- ( S Se A <-> A. x e. A { y e. A | y S x } e. _V )
9		df-se 4436	. 2 |- ( R Se A <-> A. x e. A { y e. A | y R x } e. _V )
10	7, 8, 9	3imtr4g 205	1 |- ( R C_ S -> ( S Se A -> R Se A ) )

Syntax hints:   -> wi 4   /\ wa 104   e. wcel 2202   A.wral 2511   {crab 2515   _Vcvv 2803   C_ wss 3201   class class class wbr 4093   Se wse 4432

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-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213  ax-sep 4212

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rab 2520  df-v 2805  df-in 3207  df-ss 3214  df-br 4094  df-se 4436

This theorem is referenced by:  seeq1  4442