Theorem kgen2ss 23743

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 4571	. . . . . . . . 9 ⊢ (𝑘 ∈ 𝒫 𝑋 → 𝑘 ⊆ 𝑋)
3		resttopon 23348	. . . . . . . . 9 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑘 ⊆ 𝑋) → (𝐽 ↾t 𝑘) ∈ (TopOn‘𝑘))
4	1, 2, 3	syl2an 608	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (𝐽 ↾t 𝑘) ∈ (TopOn‘𝑘))
5		simp2 1155	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → 𝐾 ∈ (TopOn‘𝑋))
6		resttopon 23348	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝑘 ⊆ 𝑋) → (𝐾 ↾t 𝑘) ∈ (TopOn‘𝑘))
7	5, 2, 6	syl2an 608	. . . . . . . . . 10 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (𝐾 ↾t 𝑘) ∈ (TopOn‘𝑘))
8		toponuni 23101	. . . . . . . . . 10 ⊢ ((𝐾 ↾t 𝑘) ∈ (TopOn‘𝑘) → 𝑘 = ∪ (𝐾 ↾t 𝑘))
9	7, 8	syl 18	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → 𝑘 = ∪ (𝐾 ↾t 𝑘))
10	9	fveq2d 6889	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (TopOn‘𝑘) = (TopOn‘∪ (𝐾 ↾t 𝑘)))
11	4, 10	eleqtrd 2867	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (𝐽 ↾t 𝑘) ∈ (TopOn‘∪ (𝐾 ↾t 𝑘)))
12		simpl2 1211	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → 𝐾 ∈ (TopOn‘𝑋))
13		topontop 23100	. . . . . . . . 9 ⊢ (𝐾 ∈ (TopOn‘𝑋) → 𝐾 ∈ Top)
14	12, 13	syl 18	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → 𝐾 ∈ Top)
15		simpl3 1212	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → 𝐽 ⊆ 𝐾)
16		ssrest 23363	. . . . . . . 8 ⊢ ((𝐾 ∈ Top ∧ 𝐽 ⊆ 𝐾) → (𝐽 ↾t 𝑘) ⊆ (𝐾 ↾t 𝑘))
17	14, 15, 16	syl2anc 596	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (𝐽 ↾t 𝑘) ⊆ (𝐾 ↾t 𝑘))
18		eqid 2765	. . . . . . . . . 10 ⊢ ∪ (𝐾 ↾t 𝑘) = ∪ (𝐾 ↾t 𝑘)
19	18	sscmp 23592	. . . . . . . . 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 3937	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → ((𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘) → (𝑥 ∩ 𝑘) ∈ (𝐾 ↾t 𝑘)))
24	22, 23	imim12d 82	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)) → ((𝐾 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐾 ↾t 𝑘))))
25	24	ralimdva 3179	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → (∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)) → ∀𝑘 ∈ 𝒫 𝑋((𝐾 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐾 ↾t 𝑘))))
26	25	anim2d 624	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → ((𝑥 ⊆ 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))) → (𝑥 ⊆ 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐾 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐾 ↾t 𝑘)))))
27		elkgen 23724	. . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝑥 ∈ (𝑘Gen‘𝐽) ↔ (𝑥 ⊆ 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)))))
28	27	3ad2ant1 1151	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → (𝑥 ∈ (𝑘Gen‘𝐽) ↔ (𝑥 ⊆ 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)))))
29		elkgen 23724	. . . 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 3944	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → (𝑘Gen‘𝐽) ⊆ (𝑘Gen‘𝐾))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∀wral 3081   ∩ cin 3905   ⊆ wss 3906  𝒫 cpw 4564  ∪ cuni 4874  ‘cfv 6540  (class class class)co 7416   ↾_t crest 17491  Topctop 23080  TopOnctopon 23097  Compccmp 23573  𝑘Genckgen 23721

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7865  df-1st 7988  df-2nd 7989  df-en 8946  df-fin 8949  df-fi 9374  df-rest 17493  df-topgen 17514  df-top 23081  df-topon 23098  df-bases 23133  df-cmp 23574  df-kgen 23722

This theorem is used by: (None)