Theorem ssrest 15283

Description: If K is a finer topology than J, then the subspace topologies induced by A maintain this relationship. (Contributed by Mario Carneiro, 21-Mar-2015.) (Revised by Mario Carneiro, 1-May-2015.)

Assertion

Ref	Expression
ssrest	|- ( ( K e. V /\ J C_ K ) -> ( J ↾t A ) C_ ( K ↾t A ) )

Proof of Theorem ssrest

Dummy variables x y j are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 110	. . . 4 |- ( ( ( K e. V /\ J C_ K ) /\ x e. ( J ↾t A ) ) -> x e. ( J ↾t A ) )
2		ssrexv 3313	. . . . . 6 |- ( J C_ K -> ( E. y e. J x = ( y i^i A ) -> E. y e. K x = ( y i^i A ) ) )
3	2	ad2antlr 493	. . . . 5 |- ( ( ( K e. V /\ J C_ K ) /\ x e. ( J ↾t A ) ) -> ( E. y e. J x = ( y i^i A ) -> E. y e. K x = ( y i^i A ) ) )
4		df-rest 13595	. . . . . . . 8 |- ↾t = ( j e. _V , x e. _V |-> ran ( y e. j |-> ( y i^i x ) ) )
5	4	elmpocl 6284	. . . . . . 7 |- ( x e. ( J ↾t A ) -> ( J e. _V /\ A e. _V ) )
6	5	adantl 277	. . . . . 6 |- ( ( ( K e. V /\ J C_ K ) /\ x e. ( J ↾t A ) ) -> ( J e. _V /\ A e. _V ) )
7		elrest 13600	. . . . . 6 |- ( ( J e. _V /\ A e. _V ) -> ( x e. ( J ↾t A ) <-> E. y e. J x = ( y i^i A ) ) )
8	6, 7	syl 14	. . . . 5 |- ( ( ( K e. V /\ J C_ K ) /\ x e. ( J ↾t A ) ) -> ( x e. ( J ↾t A ) <-> E. y e. J x = ( y i^i A ) ) )
9		simpll 531	. . . . . 6 |- ( ( ( K e. V /\ J C_ K ) /\ x e. ( J ↾t A ) ) -> K e. V )
10	6	simprd 114	. . . . . 6 |- ( ( ( K e. V /\ J C_ K ) /\ x e. ( J ↾t A ) ) -> A e. _V )
11		elrest 13600	. . . . . 6 |- ( ( K e. V /\ A e. _V ) -> ( x e. ( K ↾t A ) <-> E. y e. K x = ( y i^i A ) ) )
12	9, 10, 11	syl2anc 415	. . . . 5 |- ( ( ( K e. V /\ J C_ K ) /\ x e. ( J ↾t A ) ) -> ( x e. ( K ↾t A ) <-> E. y e. K x = ( y i^i A ) ) )
13	3, 8, 12	3imtr4d 203	. . . 4 |- ( ( ( K e. V /\ J C_ K ) /\ x e. ( J ↾t A ) ) -> ( x e. ( J ↾t A ) -> x e. ( K ↾t A ) ) )
14	1, 13	mpd 13	. . 3 |- ( ( ( K e. V /\ J C_ K ) /\ x e. ( J ↾t A ) ) -> x e. ( K ↾t A ) )
15	14	ex 115	. 2 |- ( ( K e. V /\ J C_ K ) -> ( x e. ( J ↾t A ) -> x e. ( K ↾t A ) ) )
16	15	ssrdv 3254	1 |- ( ( K e. V /\ J C_ K ) -> ( J ↾t A ) C_ ( K ↾t A ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   E.wrex 2529   _Vcvv 2821   i^i cin 3219   C_ wss 3220   |-> cmpt 4192   ran crn 4775  (class class class)co 6085   ↾_t crest 13593

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-rest 13595

This theorem is used by: (None)