Theorem kgenidm 23760

Description: The compact generator is idempotent on compactly generated spaces. (Contributed by Mario Carneiro, 20-Mar-2015.)

Assertion

Ref	Expression
kgenidm	⊢ (𝐽 ∈ ran 𝑘Gen → (𝑘Gen‘𝐽) = 𝐽)

Proof of Theorem kgenidm

Dummy variables 𝑗 𝑘 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		kgenf 23754	. . . 4 ⊢ 𝑘Gen:Top⟶Top
2		ffn 6710	. . . 4 ⊢ (𝑘Gen:Top⟶Top → 𝑘Gen Fn Top)
3		fvelrnb 6946	. . . 4 ⊢ (𝑘Gen Fn Top → (𝐽 ∈ ran 𝑘Gen ↔ ∃𝑗 ∈ Top (𝑘Gen‘𝑗) = 𝐽))
4	1, 2, 3	mp2b 10	. . 3 ⊢ (𝐽 ∈ ran 𝑘Gen ↔ ∃𝑗 ∈ Top (𝑘Gen‘𝑗) = 𝐽)
5		toptopon2 23130	. . . . . . . . . . 11 ⊢ (𝑗 ∈ Top ↔ 𝑗 ∈ (TopOn‘∪ 𝑗))
6		kgentopon 23751	. . . . . . . . . . 11 ⊢ (𝑗 ∈ (TopOn‘∪ 𝑗) → (𝑘Gen‘𝑗) ∈ (TopOn‘∪ 𝑗))
7	5, 6	sylbi 220	. . . . . . . . . 10 ⊢ (𝑗 ∈ Top → (𝑘Gen‘𝑗) ∈ (TopOn‘∪ 𝑗))
8		kgentopon 23751	. . . . . . . . . 10 ⊢ ((𝑘Gen‘𝑗) ∈ (TopOn‘∪ 𝑗) → (𝑘Gen‘(𝑘Gen‘𝑗)) ∈ (TopOn‘∪ 𝑗))
9	7, 8	syl 18	. . . . . . . . 9 ⊢ (𝑗 ∈ Top → (𝑘Gen‘(𝑘Gen‘𝑗)) ∈ (TopOn‘∪ 𝑗))
10		toponss 23139	. . . . . . . . 9 ⊢ (((𝑘Gen‘(𝑘Gen‘𝑗)) ∈ (TopOn‘∪ 𝑗) ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) → 𝑥 ⊆ ∪ 𝑗)
11	9, 10	sylan 592	. . . . . . . 8 ⊢ ((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) → 𝑥 ⊆ ∪ 𝑗)
12		simplr 781	. . . . . . . . . . . 12 ⊢ (((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) ∧ (𝑘 ∈ 𝒫 ∪ 𝑗 ∧ (𝑗 ↾t 𝑘) ∈ Comp)) → 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗)))
13		kgencmp2 23759	. . . . . . . . . . . . . 14 ⊢ (𝑗 ∈ Top → ((𝑗 ↾t 𝑘) ∈ Comp ↔ ((𝑘Gen‘𝑗) ↾t 𝑘) ∈ Comp))
14	13	biimpa 482	. . . . . . . . . . . . 13 ⊢ ((𝑗 ∈ Top ∧ (𝑗 ↾t 𝑘) ∈ Comp) → ((𝑘Gen‘𝑗) ↾t 𝑘) ∈ Comp)
15	14	ad2ant2rl 762	. . . . . . . . . . . 12 ⊢ (((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) ∧ (𝑘 ∈ 𝒫 ∪ 𝑗 ∧ (𝑗 ↾t 𝑘) ∈ Comp)) → ((𝑘Gen‘𝑗) ↾t 𝑘) ∈ Comp)
16		kgeni 23750	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗)) ∧ ((𝑘Gen‘𝑗) ↾t 𝑘) ∈ Comp) → (𝑥 ∩ 𝑘) ∈ ((𝑘Gen‘𝑗) ↾t 𝑘))
17	12, 15, 16	syl2anc 596	. . . . . . . . . . 11 ⊢ (((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) ∧ (𝑘 ∈ 𝒫 ∪ 𝑗 ∧ (𝑗 ↾t 𝑘) ∈ Comp)) → (𝑥 ∩ 𝑘) ∈ ((𝑘Gen‘𝑗) ↾t 𝑘))
18		kgencmp 23758	. . . . . . . . . . . 12 ⊢ ((𝑗 ∈ Top ∧ (𝑗 ↾t 𝑘) ∈ Comp) → (𝑗 ↾t 𝑘) = ((𝑘Gen‘𝑗) ↾t 𝑘))
19	18	ad2ant2rl 762	. . . . . . . . . . 11 ⊢ (((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) ∧ (𝑘 ∈ 𝒫 ∪ 𝑗 ∧ (𝑗 ↾t 𝑘) ∈ Comp)) → (𝑗 ↾t 𝑘) = ((𝑘Gen‘𝑗) ↾t 𝑘))
20	17, 19	eleqtrrd 2868	. . . . . . . . . 10 ⊢ (((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) ∧ (𝑘 ∈ 𝒫 ∪ 𝑗 ∧ (𝑗 ↾t 𝑘) ∈ Comp)) → (𝑥 ∩ 𝑘) ∈ (𝑗 ↾t 𝑘))
21	20	expr 462	. . . . . . . . 9 ⊢ (((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) ∧ 𝑘 ∈ 𝒫 ∪ 𝑗) → ((𝑗 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝑗 ↾t 𝑘)))
22	21	ralrimiva 3159	. . . . . . . 8 ⊢ ((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) → ∀𝑘 ∈ 𝒫 ∪ 𝑗((𝑗 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝑗 ↾t 𝑘)))
23	5	birani 509	. . . . . . . . 9 ⊢ ((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) → 𝑗 ∈ (TopOn‘∪ 𝑗))
24		elkgen 23749	. . . . . . . . 9 ⊢ (𝑗 ∈ (TopOn‘∪ 𝑗) → (𝑥 ∈ (𝑘Gen‘𝑗) ↔ (𝑥 ⊆ ∪ 𝑗 ∧ ∀𝑘 ∈ 𝒫 ∪ 𝑗((𝑗 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝑗 ↾t 𝑘)))))
25	23, 24	syl 18	. . . . . . . 8 ⊢ ((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) → (𝑥 ∈ (𝑘Gen‘𝑗) ↔ (𝑥 ⊆ ∪ 𝑗 ∧ ∀𝑘 ∈ 𝒫 ∪ 𝑗((𝑗 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝑗 ↾t 𝑘)))))
26	11, 22, 25	mpbir2and 726	. . . . . . 7 ⊢ ((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) → 𝑥 ∈ (𝑘Gen‘𝑗))
27	26	ex 418	. . . . . 6 ⊢ (𝑗 ∈ Top → (𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗)) → 𝑥 ∈ (𝑘Gen‘𝑗)))
28	27	ssrdv 3944	. . . . 5 ⊢ (𝑗 ∈ Top → (𝑘Gen‘(𝑘Gen‘𝑗)) ⊆ (𝑘Gen‘𝑗))
29		fveq2 6886	. . . . . 6 ⊢ ((𝑘Gen‘𝑗) = 𝐽 → (𝑘Gen‘(𝑘Gen‘𝑗)) = (𝑘Gen‘𝐽))
30		id 23	. . . . . 6 ⊢ ((𝑘Gen‘𝑗) = 𝐽 → (𝑘Gen‘𝑗) = 𝐽)
31	29, 30	sseq12d 3971	. . . . 5 ⊢ ((𝑘Gen‘𝑗) = 𝐽 → ((𝑘Gen‘(𝑘Gen‘𝑗)) ⊆ (𝑘Gen‘𝑗) ↔ (𝑘Gen‘𝐽) ⊆ 𝐽))
32	28, 31	syl5ibcom 248	. . . 4 ⊢ (𝑗 ∈ Top → ((𝑘Gen‘𝑗) = 𝐽 → (𝑘Gen‘𝐽) ⊆ 𝐽))
33	32	rexlimiv 3161	. . 3 ⊢ (∃𝑗 ∈ Top (𝑘Gen‘𝑗) = 𝐽 → (𝑘Gen‘𝐽) ⊆ 𝐽)
34	4, 33	sylbi 220	. 2 ⊢ (𝐽 ∈ ran 𝑘Gen → (𝑘Gen‘𝐽) ⊆ 𝐽)
35		kgentop 23755	. . 3 ⊢ (𝐽 ∈ ran 𝑘Gen → 𝐽 ∈ Top)
36		kgenss 23756	. . 3 ⊢ (𝐽 ∈ Top → 𝐽 ⊆ (𝑘Gen‘𝐽))
37	35, 36	syl 18	. 2 ⊢ (𝐽 ∈ ran 𝑘Gen → 𝐽 ⊆ (𝑘Gen‘𝐽))
38	34, 37	eqssd 3955	1 ⊢ (𝐽 ∈ ran 𝑘Gen → (𝑘Gen‘𝐽) = 𝐽)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∀wral 3081  ∃wrex 3091   ∩ cin 3905   ⊆ wss 3906  𝒫 cpw 4564  ∪ cuni 4874  ran crn 5664   Fn wfn 6536  ⟶wf 6537  ‘cfv 6541  (class class class)co 7420   ↾_t crest 17500  Topctop 23105  TopOnctopon 23122  Compccmp 23598  𝑘Genckgen 23746

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7743

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6497  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7870  df-1st 7993  df-2nd 7994  df-en 8951  df-fin 8954  df-fi 9379  df-rest 17502  df-topgen 17523  df-top 23106  df-topon 23123  df-bases 23158  df-cmp 23599  df-kgen 23747

This theorem is used by:  iskgen2  23761  kgencn3  23771  txkgen  23865