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

Theorem kgenval 23860
Description: Value of the compact generator. (The "k" in 𝑘Gen comes from the name "k-space" for these spaces, after the German word kompakt.) (Contributed by Mario Carneiro, 20-Mar-2015.)
Assertion
Ref Expression
kgenval (𝐽 ∈ (TopOn‘𝑋) → (𝑘Gen‘𝐽) = {𝑥 ∈ 𝒫 𝑋 ∣ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))})
Distinct variable groups:   𝑥,𝑘,𝐽   𝑘,𝑋,𝑥

Proof of Theorem kgenval
Dummy variable 𝑗 is distinct from all other variables.
StepHypRef Expression
1 df-kgen 23859 . 2 𝑘Gen = (𝑗 ∈ Top ↦ {𝑥 ∈ 𝒫 ∪ 𝑗 ∣ ∀𝑘 ∈ 𝒫 ∪ 𝑗((𝑗 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝑗 ↾t 𝑘))})
2 unieq 4877 . . . . 5 (𝑗 = 𝐽 → ∪ 𝑗 = ∪ 𝐽)
3 toponuni 23238 . . . . . 6 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
43eqcomd 2766 . . . . 5 (𝐽 ∈ (TopOn‘𝑋) → ∪ 𝐽 = 𝑋)
52, 4sylan9eqr 2817 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑗 = 𝐽) → ∪ 𝑗 = 𝑋)
65pweqd 4573 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑗 = 𝐽) → 𝒫 ∪ 𝑗 = 𝒫 𝑋)
7 oveq1 7428 . . . . . . 7 (𝑗 = 𝐽 → (𝑗 ↾t 𝑘) = (𝐽 ↾t 𝑘))
87eleq1d 2845 . . . . . 6 (𝑗 = 𝐽 → ((𝑗 ↾t 𝑘) ∈ Comp ↔ (𝐽 ↾t 𝑘) ∈ Comp))
97eleq2d 2846 . . . . . 6 (𝑗 = 𝐽 → ((𝑥 ∩ 𝑘) ∈ (𝑗 ↾t 𝑘) ↔ (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)))
108, 9imbi12d 347 . . . . 5 (𝑗 = 𝐽 → (((𝑗 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝑗 ↾t 𝑘)) ↔ ((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))))
1110adantl 487 . . . 4 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑗 = 𝐽) → (((𝑗 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝑗 ↾t 𝑘)) ↔ ((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))))
126, 11raleqbidv 3334 . . 3 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑗 = 𝐽) → (∀𝑘 ∈ 𝒫 ∪ 𝑗((𝑗 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝑗 ↾t 𝑘)) ↔ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))))
136, 12rabeqbidv 3429 . 2 ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑗 = 𝐽) → {𝑥 ∈ 𝒫 ∪ 𝑗 ∣ ∀𝑘 ∈ 𝒫 ∪ 𝑗((𝑗 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝑗 ↾t 𝑘))} = {𝑥 ∈ 𝒫 𝑋 ∣ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))})
14 topontop 23237 . 2 (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
15 toponmax 23250 . . 3 (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽)
16 pwexg 5339 . . 3 (𝑋 ∈ 𝐽 → 𝒫 𝑋 ∈ V)
17 rabexg 5298 . . 3 (𝒫 𝑋 ∈ V → {𝑥 ∈ 𝒫 𝑋 ∣ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))} ∈ V)
1815, 16, 173syl 19 . 2 (𝐽 ∈ (TopOn‘𝑋) → {𝑥 ∈ 𝒫 𝑋 ∣ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))} ∈ V)
191, 13, 14, 18fvmptd2 7003 1 (𝐽 ∈ (TopOn‘𝑋) → (𝑘Gen‘𝐽) = {𝑥 ∈ 𝒫 𝑋 ∣ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  {crab 3412  Vcvv 3450   ∩ cin 4089  𝒫 cpw 4556  ∪ cuni 4866  ‘cfv 6539  (class class class)co 7421   ↾t crest 17597  Topctop 23217  TopOnctopon 23234  Compccmp 23710  𝑘Genckgen 23858
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-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7752
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6494  df-fun 6541  df-fv 6547  df-ov 7424  df-top 23218  df-topon 23235  df-kgen 23859
This theorem is used by:  elkgen  23861  kgentopon  23863
  Copyright terms: Public domain W3C validator