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

Theorem kgenidm 23713
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.
StepHypRef Expression
1 kgenf 23707 . . . 4 𝑘Gen:Top⟶Top
2 ffn 6705 . . . 4 (𝑘Gen:Top⟶Top → 𝑘Gen Fn Top)
3 fvelrnb 6941 . . . 4 (𝑘Gen Fn Top → (𝐽 ∈ ran 𝑘Gen ↔ ∃𝑗 ∈ Top (𝑘Gen‘𝑗) = 𝐽))
41, 2, 3mp2b 10 . . 3 (𝐽 ∈ ran 𝑘Gen ↔ ∃𝑗 ∈ Top (𝑘Gen‘𝑗) = 𝐽)
5 toptopon2 23084 . . . . . . . . . . 11 (𝑗 ∈ Top ↔ 𝑗 ∈ (TopOn‘ 𝑗))
6 kgentopon 23704 . . . . . . . . . . 11 (𝑗 ∈ (TopOn‘ 𝑗) → (𝑘Gen‘𝑗) ∈ (TopOn‘ 𝑗))
75, 6sylbi 220 . . . . . . . . . 10 (𝑗 ∈ Top → (𝑘Gen‘𝑗) ∈ (TopOn‘ 𝑗))
8 kgentopon 23704 . . . . . . . . . 10 ((𝑘Gen‘𝑗) ∈ (TopOn‘ 𝑗) → (𝑘Gen‘(𝑘Gen‘𝑗)) ∈ (TopOn‘ 𝑗))
97, 8syl 18 . . . . . . . . 9 (𝑗 ∈ Top → (𝑘Gen‘(𝑘Gen‘𝑗)) ∈ (TopOn‘ 𝑗))
10 toponss 23093 . . . . . . . . 9 (((𝑘Gen‘(𝑘Gen‘𝑗)) ∈ (TopOn‘ 𝑗) ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) → 𝑥 𝑗)
119, 10sylan 591 . . . . . . . 8 ((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) → 𝑥 𝑗)
12 simplr 780 . . . . . . . . . . . 12 (((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) ∧ (𝑘 ∈ 𝒫 𝑗 ∧ (𝑗t 𝑘) ∈ Comp)) → 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗)))
13 kgencmp2 23712 . . . . . . . . . . . . . 14 (𝑗 ∈ Top → ((𝑗t 𝑘) ∈ Comp ↔ ((𝑘Gen‘𝑗) ↾t 𝑘) ∈ Comp))
1413biimpa 481 . . . . . . . . . . . . 13 ((𝑗 ∈ Top ∧ (𝑗t 𝑘) ∈ Comp) → ((𝑘Gen‘𝑗) ↾t 𝑘) ∈ Comp)
1514ad2ant2rl 761 . . . . . . . . . . . 12 (((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) ∧ (𝑘 ∈ 𝒫 𝑗 ∧ (𝑗t 𝑘) ∈ Comp)) → ((𝑘Gen‘𝑗) ↾t 𝑘) ∈ Comp)
16 kgeni 23703 . . . . . . . . . . . 12 ((𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗)) ∧ ((𝑘Gen‘𝑗) ↾t 𝑘) ∈ Comp) → (𝑥𝑘) ∈ ((𝑘Gen‘𝑗) ↾t 𝑘))
1712, 15, 16syl2anc 595 . . . . . . . . . . 11 (((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) ∧ (𝑘 ∈ 𝒫 𝑗 ∧ (𝑗t 𝑘) ∈ Comp)) → (𝑥𝑘) ∈ ((𝑘Gen‘𝑗) ↾t 𝑘))
18 kgencmp 23711 . . . . . . . . . . . 12 ((𝑗 ∈ Top ∧ (𝑗t 𝑘) ∈ Comp) → (𝑗t 𝑘) = ((𝑘Gen‘𝑗) ↾t 𝑘))
1918ad2ant2rl 761 . . . . . . . . . . 11 (((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) ∧ (𝑘 ∈ 𝒫 𝑗 ∧ (𝑗t 𝑘) ∈ Comp)) → (𝑗t 𝑘) = ((𝑘Gen‘𝑗) ↾t 𝑘))
2017, 19eleqtrrd 2866 . . . . . . . . . 10 (((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) ∧ (𝑘 ∈ 𝒫 𝑗 ∧ (𝑗t 𝑘) ∈ Comp)) → (𝑥𝑘) ∈ (𝑗t 𝑘))
2120expr 461 . . . . . . . . 9 (((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) ∧ 𝑘 ∈ 𝒫 𝑗) → ((𝑗t 𝑘) ∈ Comp → (𝑥𝑘) ∈ (𝑗t 𝑘)))
2221ralrimiva 3157 . . . . . . . 8 ((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) → ∀𝑘 ∈ 𝒫 𝑗((𝑗t 𝑘) ∈ Comp → (𝑥𝑘) ∈ (𝑗t 𝑘)))
235birani 508 . . . . . . . . 9 ((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) → 𝑗 ∈ (TopOn‘ 𝑗))
24 elkgen 23702 . . . . . . . . 9 (𝑗 ∈ (TopOn‘ 𝑗) → (𝑥 ∈ (𝑘Gen‘𝑗) ↔ (𝑥 𝑗 ∧ ∀𝑘 ∈ 𝒫 𝑗((𝑗t 𝑘) ∈ Comp → (𝑥𝑘) ∈ (𝑗t 𝑘)))))
2523, 24syl 18 . . . . . . . 8 ((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) → (𝑥 ∈ (𝑘Gen‘𝑗) ↔ (𝑥 𝑗 ∧ ∀𝑘 ∈ 𝒫 𝑗((𝑗t 𝑘) ∈ Comp → (𝑥𝑘) ∈ (𝑗t 𝑘)))))
2611, 22, 25mpbir2and 725 . . . . . . 7 ((𝑗 ∈ Top ∧ 𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗))) → 𝑥 ∈ (𝑘Gen‘𝑗))
2726ex 417 . . . . . 6 (𝑗 ∈ Top → (𝑥 ∈ (𝑘Gen‘(𝑘Gen‘𝑗)) → 𝑥 ∈ (𝑘Gen‘𝑗)))
2827ssrdv 3943 . . . . 5 (𝑗 ∈ Top → (𝑘Gen‘(𝑘Gen‘𝑗)) ⊆ (𝑘Gen‘𝑗))
29 fveq2 6881 . . . . . 6 ((𝑘Gen‘𝑗) = 𝐽 → (𝑘Gen‘(𝑘Gen‘𝑗)) = (𝑘Gen‘𝐽))
30 id 23 . . . . . 6 ((𝑘Gen‘𝑗) = 𝐽 → (𝑘Gen‘𝑗) = 𝐽)
3129, 30sseq12d 3970 . . . . 5 ((𝑘Gen‘𝑗) = 𝐽 → ((𝑘Gen‘(𝑘Gen‘𝑗)) ⊆ (𝑘Gen‘𝑗) ↔ (𝑘Gen‘𝐽) ⊆ 𝐽))
3228, 31syl5ibcom 248 . . . 4 (𝑗 ∈ Top → ((𝑘Gen‘𝑗) = 𝐽 → (𝑘Gen‘𝐽) ⊆ 𝐽))
3332rexlimiv 3159 . . 3 (∃𝑗 ∈ Top (𝑘Gen‘𝑗) = 𝐽 → (𝑘Gen‘𝐽) ⊆ 𝐽)
344, 33sylbi 220 . 2 (𝐽 ∈ ran 𝑘Gen → (𝑘Gen‘𝐽) ⊆ 𝐽)
35 kgentop 23708 . . 3 (𝐽 ∈ ran 𝑘Gen → 𝐽 ∈ Top)
36 kgenss 23709 . . 3 (𝐽 ∈ Top → 𝐽 ⊆ (𝑘Gen‘𝐽))
3735, 36syl 18 . 2 (𝐽 ∈ ran 𝑘Gen → 𝐽 ⊆ (𝑘Gen‘𝐽))
3834, 37eqssd 3954 1 (𝐽 ∈ ran 𝑘Gen → (𝑘Gen‘𝐽) = 𝐽)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 400   = wceq 1570  wcel 2143  wral 3079  wrex 3089  cin 3904  wss 3905  𝒫 cpw 4562   cuni 4872  ran crn 5662   Fn wfn 6531  wf 6532  cfv 6536  (class class class)co 7410  t crest 17477  Topctop 23059  TopOnctopon 23076  Compccmp 23552  𝑘Genckgen 23699
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7859  df-1st 7982  df-2nd 7983  df-en 8940  df-fin 8943  df-fi 9367  df-rest 17479  df-topgen 17500  df-top 23060  df-topon 23077  df-bases 23112  df-cmp 23553  df-kgen 23700
This theorem is used by:  iskgen2  23714  kgencn3  23724  txkgen  23818
  Copyright terms: Public domain W3C validator