Theorem kgenval 23898

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.

Step	Hyp	Ref	Expression
1		df-kgen 23897	. 2 ⊢ 𝑘Gen = (𝑗 ∈ Top ↦ {𝑥 ∈ 𝒫 ∪ 𝑗 ∣ ∀𝑘 ∈ 𝒫 ∪ 𝑗((𝑗 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝑗 ↾t 𝑘))})
2		unieq 4881	. . . . 5 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = ∪ 𝐽)
3		toponuni 23276	. . . . . 6 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
4	3	eqcomd 2769	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → ∪ 𝐽 = 𝑋)
5	2, 4	sylan9eqr 2820	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑗 = 𝐽) → ∪ 𝑗 = 𝑋)
6	5	pweqd 4577	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑗 = 𝐽) → 𝒫 ∪ 𝑗 = 𝒫 𝑋)
7		oveq1 7456	. . . . . . 7 ⊢ (𝑗 = 𝐽 → (𝑗 ↾t 𝑘) = (𝐽 ↾t 𝑘))
8	7	eleq1d 2849	. . . . . 6 ⊢ (𝑗 = 𝐽 → ((𝑗 ↾t 𝑘) ∈ Comp ↔ (𝐽 ↾t 𝑘) ∈ Comp))
9	7	eleq2d 2850	. . . . . 6 ⊢ (𝑗 = 𝐽 → ((𝑥 ∩ 𝑘) ∈ (𝑗 ↾t 𝑘) ↔ (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)))
10	8, 9	imbi12d 347	. . . . 5 ⊢ (𝑗 = 𝐽 → (((𝑗 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝑗 ↾t 𝑘)) ↔ ((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))))
11	10	adantl 487	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑗 = 𝐽) → (((𝑗 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝑗 ↾t 𝑘)) ↔ ((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))))
12	6, 11	raleqbidv 3338	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑗 = 𝐽) → (∀𝑘 ∈ 𝒫 ∪ 𝑗((𝑗 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝑗 ↾t 𝑘)) ↔ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))))
13	6, 12	rabeqbidv 3433	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑗 = 𝐽) → {𝑥 ∈ 𝒫 ∪ 𝑗 ∣ ∀𝑘 ∈ 𝒫 ∪ 𝑗((𝑗 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝑗 ↾t 𝑘))} = {𝑥 ∈ 𝒫 𝑋 ∣ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))})
14		topontop 23275	. 2 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
15		toponmax 23288	. . 3 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽)
16		pwexg 5345	. . 3 ⊢ (𝑋 ∈ 𝐽 → 𝒫 𝑋 ∈ V)
17		rabexg 5304	. . 3 ⊢ (𝒫 𝑋 ∈ V → {𝑥 ∈ 𝒫 𝑋 ∣ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))} ∈ V)
18	15, 16, 17	3syl 19	. 2 ⊢ (𝐽 ∈ (TopOn‘𝑋) → {𝑥 ∈ 𝒫 𝑋 ∣ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))} ∈ V)
19	1, 13, 14, 18	fvmptd2 7031	1 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝑘Gen‘𝐽) = {𝑥 ∈ 𝒫 𝑋 ∣ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416  Vcvv 3454   ∩ cin 4092  𝒫 cpw 4560  ∪ cuni 4870  ‘cfv 6564  (class class class)co 7449   ↾_t crest 17632  Topctop 23255  TopOnctopon 23272  Compccmp 23748  𝑘Genckgen 23896

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7781

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-iota 6518  df-fun 6566  df-fv 6572  df-ov 7452  df-top 23256  df-topon 23273  df-kgen 23897

This theorem is used by:  elkgen  23899  kgentopon  23901