Theorem kgenval 23834

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 23833	. 2 ⊢ 𝑘Gen = (𝑗 ∈ Top ↦ {𝑥 ∈ 𝒫 ∪ 𝑗 ∣ ∀𝑘 ∈ 𝒫 ∪ 𝑗((𝑗 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝑗 ↾t 𝑘))})
2		unieq 4878	. . . . 5 ⊢ (𝑗 = 𝐽 → ∪ 𝑗 = ∪ 𝐽)
3		toponuni 23212	. . . . . 6 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
4	3	eqcomd 2767	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → ∪ 𝐽 = 𝑋)
5	2, 4	sylan9eqr 2818	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑗 = 𝐽) → ∪ 𝑗 = 𝑋)
6	5	pweqd 4574	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑗 = 𝐽) → 𝒫 ∪ 𝑗 = 𝒫 𝑋)
7		oveq1 7419	. . . . . . 7 ⊢ (𝑗 = 𝐽 → (𝑗 ↾t 𝑘) = (𝐽 ↾t 𝑘))
8	7	eleq1d 2846	. . . . . 6 ⊢ (𝑗 = 𝐽 → ((𝑗 ↾t 𝑘) ∈ Comp ↔ (𝐽 ↾t 𝑘) ∈ Comp))
9	7	eleq2d 2847	. . . . . 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 3335	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑗 = 𝐽) → (∀𝑘 ∈ 𝒫 ∪ 𝑗((𝑗 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝑗 ↾t 𝑘)) ↔ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))))
13	6, 12	rabeqbidv 3430	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑗 = 𝐽) → {𝑥 ∈ 𝒫 ∪ 𝑗 ∣ ∀𝑘 ∈ 𝒫 ∪ 𝑗((𝑗 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝑗 ↾t 𝑘))} = {𝑥 ∈ 𝒫 𝑋 ∣ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))})
14		topontop 23211	. 2 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
15		toponmax 23224	. . 3 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 ∈ 𝐽)
16		pwexg 5340	. . 3 ⊢ (𝑋 ∈ 𝐽 → 𝒫 𝑋 ∈ V)
17		rabexg 5299	. . 3 ⊢ (𝒫 𝑋 ∈ V → {𝑥 ∈ 𝒫 𝑋 ∣ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))} ∈ V)
18	15, 16, 17	3syl 19	. 2 ⊢ (𝐽 ∈ (TopOn‘𝑋) → {𝑥 ∈ 𝒫 𝑋 ∣ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))} ∈ V)
19	1, 13, 14, 18	fvmptd2 6994	1 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝑘Gen‘𝐽) = {𝑥 ∈ 𝒫 𝑋 ∣ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))})

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  {crab 3413  Vcvv 3451   ∩ cin 3898  𝒫 cpw 4557  ∪ cuni 4867  ‘cfv 6531  (class class class)co 7412   ↾_t crest 17571  Topctop 23191  TopOnctopon 23208  Compccmp 23684  𝑘Genckgen 23832

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740

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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6487  df-fun 6533  df-fv 6539  df-ov 7415  df-top 23192  df-topon 23209  df-kgen 23833

This theorem is used by:  elkgen  23835  kgentopon  23837