Theorem kgen2ss 23781

Description: The compact generator preserves the subset (fineness) relationship on topologies. (Contributed by Mario Carneiro, 21-Mar-2015.)

Assertion

Ref	Expression
kgen2ss	⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → (𝑘Gen‘𝐽) ⊆ (𝑘Gen‘𝐾))

Proof of Theorem kgen2ss

Dummy variables 𝑘 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp1 1154	. . . . . . . . 9 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → 𝐽 ∈ (TopOn‘𝑋))
2		elpwi 4564	. . . . . . . . 9 ⊢ (𝑘 ∈ 𝒫 𝑋 → 𝑘 ⊆ 𝑋)
3		resttopon 23386	. . . . . . . . 9 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑘 ⊆ 𝑋) → (𝐽 ↾t 𝑘) ∈ (TopOn‘𝑘))
4	1, 2, 3	syl2an 608	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (𝐽 ↾t 𝑘) ∈ (TopOn‘𝑘))
5		simp2 1155	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → 𝐾 ∈ (TopOn‘𝑋))
6		resttopon 23386	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝑘 ⊆ 𝑋) → (𝐾 ↾t 𝑘) ∈ (TopOn‘𝑘))
7	5, 2, 6	syl2an 608	. . . . . . . . . 10 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (𝐾 ↾t 𝑘) ∈ (TopOn‘𝑘))
8		toponuni 23139	. . . . . . . . . 10 ⊢ ((𝐾 ↾t 𝑘) ∈ (TopOn‘𝑘) → 𝑘 = ∪ (𝐾 ↾t 𝑘))
9	7, 8	syl 18	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → 𝑘 = ∪ (𝐾 ↾t 𝑘))
10	9	fveq2d 6882	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (TopOn‘𝑘) = (TopOn‘∪ (𝐾 ↾t 𝑘)))
11	4, 10	eleqtrd 2862	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (𝐽 ↾t 𝑘) ∈ (TopOn‘∪ (𝐾 ↾t 𝑘)))
12		simpl2 1211	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → 𝐾 ∈ (TopOn‘𝑋))
13		topontop 23138	. . . . . . . . 9 ⊢ (𝐾 ∈ (TopOn‘𝑋) → 𝐾 ∈ Top)
14	12, 13	syl 18	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → 𝐾 ∈ Top)
15		simpl3 1212	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → 𝐽 ⊆ 𝐾)
16		ssrest 23401	. . . . . . . 8 ⊢ ((𝐾 ∈ Top ∧ 𝐽 ⊆ 𝐾) → (𝐽 ↾t 𝑘) ⊆ (𝐾 ↾t 𝑘))
17	14, 15, 16	syl2anc 596	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (𝐽 ↾t 𝑘) ⊆ (𝐾 ↾t 𝑘))
18		eqid 2760	. . . . . . . . . 10 ⊢ ∪ (𝐾 ↾t 𝑘) = ∪ (𝐾 ↾t 𝑘)
19	18	sscmp 23630	. . . . . . . . 9 ⊢ (((𝐽 ↾t 𝑘) ∈ (TopOn‘∪ (𝐾 ↾t 𝑘)) ∧ (𝐾 ↾t 𝑘) ∈ Comp ∧ (𝐽 ↾t 𝑘) ⊆ (𝐾 ↾t 𝑘)) → (𝐽 ↾t 𝑘) ∈ Comp)
20	19	3com23 1144	. . . . . . . 8 ⊢ (((𝐽 ↾t 𝑘) ∈ (TopOn‘∪ (𝐾 ↾t 𝑘)) ∧ (𝐽 ↾t 𝑘) ⊆ (𝐾 ↾t 𝑘) ∧ (𝐾 ↾t 𝑘) ∈ Comp) → (𝐽 ↾t 𝑘) ∈ Comp)
21	20	3expia 1139	. . . . . . 7 ⊢ (((𝐽 ↾t 𝑘) ∈ (TopOn‘∪ (𝐾 ↾t 𝑘)) ∧ (𝐽 ↾t 𝑘) ⊆ (𝐾 ↾t 𝑘)) → ((𝐾 ↾t 𝑘) ∈ Comp → (𝐽 ↾t 𝑘) ∈ Comp))
22	11, 17, 21	syl2anc 596	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → ((𝐾 ↾t 𝑘) ∈ Comp → (𝐽 ↾t 𝑘) ∈ Comp))
23	17	sseld 3930	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → ((𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘) → (𝑥 ∩ 𝑘) ∈ (𝐾 ↾t 𝑘)))
24	22, 23	imim12d 82	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)) → ((𝐾 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐾 ↾t 𝑘))))
25	24	ralimdva 3174	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → (∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)) → ∀𝑘 ∈ 𝒫 𝑋((𝐾 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐾 ↾t 𝑘))))
26	25	anim2d 624	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → ((𝑥 ⊆ 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))) → (𝑥 ⊆ 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐾 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐾 ↾t 𝑘)))))
27		elkgen 23762	. . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝑥 ∈ (𝑘Gen‘𝐽) ↔ (𝑥 ⊆ 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)))))
28	27	3ad2ant1 1151	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → (𝑥 ∈ (𝑘Gen‘𝐽) ↔ (𝑥 ⊆ 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)))))
29		elkgen 23762	. . . 4 ⊢ (𝐾 ∈ (TopOn‘𝑋) → (𝑥 ∈ (𝑘Gen‘𝐾) ↔ (𝑥 ⊆ 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐾 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐾 ↾t 𝑘)))))
30	29	3ad2ant2 1152	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → (𝑥 ∈ (𝑘Gen‘𝐾) ↔ (𝑥 ⊆ 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐾 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐾 ↾t 𝑘)))))
31	26, 28, 30	3imtr4d 297	. 2 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → (𝑥 ∈ (𝑘Gen‘𝐽) → 𝑥 ∈ (𝑘Gen‘𝐾)))
32	31	ssrdv 3937	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → (𝑘Gen‘𝐽) ⊆ (𝑘Gen‘𝐾))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3076   ∩ cin 3898   ⊆ wss 3899  𝒫 cpw 4557  ∪ cuni 4867  ‘cfv 6533  (class class class)co 7413   ↾_t crest 17505  Topctop 23118  TopOnctopon 23135  Compccmp 23611  𝑘Genckgen 23759

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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  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-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-om 7863  df-1st 7986  df-2nd 7987  df-en 8953  df-fin 8956  df-fi 9381  df-rest 17507  df-topgen 17528  df-top 23119  df-topon 23136  df-bases 23171  df-cmp 23612  df-kgen 23760

This theorem is used by: (None)