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

Theorem ssrest 12976
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 )  -> 
( Jt  A )  C_  ( Kt  A ) )

Proof of Theorem ssrest
Dummy variables  x  y  j are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 109 . . . 4  |-  ( ( ( K  e.  V  /\  J  C_  K )  /\  x  e.  ( Jt  A ) )  ->  x  e.  ( Jt  A
) )
2 ssrexv 3212 . . . . . 6  |-  ( J 
C_  K  ->  ( E. y  e.  J  x  =  ( y  i^i  A )  ->  E. y  e.  K  x  =  ( y  i^i  A
) ) )
32ad2antlr 486 . . . . 5  |-  ( ( ( K  e.  V  /\  J  C_  K )  /\  x  e.  ( Jt  A ) )  -> 
( E. y  e.  J  x  =  ( y  i^i  A )  ->  E. y  e.  K  x  =  ( y  i^i  A ) ) )
4 df-rest 12581 . . . . . . . 8  |-t  =  ( j  e.  _V ,  x  e. 
_V  |->  ran  ( y  e.  j  |->  ( y  i^i  x ) ) )
54elmpocl 6047 . . . . . . 7  |-  ( x  e.  ( Jt  A )  ->  ( J  e. 
_V  /\  A  e.  _V ) )
65adantl 275 . . . . . 6  |-  ( ( ( K  e.  V  /\  J  C_  K )  /\  x  e.  ( Jt  A ) )  -> 
( J  e.  _V  /\  A  e.  _V )
)
7 elrest 12586 . . . . . 6  |-  ( ( J  e.  _V  /\  A  e.  _V )  ->  ( x  e.  ( Jt  A )  <->  E. y  e.  J  x  =  ( y  i^i  A
) ) )
86, 7syl 14 . . . . 5  |-  ( ( ( K  e.  V  /\  J  C_  K )  /\  x  e.  ( Jt  A ) )  -> 
( x  e.  ( Jt  A )  <->  E. y  e.  J  x  =  ( y  i^i  A
) ) )
9 simpll 524 . . . . . 6  |-  ( ( ( K  e.  V  /\  J  C_  K )  /\  x  e.  ( Jt  A ) )  ->  K  e.  V )
106simprd 113 . . . . . 6  |-  ( ( ( K  e.  V  /\  J  C_  K )  /\  x  e.  ( Jt  A ) )  ->  A  e.  _V )
11 elrest 12586 . . . . . 6  |-  ( ( K  e.  V  /\  A  e.  _V )  ->  ( x  e.  ( Kt  A )  <->  E. y  e.  K  x  =  ( y  i^i  A
) ) )
129, 10, 11syl2anc 409 . . . . 5  |-  ( ( ( K  e.  V  /\  J  C_  K )  /\  x  e.  ( Jt  A ) )  -> 
( x  e.  ( Kt  A )  <->  E. y  e.  K  x  =  ( y  i^i  A
) ) )
133, 8, 123imtr4d 202 . . . 4  |-  ( ( ( K  e.  V  /\  J  C_  K )  /\  x  e.  ( Jt  A ) )  -> 
( x  e.  ( Jt  A )  ->  x  e.  ( Kt  A ) ) )
141, 13mpd 13 . . 3  |-  ( ( ( K  e.  V  /\  J  C_  K )  /\  x  e.  ( Jt  A ) )  ->  x  e.  ( Kt  A
) )
1514ex 114 . 2  |-  ( ( K  e.  V  /\  J  C_  K )  -> 
( x  e.  ( Jt  A )  ->  x  e.  ( Kt  A ) ) )
1615ssrdv 3153 1  |-  ( ( K  e.  V  /\  J  C_  K )  -> 
( Jt  A )  C_  ( Kt  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1348    e. wcel 2141   E.wrex 2449   _Vcvv 2730    i^i cin 3120    C_ wss 3121    |-> cmpt 4050   ran crn 4612  (class class class)co 5853   ↾t crest 12579
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4104  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-ral 2453  df-rex 2454  df-reu 2455  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-id 4278  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-ov 5856  df-oprab 5857  df-mpo 5858  df-rest 12581
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator