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

Theorem resttopon 15409
Description: A subspace topology is a topology on the base set. (Contributed by Mario Carneiro, 13-Aug-2015.)
Assertion
Ref Expression
resttopon ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝐽 ↾t 𝐴) ∈ (TopOn‘𝐴))

Proof of Theorem resttopon
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 topontop 15252 . . . 4 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
21adantr 276 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → 𝐽 ∈ Top)
3 id 19 . . . 4 (𝐴 ⊆ 𝑋 → 𝐴 ⊆ 𝑋)
4 toponmax 15263 . . . 4 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽)
5 ssexg 4274 . . . 4 ((𝐴 ⊆ 𝑋 ∧ 𝑋 ∈ 𝐽) → 𝐴 ∈ V)
63, 4, 5syl2anr 290 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → 𝐴 ∈ V)
7 resttop 15408 . . 3 ((𝐽 ∈ Top ∧ 𝐴 ∈ V) → (𝐽 ↾t 𝐴) ∈ Top)
82, 6, 7syl2anc 415 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝐽 ↾t 𝐴) ∈ Top)
9 simpr 110 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → 𝐴 ⊆ 𝑋)
10 sseqin2 3450 . . . . . 6 (𝐴 ⊆ 𝑋 ↔ (𝑋 ∩ 𝐴) = 𝐴)
119, 10sylib 122 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝑋 ∩ 𝐴) = 𝐴)
12 simpl 109 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → 𝐽 ∈ (TopOn‘𝑋))
134adantr 276 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → 𝑋 ∈ 𝐽)
14 elrestr 13661 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ V ∧ 𝑋 ∈ 𝐽) → (𝑋 ∩ 𝐴) ∈ (𝐽 ↾t 𝐴))
1512, 6, 13, 14syl3anc 1278 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝑋 ∩ 𝐴) ∈ (𝐽 ↾t 𝐴))
1611, 15eqeltrrd 2316 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → 𝐴 ∈ (𝐽 ↾t 𝐴))
17 elssuni 3963 . . . 4 (𝐴 ∈ (𝐽 ↾t 𝐴) → 𝐴 ⊆ ∪ (𝐽 ↾t 𝐴))
1816, 17syl 14 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → 𝐴 ⊆ ∪ (𝐽 ↾t 𝐴))
19 restval 13659 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ∈ V) → (𝐽 ↾t 𝐴) = ran (𝑥 ∈ 𝐽 ↦ (𝑥 ∩ 𝐴)))
206, 19syldan 282 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝐽 ↾t 𝐴) = ran (𝑥 ∈ 𝐽 ↦ (𝑥 ∩ 𝐴)))
21 inss2 3452 . . . . . . . . 9 (𝑥 ∩ 𝐴) ⊆ 𝐴
22 vex 2824 . . . . . . . . . . 11 𝑥 ∈ V
2322inex1 4269 . . . . . . . . . 10 (𝑥 ∩ 𝐴) ∈ V
2423elpw 3694 . . . . . . . . 9 ((𝑥 ∩ 𝐴) ∈ 𝒫 𝐴 ↔ (𝑥 ∩ 𝐴) ⊆ 𝐴)
2521, 24mpbir 146 . . . . . . . 8 (𝑥 ∩ 𝐴) ∈ 𝒫 𝐴
2625a1i 9 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) ∧ 𝑥 ∈ 𝐽) → (𝑥 ∩ 𝐴) ∈ 𝒫 𝐴)
2726fmpttd 5866 . . . . . 6 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝑥 ∈ 𝐽 ↦ (𝑥 ∩ 𝐴)):𝐽⟶𝒫 𝐴)
2827frnd 5546 . . . . 5 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → ran (𝑥 ∈ 𝐽 ↦ (𝑥 ∩ 𝐴)) ⊆ 𝒫 𝐴)
2920, 28eqsstrd 3284 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝐽 ↾t 𝐴) ⊆ 𝒫 𝐴)
30 sspwuni 4097 . . . 4 ((𝐽 ↾t 𝐴) ⊆ 𝒫 𝐴 ↔ ∪ (𝐽 ↾t 𝐴) ⊆ 𝐴)
3129, 30sylib 122 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → ∪ (𝐽 ↾t 𝐴) ⊆ 𝐴)
3218, 31eqssd 3265 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → 𝐴 = ∪ (𝐽 ↾t 𝐴))
33 istopon 15251 . 2 ((𝐽 ↾t 𝐴) ∈ (TopOn‘𝐴) ↔ ((𝐽 ↾t 𝐴) ∈ Top ∧ 𝐴 = ∪ (𝐽 ↾t 𝐴)))
348, 32, 33sylanbrc 421 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐴 ⊆ 𝑋) → (𝐽 ↾t 𝐴) ∈ (TopOn‘𝐴))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  Vcvv 2821   ∩ cin 3219   ⊆ wss 3220  𝒫 cpw 3688  ∪ cuni 3935   ↦ cmpt 4193  ran crn 4777  ‘cfv 5380  (class class class)co 6088   ↾t crest 13653  Topctop 15235  TopOnctopon 15248
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 13655  df-topgen 13674  df-top 15236  df-topon 15249  df-bases 15281
This theorem is used by:  restuni  15410  stoig  15411  cnrest  15473  cnrest2  15474  cnrest2r  15475  cnptopresti  15476  cnptoprest  15477  cnptoprest2  15478  divcnap  15803  cncfmpt2fcntop  15837  cnplimcim  15905  cnlimcim  15909  cnlimc  15910  limccnpcntop  15913  limccnp2lem  15914  limccnp2cntop  15915  dvfvalap  15919  dvbss  15923  dvfgg  15926  dvcnp2cntop  15937  dvcn  15938  dvaddxxbr  15939  dvmulxxbr  15940  dvmptfsum  15963
  Copyright terms: Public domain W3C validator