Theorem qtopkgen 24029

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.

Step	Hyp	Ref	Expression
1		kgentop 23861	. . 3 ⊢ (𝐽 ∈ ran 𝑘Gen → 𝐽 ∈ Top)
2		qtopcmp.1	. . . 4 ⊢ 𝑋 = ∪ 𝐽
3	2	qtoptop 24019	. . 3 ⊢ ((𝐽 ∈ Top ∧ 𝐹 Fn 𝑋) → (𝐽 qTop 𝐹) ∈ Top)
4	1, 3	sylan 592	. 2 ⊢ ((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) → (𝐽 qTop 𝐹) ∈ Top)
5		elssuni 4898	. . . . . . . 8 ⊢ (𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹)) → 𝑥 ⊆ ∪ (𝑘Gen‘(𝐽 qTop 𝐹)))
6	5	adantl 487	. . . . . . 7 ⊢ (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝑥 ⊆ ∪ (𝑘Gen‘(𝐽 qTop 𝐹)))
7	4	adantr 486	. . . . . . . 8 ⊢ (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → (𝐽 qTop 𝐹) ∈ Top)
8		eqid 2760	. . . . . . . . 9 ⊢ ∪ (𝐽 qTop 𝐹) = ∪ (𝐽 qTop 𝐹)
9	8	kgenuni 23858	. . . . . . . 8 ⊢ ((𝐽 qTop 𝐹) ∈ Top → ∪ (𝐽 qTop 𝐹) = ∪ (𝑘Gen‘(𝐽 qTop 𝐹)))
10	7, 9	syl 18	. . . . . . 7 ⊢ (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → ∪ (𝐽 qTop 𝐹) = ∪ (𝑘Gen‘(𝐽 qTop 𝐹)))
11	6, 10	sseqtrrd 3945	. . . . . 6 ⊢ (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝑥 ⊆ ∪ (𝐽 qTop 𝐹))
12		simpll 779	. . . . . . . 8 ⊢ (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐽 ∈ ran 𝑘Gen)
13	12, 1	syl 18	. . . . . . 7 ⊢ (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐽 ∈ Top)
14		simplr 781	. . . . . . . 8 ⊢ (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐹 Fn 𝑋)
15		dffn4 6802	. . . . . . . 8 ⊢ (𝐹 Fn 𝑋 ↔ 𝐹:𝑋–onto→ran 𝐹)
16	14, 15	sylib 221	. . . . . . 7 ⊢ (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐹:𝑋–onto→ran 𝐹)
17	2	qtopuni 24021	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝐹:𝑋–onto→ran 𝐹) → ran 𝐹 = ∪ (𝐽 qTop 𝐹))
18	13, 16, 17	syl2anc 596	. . . . . 6 ⊢ (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → ran 𝐹 = ∪ (𝐽 qTop 𝐹))
19	11, 18	sseqtrrd 3945	. . . . 5 ⊢ (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝑥 ⊆ ran 𝐹)
20	2	toptopon 23235	. . . . . . . . 9 ⊢ (𝐽 ∈ Top ↔ 𝐽 ∈ (TopOn‘𝑋))
21	13, 20	sylib 221	. . . . . . . 8 ⊢ (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐽 ∈ (TopOn‘𝑋))
22		qtopid 24024	. . . . . . . 8 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐹 Fn 𝑋) → 𝐹 ∈ (𝐽 Cn (𝐽 qTop 𝐹)))
23	21, 14, 22	syl2anc 596	. . . . . . 7 ⊢ (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐹 ∈ (𝐽 Cn (𝐽 qTop 𝐹)))
24		kgencn3 23877	. . . . . . . 8 ⊢ ((𝐽 ∈ ran 𝑘Gen ∧ (𝐽 qTop 𝐹) ∈ Top) → (𝐽 Cn (𝐽 qTop 𝐹)) = (𝐽 Cn (𝑘Gen‘(𝐽 qTop 𝐹))))
25	12, 7, 24	syl2anc 596	. . . . . . 7 ⊢ (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → (𝐽 Cn (𝐽 qTop 𝐹)) = (𝐽 Cn (𝑘Gen‘(𝐽 qTop 𝐹))))
26	23, 25	eleqtrd 2862	. . . . . 6 ⊢ (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝐹 ∈ (𝐽 Cn (𝑘Gen‘(𝐽 qTop 𝐹))))
27		cnima 23583	. . . . . 6 ⊢ ((𝐹 ∈ (𝐽 Cn (𝑘Gen‘(𝐽 qTop 𝐹))) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → (◡𝐹 “ 𝑥) ∈ 𝐽)
28	26, 27	sylancom 600	. . . . 5 ⊢ (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → (◡𝐹 “ 𝑥) ∈ 𝐽)
29	2	elqtop2 24020	. . . . . 6 ⊢ ((𝐽 ∈ ran 𝑘Gen ∧ 𝐹:𝑋–onto→ran 𝐹) → (𝑥 ∈ (𝐽 qTop 𝐹) ↔ (𝑥 ⊆ ran 𝐹 ∧ (◡𝐹 “ 𝑥) ∈ 𝐽)))
30	12, 16, 29	syl2anc 596	. . . . 5 ⊢ (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → (𝑥 ∈ (𝐽 qTop 𝐹) ↔ (𝑥 ⊆ ran 𝐹 ∧ (◡𝐹 “ 𝑥) ∈ 𝐽)))
31	19, 28, 30	mpbir2and 726	. . . 4 ⊢ (((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) ∧ 𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹))) → 𝑥 ∈ (𝐽 qTop 𝐹))
32	31	ex 418	. . 3 ⊢ ((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) → (𝑥 ∈ (𝑘Gen‘(𝐽 qTop 𝐹)) → 𝑥 ∈ (𝐽 qTop 𝐹)))
33	32	ssrdv 3914	. 2 ⊢ ((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) → (𝑘Gen‘(𝐽 qTop 𝐹)) ⊆ (𝐽 qTop 𝐹))
34		iskgen2 23867	. 2 ⊢ ((𝐽 qTop 𝐹) ∈ ran 𝑘Gen ↔ ((𝐽 qTop 𝐹) ∈ Top ∧ (𝑘Gen‘(𝐽 qTop 𝐹)) ⊆ (𝐽 qTop 𝐹)))
35	4, 33, 34	sylanbrc 595	1 ⊢ ((𝐽 ∈ ran 𝑘Gen ∧ 𝐹 Fn 𝑋) → (𝐽 qTop 𝐹) ∈ ran 𝑘Gen)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ⊆ wss 3895  ∪ cuni 4866  ^◡ccnv 5649  ran crn 5651   “ cima 5653   Fn wfn 6533  –onto→wfo 6536  ‘cfv 6538  (class class class)co 7420   qTop cqtop 17675  Topctop 23211  TopOnctopon 23228   Cn ccn 23542  𝑘Genckgen 23852

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-1o 8476  df-map 8849  df-en 8974  df-dom 8975  df-fin 8977  df-fi 9403  df-rest 17593  df-topgen 17614  df-qtop 17679  df-top 23212  df-topon 23229  df-bases 23264  df-cn 23545  df-cmp 23705  df-kgen 23853

This theorem is used by: (None)