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

Theorem qtopkgen 21323
 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 21155 . . 3 (𝐽 ∈ ran 𝑘Gen → 𝐽 ∈ Top)
2 qtopcmp.1 . . . 4 𝑋 = 𝐽
32qtoptop 21313 . . 3 ((𝐽 ∈ Top ∧ 𝐹 Fn 𝑋) → (𝐽 qTop 𝐹) ∈ Top)
41, 3sylan 487 . 2 ((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) → (𝐽 qTop 𝐹) ∈ Top)
5 elssuni 4403 . . . . . . . 8 (𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹)) → 𝑥 (𝑘Gen‘(𝐽 qTop 𝐹)))
65adantl 481 . . . . . . 7 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝑥 (𝑘Gen‘(𝐽 qTop 𝐹)))
74adantr 480 . . . . . . . 8 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → (𝐽 qTop 𝐹) ∈ Top)
8 eqid 2610 . . . . . . . . 9 (𝐽 qTop 𝐹) = (𝐽 qTop 𝐹)
98kgenuni 21152 . . . . . . . 8 ((𝐽 qTop 𝐹) ∈ Top → (𝐽 qTop 𝐹) = (𝑘Gen‘(𝐽 qTop 𝐹)))
107, 9syl 17 . . . . . . 7 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → (𝐽 qTop 𝐹) = (𝑘Gen‘(𝐽 qTop 𝐹)))
116, 10sseqtr4d 3605 . . . . . 6 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝑥 (𝐽 qTop 𝐹))
12 simpll 786 . . . . . . . 8 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐽 ∈ ran 𝑘Gen)
1312, 1syl 17 . . . . . . 7 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐽 ∈ Top)
14 simplr 788 . . . . . . . 8 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐹 Fn 𝑋)
15 dffn4 6034 . . . . . . . 8 (𝐹 Fn 𝑋𝐹:𝑋onto→ran 𝐹)
1614, 15sylib 207 . . . . . . 7 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐹:𝑋onto→ran 𝐹)
172qtopuni 21315 . . . . . . 7 ((𝐽 ∈ Top ∧ 𝐹:𝑋onto→ran 𝐹) → ran 𝐹 = (𝐽 qTop 𝐹))
1813, 16, 17syl2anc 691 . . . . . 6 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → ran 𝐹 = (𝐽 qTop 𝐹))
1911, 18sseqtr4d 3605 . . . . 5 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝑥 ⊆ ran 𝐹)
202toptopon 20548 . . . . . . . . 9 (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
2113, 20sylib 207 . . . . . . . 8 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐽 ∈ (TopOn‘𝑋))
22 qtopid 21318 . . . . . . . 8 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 Fn 𝑋) → 𝐹 ∈ (𝐽 Cn (𝐽 qTop 𝐹)))
2321, 14, 22syl2anc 691 . . . . . . 7 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐹 ∈ (𝐽 Cn (𝐽 qTop 𝐹)))
24 kgencn3 21171 . . . . . . . 8 ((𝐽 ∈ ran 𝑘Gen ∧ (𝐽 qTop 𝐹) ∈ Top) → (𝐽 Cn (𝐽 qTop 𝐹)) = (𝐽 Cn (𝑘Gen‘(𝐽 qTop 𝐹))))
2512, 7, 24syl2anc 691 . . . . . . 7 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → (𝐽 Cn (𝐽 qTop 𝐹)) = (𝐽 Cn (𝑘Gen‘(𝐽 qTop 𝐹))))
2623, 25eleqtrd 2690 . . . . . 6 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐹 ∈ (𝐽 Cn (𝑘Gen‘(𝐽 qTop 𝐹))))
27 cnima 20879 . . . . . 6 ((𝐹 ∈ (𝐽 Cn (𝑘Gen‘(𝐽 qTop 𝐹))) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → (𝐹𝑥) ∈ 𝐽)
2826, 27sylancom 698 . . . . 5 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → (𝐹𝑥) ∈ 𝐽)
292elqtop2 21314 . . . . . 6 ((𝐽 ∈ ran 𝑘Gen ∧ 𝐹:𝑋onto→ran 𝐹) → (𝑥 ∈ (𝐽 qTop 𝐹) ↔ (𝑥 ⊆ ran 𝐹 ∧ (𝐹𝑥) ∈ 𝐽)))
3012, 16, 29syl2anc 691 . . . . 5 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → (𝑥 ∈ (𝐽 qTop 𝐹) ↔ (𝑥 ⊆ ran 𝐹 ∧ (𝐹𝑥) ∈ 𝐽)))
3119, 28, 30mpbir2and 959 . . . 4 (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝑥 ∈ (𝐽 qTop 𝐹))
3231ex 449 . . 3 ((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) → (𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹)) → 𝑥 ∈ (𝐽 qTop 𝐹)))
3332ssrdv 3574 . 2 ((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) → (𝑘Gen‘(𝐽 qTop 𝐹)) ⊆ (𝐽 qTop 𝐹))
34 iskgen2 21161 . 2 ((𝐽 qTop 𝐹) ∈ ran 𝑘Gen ↔ ((𝐽 qTop 𝐹) ∈ Top ∧ (𝑘Gen‘(𝐽 qTop 𝐹)) ⊆ (𝐽 qTop 𝐹)))
354, 33, 34sylanbrc 695 1 ((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) → (𝐽 qTop 𝐹) ∈ ran 𝑘Gen)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   = wceq 1475   ∈ wcel 1977   ⊆ wss 3540  ∪ cuni 4372  ◡ccnv 5037  ran crn 5039   “ cima 5041   Fn wfn 5799  –onto→wfo 5802  ‘cfv 5804  (class class class)co 6549   qTop cqtop 15986  Topctop 20517  TopOnctopon 20518   Cn ccn 20838  𝑘Genckgen 21146 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-oadd 7451  df-er 7629  df-map 7746  df-en 7842  df-dom 7843  df-fin 7845  df-fi 8200  df-rest 15906  df-topgen 15927  df-qtop 15990  df-top 20521  df-bases 20522  df-topon 20523  df-cn 20841  df-cmp 21000  df-kgen 21147 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator