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

Theorem qtopkgen 22294
 Description: A quotient of a compactly generated space is compactly generated. (Contributed by Mario Carneiro, 9-Apr-2015.)
Hypothesis
Ref Expression
qtopcmp.1 𝑋 = 𝐽
Assertion
Ref Expression
qtopkgen ((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) → (𝐽 qTop 𝐹) ∈ ran 𝑘Gen)

Proof of Theorem qtopkgen
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 kgentop 22126 . . 3 (𝐽 ∈ ran 𝑘Gen → 𝐽 ∈ Top)
2 qtopcmp.1 . . . 4 𝑋 = 𝐽
32qtoptop 22284 . . 3 ((𝐽 ∈ Top ∧ 𝐹 Fn 𝑋) → (𝐽 qTop 𝐹) ∈ Top)
41, 3sylan 582 . 2 ((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) → (𝐽 qTop 𝐹) ∈ Top)
5 elssuni 4844 . . . . . . . 8 (𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹)) → 𝑥 (𝑘Gen‘(𝐽 qTop 𝐹)))
65adantl 484 . . . . . . 7 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝑥 (𝑘Gen‘(𝐽 qTop 𝐹)))
74adantr 483 . . . . . . . 8 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → (𝐽 qTop 𝐹) ∈ Top)
8 eqid 2820 . . . . . . . . 9 (𝐽 qTop 𝐹) = (𝐽 qTop 𝐹)
98kgenuni 22123 . . . . . . . 8 ((𝐽 qTop 𝐹) ∈ Top → (𝐽 qTop 𝐹) = (𝑘Gen‘(𝐽 qTop 𝐹)))
107, 9syl 17 . . . . . . 7 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → (𝐽 qTop 𝐹) = (𝑘Gen‘(𝐽 qTop 𝐹)))
116, 10sseqtrrd 3987 . . . . . 6 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝑥 (𝐽 qTop 𝐹))
12 simpll 765 . . . . . . . 8 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐽 ∈ ran 𝑘Gen)
1312, 1syl 17 . . . . . . 7 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐽 ∈ Top)
14 simplr 767 . . . . . . . 8 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐹 Fn 𝑋)
15 dffn4 6572 . . . . . . . 8 (𝐹 Fn 𝑋𝐹:𝑋onto→ran 𝐹)
1614, 15sylib 220 . . . . . . 7 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐹:𝑋onto→ran 𝐹)
172qtopuni 22286 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝐹:𝑋onto→ran 𝐹) → ran 𝐹 = (𝐽 qTop 𝐹))
1813, 16, 17syl2anc 586 . . . . . 6 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → ran 𝐹 = (𝐽 qTop 𝐹))
1911, 18sseqtrrd 3987 . . . . 5 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝑥 ⊆ ran 𝐹)
202toptopon 21501 . . . . . . . . 9 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
2113, 20sylib 220 . . . . . . . 8 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐽 ∈ (TopOn‘𝑋))
22 qtopid 22289 . . . . . . . 8 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 Fn 𝑋) → 𝐹 ∈ (𝐽 Cn (𝐽 qTop 𝐹)))
2321, 14, 22syl2anc 586 . . . . . . 7 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐹 ∈ (𝐽 Cn (𝐽 qTop 𝐹)))
24 kgencn3 22142 . . . . . . . 8 ((𝐽 ∈ ran 𝑘Gen ∧ (𝐽 qTop 𝐹) ∈ Top) → (𝐽 Cn (𝐽 qTop 𝐹)) = (𝐽 Cn (𝑘Gen‘(𝐽 qTop 𝐹))))
2512, 7, 24syl2anc 586 . . . . . . 7 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → (𝐽 Cn (𝐽 qTop 𝐹)) = (𝐽 Cn (𝑘Gen‘(𝐽 qTop 𝐹))))
2623, 25eleqtrd 2913 . . . . . 6 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐹 ∈ (𝐽 Cn (𝑘Gen‘(𝐽 qTop 𝐹))))
27 cnima 21849 . . . . . 6 ((𝐹 ∈ (𝐽 Cn (𝑘Gen‘(𝐽 qTop 𝐹))) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → (𝐹𝑥) ∈ 𝐽)
2826, 27sylancom 590 . . . . 5 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → (𝐹𝑥) ∈ 𝐽)
292elqtop2 22285 . . . . . 6 ((𝐽 ∈ ran 𝑘Gen ∧ 𝐹:𝑋onto→ran 𝐹) → (𝑥 ∈ (𝐽 qTop 𝐹) ↔ (𝑥 ⊆ ran 𝐹 ∧ (𝐹𝑥) ∈ 𝐽)))
3012, 16, 29syl2anc 586 . . . . 5 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → (𝑥 ∈ (𝐽 qTop 𝐹) ↔ (𝑥 ⊆ ran 𝐹 ∧ (𝐹𝑥) ∈ 𝐽)))
3119, 28, 30mpbir2and 711 . . . 4 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝑥 ∈ (𝐽 qTop 𝐹))
3231ex 415 . . 3 ((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) → (𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹)) → 𝑥 ∈ (𝐽 qTop 𝐹)))
3332ssrdv 3952 . 2 ((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) → (𝑘Gen‘(𝐽 qTop 𝐹)) ⊆ (𝐽 qTop 𝐹))
34 iskgen2 22132 . 2 ((𝐽 qTop 𝐹) ∈ ran 𝑘Gen ↔ ((𝐽 qTop 𝐹) ∈ Top ∧ (𝑘Gen‘(𝐽 qTop 𝐹)) ⊆ (𝐽 qTop 𝐹)))
354, 33, 34sylanbrc 585 1 ((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) → (𝐽 qTop 𝐹) ∈ ran 𝑘Gen)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1537   ∈ wcel 2114   ⊆ wss 3913  ∪ cuni 4814  ◡ccnv 5530  ran crn 5532   “ cima 5534   Fn wfn 6326  –onto→wfo 6329  ‘cfv 6331  (class class class)co 7133   qTop cqtop 16755  Topctop 21477  TopOnctopon 21494   Cn ccn 21808  𝑘Genckgen 22117 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2792  ax-rep 5166  ax-sep 5179  ax-nul 5186  ax-pow 5242  ax-pr 5306  ax-un 7439 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2891  df-nfc 2959  df-ne 3007  df-ral 3130  df-rex 3131  df-reu 3132  df-rab 3134  df-v 3475  df-sbc 3753  df-csb 3861  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3932  df-nul 4270  df-if 4444  df-pw 4517  df-sn 4544  df-pr 4546  df-tp 4548  df-op 4550  df-uni 4815  df-int 4853  df-iun 4897  df-br 5043  df-opab 5105  df-mpt 5123  df-tr 5149  df-id 5436  df-eprel 5441  df-po 5450  df-so 5451  df-fr 5490  df-we 5492  df-xp 5537  df-rel 5538  df-cnv 5539  df-co 5540  df-dm 5541  df-rn 5542  df-res 5543  df-ima 5544  df-pred 6124  df-ord 6170  df-on 6171  df-lim 6172  df-suc 6173  df-iota 6290  df-fun 6333  df-fn 6334  df-f 6335  df-f1 6336  df-fo 6337  df-f1o 6338  df-fv 6339  df-ov 7136  df-oprab 7137  df-mpo 7138  df-om 7559  df-1st 7667  df-2nd 7668  df-wrecs 7925  df-recs 7986  df-rdg 8024  df-1o 8080  df-oadd 8084  df-er 8267  df-map 8386  df-en 8488  df-dom 8489  df-fin 8491  df-fi 8853  df-rest 16675  df-topgen 16696  df-qtop 16759  df-top 21478  df-topon 21495  df-bases 21530  df-cn 21811  df-cmp 21971  df-kgen 22118 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator