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

Theorem ssrest 12529
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 3189 . . . . . 6  |-  ( J 
C_  K  ->  ( E. y  e.  J  x  =  ( y  i^i  A )  ->  E. y  e.  K  x  =  ( y  i^i  A
) ) )
32ad2antlr 481 . . . . 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 12300 . . . . . . . 8  |-t  =  ( j  e.  _V ,  x  e. 
_V  |->  ran  ( y  e.  j  |->  ( y  i^i  x ) ) )
54elmpocl 6008 . . . . . . 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 12305 . . . . . 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 519 . . . . . 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 12305 . . . . . 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 3130 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 1332    e. wcel 2125   E.wrex 2433   _Vcvv 2709    i^i cin 3097    C_ wss 3098    |-> cmpt 4021   ran crn 4580  (class class class)co 5814   ↾t crest 12298
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 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1481  ax-10 1482  ax-11 1483  ax-i12 1484  ax-bndl 1486  ax-4 1487  ax-17 1503  ax-i9 1507  ax-ial 1511  ax-i5r 1512  ax-13 2127  ax-14 2128  ax-ext 2136  ax-coll 4075  ax-sep 4078  ax-pow 4130  ax-pr 4164  ax-un 4388  ax-setind 4490
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1740  df-eu 2006  df-mo 2007  df-clab 2141  df-cleq 2147  df-clel 2150  df-nfc 2285  df-ne 2325  df-ral 2437  df-rex 2438  df-reu 2439  df-rab 2441  df-v 2711  df-sbc 2934  df-csb 3028  df-dif 3100  df-un 3102  df-in 3104  df-ss 3111  df-pw 3541  df-sn 3562  df-pr 3563  df-op 3565  df-uni 3769  df-iun 3847  df-br 3962  df-opab 4022  df-mpt 4023  df-id 4248  df-xp 4585  df-rel 4586  df-cnv 4587  df-co 4588  df-dm 4589  df-rn 4590  df-res 4591  df-ima 4592  df-iota 5128  df-fun 5165  df-fn 5166  df-f 5167  df-f1 5168  df-fo 5169  df-f1o 5170  df-fv 5171  df-ov 5817  df-oprab 5818  df-mpo 5819  df-rest 12300
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator