MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  kgen2ss Structured version   Visualization version   GIF version

Theorem kgen2ss 23520
Description: The compact generator preserves the subset (fineness) relationship on topologies. (Contributed by Mario Carneiro, 21-Mar-2015.)
Assertion
Ref Expression
kgen2ss ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → (𝑘Gen‘𝐽) ⊆ (𝑘Gen‘𝐾))

Proof of Theorem kgen2ss
Dummy variables 𝑘 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simp1 1137 . . . . . . . . 9 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → 𝐽 ∈ (TopOn‘𝑋))
2 elpwi 4548 . . . . . . . . 9 (𝑘 ∈ 𝒫 𝑋𝑘𝑋)
3 resttopon 23126 . . . . . . . . 9 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑘𝑋) → (𝐽t 𝑘) ∈ (TopOn‘𝑘))
41, 2, 3syl2an 597 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (𝐽t 𝑘) ∈ (TopOn‘𝑘))
5 simp2 1138 . . . . . . . . . . 11 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → 𝐾 ∈ (TopOn‘𝑋))
6 resttopon 23126 . . . . . . . . . . 11 ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝑘𝑋) → (𝐾t 𝑘) ∈ (TopOn‘𝑘))
75, 2, 6syl2an 597 . . . . . . . . . 10 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (𝐾t 𝑘) ∈ (TopOn‘𝑘))
8 toponuni 22879 . . . . . . . . . 10 ((𝐾t 𝑘) ∈ (TopOn‘𝑘) → 𝑘 = (𝐾t 𝑘))
97, 8syl 17 . . . . . . . . 9 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → 𝑘 = (𝐾t 𝑘))
109fveq2d 6844 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (TopOn‘𝑘) = (TopOn‘ (𝐾t 𝑘)))
114, 10eleqtrd 2838 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (𝐽t 𝑘) ∈ (TopOn‘ (𝐾t 𝑘)))
12 simpl2 1194 . . . . . . . . 9 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → 𝐾 ∈ (TopOn‘𝑋))
13 topontop 22878 . . . . . . . . 9 (𝐾 ∈ (TopOn‘𝑋) → 𝐾 ∈ Top)
1412, 13syl 17 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → 𝐾 ∈ Top)
15 simpl3 1195 . . . . . . . 8 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → 𝐽𝐾)
16 ssrest 23141 . . . . . . . 8 ((𝐾 ∈ Top ∧ 𝐽𝐾) → (𝐽t 𝑘) ⊆ (𝐾t 𝑘))
1714, 15, 16syl2anc 585 . . . . . . 7 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (𝐽t 𝑘) ⊆ (𝐾t 𝑘))
18 eqid 2736 . . . . . . . . . 10 (𝐾t 𝑘) = (𝐾t 𝑘)
1918sscmp 23370 . . . . . . . . 9 (((𝐽t 𝑘) ∈ (TopOn‘ (𝐾t 𝑘)) ∧ (𝐾t 𝑘) ∈ Comp ∧ (𝐽t 𝑘) ⊆ (𝐾t 𝑘)) → (𝐽t 𝑘) ∈ Comp)
20193com23 1127 . . . . . . . 8 (((𝐽t 𝑘) ∈ (TopOn‘ (𝐾t 𝑘)) ∧ (𝐽t 𝑘) ⊆ (𝐾t 𝑘) ∧ (𝐾t 𝑘) ∈ Comp) → (𝐽t 𝑘) ∈ Comp)
21203expia 1122 . . . . . . 7 (((𝐽t 𝑘) ∈ (TopOn‘ (𝐾t 𝑘)) ∧ (𝐽t 𝑘) ⊆ (𝐾t 𝑘)) → ((𝐾t 𝑘) ∈ Comp → (𝐽t 𝑘) ∈ Comp))
2211, 17, 21syl2anc 585 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → ((𝐾t 𝑘) ∈ Comp → (𝐽t 𝑘) ∈ Comp))
2317sseld 3920 . . . . . 6 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → ((𝑥𝑘) ∈ (𝐽t 𝑘) → (𝑥𝑘) ∈ (𝐾t 𝑘)))
2422, 23imim12d 81 . . . . 5 (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (((𝐽t 𝑘) ∈ Comp → (𝑥𝑘) ∈ (𝐽t 𝑘)) → ((𝐾t 𝑘) ∈ Comp → (𝑥𝑘) ∈ (𝐾t 𝑘))))
2524ralimdva 3149 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → (∀𝑘 ∈ 𝒫 𝑋((𝐽t 𝑘) ∈ Comp → (𝑥𝑘) ∈ (𝐽t 𝑘)) → ∀𝑘 ∈ 𝒫 𝑋((𝐾t 𝑘) ∈ Comp → (𝑥𝑘) ∈ (𝐾t 𝑘))))
2625anim2d 613 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → ((𝑥𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐽t 𝑘) ∈ Comp → (𝑥𝑘) ∈ (𝐽t 𝑘))) → (𝑥𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐾t 𝑘) ∈ Comp → (𝑥𝑘) ∈ (𝐾t 𝑘)))))
27 elkgen 23501 . . . 4 (𝐽 ∈ (TopOn‘𝑋) → (𝑥 ∈ (𝑘Gen‘𝐽) ↔ (𝑥𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐽t 𝑘) ∈ Comp → (𝑥𝑘) ∈ (𝐽t 𝑘)))))
28273ad2ant1 1134 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → (𝑥 ∈ (𝑘Gen‘𝐽) ↔ (𝑥𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐽t 𝑘) ∈ Comp → (𝑥𝑘) ∈ (𝐽t 𝑘)))))
29 elkgen 23501 . . . 4 (𝐾 ∈ (TopOn‘𝑋) → (𝑥 ∈ (𝑘Gen‘𝐾) ↔ (𝑥𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐾t 𝑘) ∈ Comp → (𝑥𝑘) ∈ (𝐾t 𝑘)))))
30293ad2ant2 1135 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → (𝑥 ∈ (𝑘Gen‘𝐾) ↔ (𝑥𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐾t 𝑘) ∈ Comp → (𝑥𝑘) ∈ (𝐾t 𝑘)))))
3126, 28, 303imtr4d 294 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → (𝑥 ∈ (𝑘Gen‘𝐽) → 𝑥 ∈ (𝑘Gen‘𝐾)))
3231ssrdv 3927 1 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽𝐾) → (𝑘Gen‘𝐽) ⊆ (𝑘Gen‘𝐾))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3051  cin 3888  wss 3889  𝒫 cpw 4541   cuni 4850  cfv 6498  (class class class)co 7367  t crest 17383  Topctop 22858  TopOnctopon 22875  Compccmp 23351  𝑘Genckgen 23498
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-en 8894  df-fin 8897  df-fi 9324  df-rest 17385  df-topgen 17406  df-top 22859  df-topon 22876  df-bases 22911  df-cmp 23352  df-kgen 23499
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator