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

Theorem resttopon 15397
Description: A subspace topology is a topology on the base set. (Contributed by Mario Carneiro, 13-Aug-2015.)
Assertion
Ref Expression
resttopon  |-  ( ( J  e.  (TopOn `  X )  /\  A  C_  X )  ->  ( J ↾t  A )  e.  (TopOn `  A ) )

Proof of Theorem resttopon
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 topontop 15240 . . . 4  |-  ( J  e.  (TopOn `  X
)  ->  J  e.  Top )
21adantr 276 . . 3  |-  ( ( J  e.  (TopOn `  X )  /\  A  C_  X )  ->  J  e.  Top )
3 id 19 . . . 4  |-  ( A 
C_  X  ->  A  C_  X )
4 toponmax 15251 . . . 4  |-  ( J  e.  (TopOn `  X
)  ->  X  e.  J )
5 ssexg 4274 . . . 4  |-  ( ( A  C_  X  /\  X  e.  J )  ->  A  e.  _V )
63, 4, 5syl2anr 290 . . 3  |-  ( ( J  e.  (TopOn `  X )  /\  A  C_  X )  ->  A  e.  _V )
7 resttop 15396 . . 3  |-  ( ( J  e.  Top  /\  A  e.  _V )  ->  ( J ↾t  A )  e.  Top )
82, 6, 7syl2anc 415 . 2  |-  ( ( J  e.  (TopOn `  X )  /\  A  C_  X )  ->  ( J ↾t  A )  e.  Top )
9 simpr 110 . . . . . 6  |-  ( ( J  e.  (TopOn `  X )  /\  A  C_  X )  ->  A  C_  X )
10 sseqin2 3450 . . . . . 6  |-  ( A 
C_  X  <->  ( X  i^i  A )  =  A )
119, 10sylib 122 . . . . 5  |-  ( ( J  e.  (TopOn `  X )  /\  A  C_  X )  ->  ( X  i^i  A )  =  A )
12 simpl 109 . . . . . 6  |-  ( ( J  e.  (TopOn `  X )  /\  A  C_  X )  ->  J  e.  (TopOn `  X )
)
134adantr 276 . . . . . 6  |-  ( ( J  e.  (TopOn `  X )  /\  A  C_  X )  ->  X  e.  J )
14 elrestr 13660 . . . . . 6  |-  ( ( J  e.  (TopOn `  X )  /\  A  e.  _V  /\  X  e.  J )  ->  ( X  i^i  A )  e.  ( J ↾t  A ) )
1512, 6, 13, 14syl3anc 1278 . . . . 5  |-  ( ( J  e.  (TopOn `  X )  /\  A  C_  X )  ->  ( X  i^i  A )  e.  ( J ↾t  A ) )
1611, 15eqeltrrd 2316 . . . 4  |-  ( ( J  e.  (TopOn `  X )  /\  A  C_  X )  ->  A  e.  ( J ↾t  A ) )
17 elssuni 3963 . . . 4  |-  ( A  e.  ( J ↾t  A )  ->  A  C_  U. ( J ↾t  A ) )
1816, 17syl 14 . . 3  |-  ( ( J  e.  (TopOn `  X )  /\  A  C_  X )  ->  A  C_ 
U. ( J ↾t  A ) )
19 restval 13658 . . . . . 6  |-  ( ( J  e.  (TopOn `  X )  /\  A  e.  _V )  ->  ( J ↾t  A )  =  ran  ( x  e.  J  |->  ( x  i^i  A
) ) )
206, 19syldan 282 . . . . 5  |-  ( ( J  e.  (TopOn `  X )  /\  A  C_  X )  ->  ( J ↾t  A )  =  ran  ( x  e.  J  |->  ( x  i^i  A
) ) )
21 inss2 3452 . . . . . . . . 9  |-  ( x  i^i  A )  C_  A
22 vex 2824 . . . . . . . . . . 11  |-  x  e. 
_V
2322inex1 4269 . . . . . . . . . 10  |-  ( x  i^i  A )  e. 
_V
2423elpw 3694 . . . . . . . . 9  |-  ( ( x  i^i  A )  e.  ~P A  <->  ( x  i^i  A )  C_  A
)
2521, 24mpbir 146 . . . . . . . 8  |-  ( x  i^i  A )  e. 
~P A
2625a1i 9 . . . . . . 7  |-  ( ( ( J  e.  (TopOn `  X )  /\  A  C_  X )  /\  x  e.  J )  ->  (
x  i^i  A )  e.  ~P A )
2726fmpttd 5866 . . . . . 6  |-  ( ( J  e.  (TopOn `  X )  /\  A  C_  X )  ->  (
x  e.  J  |->  ( x  i^i  A ) ) : J --> ~P A
)
2827frnd 5546 . . . . 5  |-  ( ( J  e.  (TopOn `  X )  /\  A  C_  X )  ->  ran  ( x  e.  J  |->  ( x  i^i  A
) )  C_  ~P A )
2920, 28eqsstrd 3284 . . . 4  |-  ( ( J  e.  (TopOn `  X )  /\  A  C_  X )  ->  ( J ↾t  A )  C_  ~P A )
30 sspwuni 4097 . . . 4  |-  ( ( J ↾t  A )  C_  ~P A 
<-> 
U. ( J ↾t  A ) 
C_  A )
3129, 30sylib 122 . . 3  |-  ( ( J  e.  (TopOn `  X )  /\  A  C_  X )  ->  U. ( J ↾t  A )  C_  A
)
3218, 31eqssd 3265 . 2  |-  ( ( J  e.  (TopOn `  X )  /\  A  C_  X )  ->  A  =  U. ( J ↾t  A ) )
33 istopon 15239 . 2  |-  ( ( J ↾t  A )  e.  (TopOn `  A )  <->  ( ( J ↾t  A )  e.  Top  /\  A  =  U. ( J ↾t  A ) ) )
348, 32, 33sylanbrc 421 1  |-  ( ( J  e.  (TopOn `  X )  /\  A  C_  X )  ->  ( J ↾t  A )  e.  (TopOn `  A ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   _Vcvv 2821    i^i cin 3219    C_ wss 3220   ~Pcpw 3688   U.cuni 3935    |-> cmpt 4193   ran crn 4777   ` cfv 5380  (class class class)co 6088   ↾t crest 13652   Topctop 15223  TopOnctopon 15236
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 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686
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 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-rest 13654  df-topgen 13673  df-top 15224  df-topon 15237  df-bases 15269
This theorem is used by:  restuni  15398  stoig  15399  cnrest  15461  cnrest2  15462  cnrest2r  15463  cnptopresti  15464  cnptoprest  15465  cnptoprest2  15466  divcnap  15791  cncfmpt2fcntop  15825  cnplimcim  15893  cnlimcim  15897  cnlimc  15898  limccnpcntop  15901  limccnp2lem  15902  limccnp2cntop  15903  dvfvalap  15907  dvbss  15911  dvfgg  15914  dvcnp2cntop  15925  dvcn  15926  dvaddxxbr  15927  dvmulxxbr  15928  dvmptfsum  15951
  Copyright terms: Public domain W3C validator