Theorem llycmpkgen2 22901

Description: A locally compact space is compactly generated. (This variant of llycmpkgen 22903 uses the weaker definition of locally compact, "every point has a compact neighborhood", instead of "every point has a local base of compact neighborhoods".) (Contributed by Mario Carneiro, 21-Mar-2015.)

Hypotheses

Ref	Expression
iskgen3.1	⊢ 𝑋 = ∪ 𝐽
llycmpkgen2.2	⊢ (𝜑 → 𝐽 ∈ Top)
llycmpkgen2.3	⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∃𝑘 ∈ ((nei‘𝐽)‘{𝑥})(𝐽 ↾t 𝑘) ∈ Comp)

Assertion

Ref	Expression
llycmpkgen2	⊢ (𝜑 → 𝐽 ∈ ran 𝑘Gen)

Distinct variable groups:   𝑥,𝑘,𝐽   𝜑,𝑘,𝑥   𝑘,𝑋

Allowed substitution hint:   𝑋(𝑥)

Proof of Theorem llycmpkgen2

Dummy variables 𝑢 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		llycmpkgen2.2	. 2 ⊢ (𝜑 → 𝐽 ∈ Top)
2		elssuni 4898	. . . . . . . . . . 11 ⊢ (𝑢 ∈ (𝑘Gen‘𝐽) → 𝑢 ⊆ ∪ (𝑘Gen‘𝐽))
3	2	adantl 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) → 𝑢 ⊆ ∪ (𝑘Gen‘𝐽))
4		iskgen3.1	. . . . . . . . . . . . 13 ⊢ 𝑋 = ∪ 𝐽
5	4	kgenuni 22890	. . . . . . . . . . . 12 ⊢ (𝐽 ∈ Top → 𝑋 = ∪ (𝑘Gen‘𝐽))
6	1, 5	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 = ∪ (𝑘Gen‘𝐽))
7	6	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) → 𝑋 = ∪ (𝑘Gen‘𝐽))
8	3, 7	sseqtrrd 3985	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) → 𝑢 ⊆ 𝑋)
9	8	sselda 3944	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) → 𝑥 ∈ 𝑋)
10		llycmpkgen2.3	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → ∃𝑘 ∈ ((nei‘𝐽)‘{𝑥})(𝐽 ↾t 𝑘) ∈ Comp)
11	10	adantlr 713	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑋) → ∃𝑘 ∈ ((nei‘𝐽)‘{𝑥})(𝐽 ↾t 𝑘) ∈ Comp)
12	9, 11	syldan 591	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) → ∃𝑘 ∈ ((nei‘𝐽)‘{𝑥})(𝐽 ↾t 𝑘) ∈ Comp)
13	1	ad3antrrr 728	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → 𝐽 ∈ Top)
14		difss 4091	. . . . . . . . . 10 ⊢ (𝑋 ∖ (𝑘 ∖ 𝑢)) ⊆ 𝑋
15	4	ntropn 22400	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ (𝑋 ∖ (𝑘 ∖ 𝑢)) ⊆ 𝑋) → ((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∈ 𝐽)
16	13, 14, 15	sylancl 586	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → ((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∈ 𝐽)
17		simprl 769	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → 𝑘 ∈ ((nei‘𝐽)‘{𝑥}))
18	4	neii1 22457	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ Top ∧ 𝑘 ∈ ((nei‘𝐽)‘{𝑥})) → 𝑘 ⊆ 𝑋)
19	13, 17, 18	syl2anc 584	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → 𝑘 ⊆ 𝑋)
20	4	ntropn 22400	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Top ∧ 𝑘 ⊆ 𝑋) → ((int‘𝐽)‘𝑘) ∈ 𝐽)
21	13, 19, 20	syl2anc 584	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → ((int‘𝐽)‘𝑘) ∈ 𝐽)
22		inopn 22248	. . . . . . . . 9 ⊢ ((𝐽 ∈ Top ∧ ((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∈ 𝐽 ∧ ((int‘𝐽)‘𝑘) ∈ 𝐽) → (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ ((int‘𝐽)‘𝑘)) ∈ 𝐽)
23	13, 16, 21, 22	syl3anc 1371	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ ((int‘𝐽)‘𝑘)) ∈ 𝐽)
24		simplr 767	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → 𝑥 ∈ 𝑢)
25	4	ntrss2 22408	. . . . . . . . . . . . . . 15 ⊢ ((𝐽 ∈ Top ∧ 𝑘 ⊆ 𝑋) → ((int‘𝐽)‘𝑘) ⊆ 𝑘)
26	13, 19, 25	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → ((int‘𝐽)‘𝑘) ⊆ 𝑘)
27	9	adantr 481	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → 𝑥 ∈ 𝑋)
28	27	snssd 4769	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → {𝑥} ⊆ 𝑋)
29	4	neiint 22455	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐽 ∈ Top ∧ {𝑥} ⊆ 𝑋 ∧ 𝑘 ⊆ 𝑋) → (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ↔ {𝑥} ⊆ ((int‘𝐽)‘𝑘)))
30	13, 28, 19, 29	syl3anc 1371	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ↔ {𝑥} ⊆ ((int‘𝐽)‘𝑘)))
31	17, 30	mpbid 231	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → {𝑥} ⊆ ((int‘𝐽)‘𝑘))
32		vex 3449	. . . . . . . . . . . . . . . 16 ⊢ 𝑥 ∈ V
33	32	snss 4746	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ ((int‘𝐽)‘𝑘) ↔ {𝑥} ⊆ ((int‘𝐽)‘𝑘))
34	31, 33	sylibr 233	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → 𝑥 ∈ ((int‘𝐽)‘𝑘))
35	26, 34	sseldd 3945	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → 𝑥 ∈ 𝑘)
36	24, 35	elind 4154	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → 𝑥 ∈ (𝑢 ∩ 𝑘))
37		simpllr 774	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → 𝑢 ∈ (𝑘Gen‘𝐽))
38		simprr 771	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → (𝐽 ↾t 𝑘) ∈ Comp)
39		kgeni 22888	. . . . . . . . . . . . . . 15 ⊢ ((𝑢 ∈ (𝑘Gen‘𝐽) ∧ (𝐽 ↾t 𝑘) ∈ Comp) → (𝑢 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))
40	37, 38, 39	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → (𝑢 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))
41		vex 3449	. . . . . . . . . . . . . . . 16 ⊢ 𝑘 ∈ V
42		resttop 22511	. . . . . . . . . . . . . . . 16 ⊢ ((𝐽 ∈ Top ∧ 𝑘 ∈ V) → (𝐽 ↾t 𝑘) ∈ Top)
43	13, 41, 42	sylancl 586	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → (𝐽 ↾t 𝑘) ∈ Top)
44		inss2 4189	. . . . . . . . . . . . . . . 16 ⊢ (𝑢 ∩ 𝑘) ⊆ 𝑘
45	4	restuni 22513	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐽 ∈ Top ∧ 𝑘 ⊆ 𝑋) → 𝑘 = ∪ (𝐽 ↾t 𝑘))
46	13, 19, 45	syl2anc 584	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → 𝑘 = ∪ (𝐽 ↾t 𝑘))
47	44, 46	sseqtrid 3996	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → (𝑢 ∩ 𝑘) ⊆ ∪ (𝐽 ↾t 𝑘))
48		eqid 2736	. . . . . . . . . . . . . . . 16 ⊢ ∪ (𝐽 ↾t 𝑘) = ∪ (𝐽 ↾t 𝑘)
49	48	isopn3 22417	. . . . . . . . . . . . . . 15 ⊢ (((𝐽 ↾t 𝑘) ∈ Top ∧ (𝑢 ∩ 𝑘) ⊆ ∪ (𝐽 ↾t 𝑘)) → ((𝑢 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘) ↔ ((int‘(𝐽 ↾t 𝑘))‘(𝑢 ∩ 𝑘)) = (𝑢 ∩ 𝑘)))
50	43, 47, 49	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → ((𝑢 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘) ↔ ((int‘(𝐽 ↾t 𝑘))‘(𝑢 ∩ 𝑘)) = (𝑢 ∩ 𝑘)))
51	40, 50	mpbid 231	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → ((int‘(𝐽 ↾t 𝑘))‘(𝑢 ∩ 𝑘)) = (𝑢 ∩ 𝑘))
52	44	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → (𝑢 ∩ 𝑘) ⊆ 𝑘)
53		eqid 2736	. . . . . . . . . . . . . . 15 ⊢ (𝐽 ↾t 𝑘) = (𝐽 ↾t 𝑘)
54	4, 53	restntr 22533	. . . . . . . . . . . . . 14 ⊢ ((𝐽 ∈ Top ∧ 𝑘 ⊆ 𝑋 ∧ (𝑢 ∩ 𝑘) ⊆ 𝑘) → ((int‘(𝐽 ↾t 𝑘))‘(𝑢 ∩ 𝑘)) = (((int‘𝐽)‘((𝑢 ∩ 𝑘) ∪ (𝑋 ∖ 𝑘))) ∩ 𝑘))
55	13, 19, 52, 54	syl3anc 1371	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → ((int‘(𝐽 ↾t 𝑘))‘(𝑢 ∩ 𝑘)) = (((int‘𝐽)‘((𝑢 ∩ 𝑘) ∪ (𝑋 ∖ 𝑘))) ∩ 𝑘))
56	51, 55	eqtr3d 2778	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → (𝑢 ∩ 𝑘) = (((int‘𝐽)‘((𝑢 ∩ 𝑘) ∪ (𝑋 ∖ 𝑘))) ∩ 𝑘))
57	36, 56	eleqtrd 2840	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → 𝑥 ∈ (((int‘𝐽)‘((𝑢 ∩ 𝑘) ∪ (𝑋 ∖ 𝑘))) ∩ 𝑘))
58	57	elin1d 4158	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → 𝑥 ∈ ((int‘𝐽)‘((𝑢 ∩ 𝑘) ∪ (𝑋 ∖ 𝑘))))
59		undif3 4250	. . . . . . . . . . . . 13 ⊢ ((𝑢 ∩ 𝑘) ∪ (𝑋 ∖ 𝑘)) = (((𝑢 ∩ 𝑘) ∪ 𝑋) ∖ (𝑘 ∖ (𝑢 ∩ 𝑘)))
60		incom 4161	. . . . . . . . . . . . . . . 16 ⊢ (𝑢 ∩ 𝑘) = (𝑘 ∩ 𝑢)
61	60	difeq2i 4079	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∖ (𝑢 ∩ 𝑘)) = (𝑘 ∖ (𝑘 ∩ 𝑢))
62		difin 4221	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∖ (𝑘 ∩ 𝑢)) = (𝑘 ∖ 𝑢)
63	61, 62	eqtri 2764	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∖ (𝑢 ∩ 𝑘)) = (𝑘 ∖ 𝑢)
64	63	difeq2i 4079	. . . . . . . . . . . . 13 ⊢ (((𝑢 ∩ 𝑘) ∪ 𝑋) ∖ (𝑘 ∖ (𝑢 ∩ 𝑘))) = (((𝑢 ∩ 𝑘) ∪ 𝑋) ∖ (𝑘 ∖ 𝑢))
65	59, 64	eqtri 2764	. . . . . . . . . . . 12 ⊢ ((𝑢 ∩ 𝑘) ∪ (𝑋 ∖ 𝑘)) = (((𝑢 ∩ 𝑘) ∪ 𝑋) ∖ (𝑘 ∖ 𝑢))
66	44, 19	sstrid 3955	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → (𝑢 ∩ 𝑘) ⊆ 𝑋)
67		ssequn1 4140	. . . . . . . . . . . . . 14 ⊢ ((𝑢 ∩ 𝑘) ⊆ 𝑋 ↔ ((𝑢 ∩ 𝑘) ∪ 𝑋) = 𝑋)
68	66, 67	sylib 217	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → ((𝑢 ∩ 𝑘) ∪ 𝑋) = 𝑋)
69	68	difeq1d 4081	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → (((𝑢 ∩ 𝑘) ∪ 𝑋) ∖ (𝑘 ∖ 𝑢)) = (𝑋 ∖ (𝑘 ∖ 𝑢)))
70	65, 69	eqtrid 2788	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → ((𝑢 ∩ 𝑘) ∪ (𝑋 ∖ 𝑘)) = (𝑋 ∖ (𝑘 ∖ 𝑢)))
71	70	fveq2d 6846	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → ((int‘𝐽)‘((𝑢 ∩ 𝑘) ∪ (𝑋 ∖ 𝑘))) = ((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))))
72	58, 71	eleqtrd 2840	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → 𝑥 ∈ ((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))))
73	72, 34	elind 4154	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → 𝑥 ∈ (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ ((int‘𝐽)‘𝑘)))
74		sslin 4194	. . . . . . . . . 10 ⊢ (((int‘𝐽)‘𝑘) ⊆ 𝑘 → (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ ((int‘𝐽)‘𝑘)) ⊆ (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ 𝑘))
75	26, 74	syl 17	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ ((int‘𝐽)‘𝑘)) ⊆ (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ 𝑘))
76	4	ntrss2 22408	. . . . . . . . . . . 12 ⊢ ((𝐽 ∈ Top ∧ (𝑋 ∖ (𝑘 ∖ 𝑢)) ⊆ 𝑋) → ((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ⊆ (𝑋 ∖ (𝑘 ∖ 𝑢)))
77	13, 14, 76	sylancl 586	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → ((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ⊆ (𝑋 ∖ (𝑘 ∖ 𝑢)))
78	77	difss2d 4094	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → ((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ⊆ 𝑋)
79		reldisj 4411	. . . . . . . . . . . 12 ⊢ (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ⊆ 𝑋 → ((((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ (𝑘 ∖ 𝑢)) = ∅ ↔ ((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ⊆ (𝑋 ∖ (𝑘 ∖ 𝑢))))
80	78, 79	syl 17	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → ((((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ (𝑘 ∖ 𝑢)) = ∅ ↔ ((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ⊆ (𝑋 ∖ (𝑘 ∖ 𝑢))))
81	77, 80	mpbird 256	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ (𝑘 ∖ 𝑢)) = ∅)
82		inssdif0 4329	. . . . . . . . . 10 ⊢ ((((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ 𝑘) ⊆ 𝑢 ↔ (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ (𝑘 ∖ 𝑢)) = ∅)
83	81, 82	sylibr 233	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ 𝑘) ⊆ 𝑢)
84	75, 83	sstrd 3954	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ ((int‘𝐽)‘𝑘)) ⊆ 𝑢)
85		eleq2 2826	. . . . . . . . . 10 ⊢ (𝑧 = (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ ((int‘𝐽)‘𝑘)) → (𝑥 ∈ 𝑧 ↔ 𝑥 ∈ (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ ((int‘𝐽)‘𝑘))))
86		sseq1 3969	. . . . . . . . . 10 ⊢ (𝑧 = (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ ((int‘𝐽)‘𝑘)) → (𝑧 ⊆ 𝑢 ↔ (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ ((int‘𝐽)‘𝑘)) ⊆ 𝑢))
87	85, 86	anbi12d 631	. . . . . . . . 9 ⊢ (𝑧 = (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ ((int‘𝐽)‘𝑘)) → ((𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑢) ↔ (𝑥 ∈ (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ ((int‘𝐽)‘𝑘)) ∧ (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ ((int‘𝐽)‘𝑘)) ⊆ 𝑢)))
88	87	rspcev 3581	. . . . . . . 8 ⊢ (((((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ ((int‘𝐽)‘𝑘)) ∈ 𝐽 ∧ (𝑥 ∈ (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ ((int‘𝐽)‘𝑘)) ∧ (((int‘𝐽)‘(𝑋 ∖ (𝑘 ∖ 𝑢))) ∩ ((int‘𝐽)‘𝑘)) ⊆ 𝑢)) → ∃𝑧 ∈ 𝐽 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑢))
89	23, 73, 84, 88	syl12anc 835	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) ∧ (𝑘 ∈ ((nei‘𝐽)‘{𝑥}) ∧ (𝐽 ↾t 𝑘) ∈ Comp)) → ∃𝑧 ∈ 𝐽 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑢))
90	12, 89	rexlimddv 3158	. . . . . 6 ⊢ (((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) ∧ 𝑥 ∈ 𝑢) → ∃𝑧 ∈ 𝐽 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑢))
91	90	ralrimiva 3143	. . . . 5 ⊢ ((𝜑 ∧ 𝑢 ∈ (𝑘Gen‘𝐽)) → ∀𝑥 ∈ 𝑢 ∃𝑧 ∈ 𝐽 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑢))
92	91	ex 413	. . . 4 ⊢ (𝜑 → (𝑢 ∈ (𝑘Gen‘𝐽) → ∀𝑥 ∈ 𝑢 ∃𝑧 ∈ 𝐽 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑢)))
93		eltop2 22325	. . . . 5 ⊢ (𝐽 ∈ Top → (𝑢 ∈ 𝐽 ↔ ∀𝑥 ∈ 𝑢 ∃𝑧 ∈ 𝐽 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑢)))
94	1, 93	syl 17	. . . 4 ⊢ (𝜑 → (𝑢 ∈ 𝐽 ↔ ∀𝑥 ∈ 𝑢 ∃𝑧 ∈ 𝐽 (𝑥 ∈ 𝑧 ∧ 𝑧 ⊆ 𝑢)))
95	92, 94	sylibrd 258	. . 3 ⊢ (𝜑 → (𝑢 ∈ (𝑘Gen‘𝐽) → 𝑢 ∈ 𝐽))
96	95	ssrdv 3950	. 2 ⊢ (𝜑 → (𝑘Gen‘𝐽) ⊆ 𝐽)
97		iskgen2 22899	. 2 ⊢ (𝐽 ∈ ran 𝑘Gen ↔ (𝐽 ∈ Top ∧ (𝑘Gen‘𝐽) ⊆ 𝐽))
98	1, 96, 97	sylanbrc 583	1 ⊢ (𝜑 → 𝐽 ∈ ran 𝑘Gen)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∀wral 3064  ∃wrex 3073  Vcvv 3445   ∖ cdif 3907   ∪ cun 3908   ∩ cin 3909   ⊆ wss 3910  ∅c0 4282  {csn 4586  ∪ cuni 4865  ran crn 5634  ‘cfv 6496  (class class class)co 7357   ↾_t crest 17302  Topctop 22242  intcnt 22368  neicnei 22448  Compccmp 22737  𝑘Genckgen 22884

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-int 4908  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-ov 7360  df-oprab 7361  df-mpo 7362  df-om 7803  df-1st 7921  df-2nd 7922  df-en 8884  df-fin 8887  df-fi 9347  df-rest 17304  df-topgen 17325  df-top 22243  df-topon 22260  df-bases 22296  df-ntr 22371  df-nei 22449  df-cmp 22738  df-kgen 22885

This theorem is referenced by:  cmpkgen  22902  llycmpkgen  22903