Theorem kgen2ss 23929

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 4567	. . . . . . . . 9 ⊢ (𝑘 ∈ 𝒫 𝑋 → 𝑘 ⊆ 𝑋)
3		resttopon 23534	. . . . . . . . 9 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝑘 ⊆ 𝑋) → (𝐽 ↾t 𝑘) ∈ (TopOn‘𝑘))
4	1, 2, 3	syl2an 608	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (𝐽 ↾t 𝑘) ∈ (TopOn‘𝑘))
5		simp2 1155	. . . . . . . . . . 11 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → 𝐾 ∈ (TopOn‘𝑋))
6		resttopon 23534	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ (TopOn‘𝑋) ∧ 𝑘 ⊆ 𝑋) → (𝐾 ↾t 𝑘) ∈ (TopOn‘𝑘))
7	5, 2, 6	syl2an 608	. . . . . . . . . 10 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (𝐾 ↾t 𝑘) ∈ (TopOn‘𝑘))
8		toponuni 23287	. . . . . . . . . 10 ⊢ ((𝐾 ↾t 𝑘) ∈ (TopOn‘𝑘) → 𝑘 = ∪ (𝐾 ↾t 𝑘))
9	7, 8	syl 18	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → 𝑘 = ∪ (𝐾 ↾t 𝑘))
10	9	fveq2d 6920	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (TopOn‘𝑘) = (TopOn‘∪ (𝐾 ↾t 𝑘)))
11	4, 10	eleqtrd 2866	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (𝐽 ↾t 𝑘) ∈ (TopOn‘∪ (𝐾 ↾t 𝑘)))
12		simpl2 1211	. . . . . . . . 9 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → 𝐾 ∈ (TopOn‘𝑋))
13		topontop 23286	. . . . . . . . 9 ⊢ (𝐾 ∈ (TopOn‘𝑋) → 𝐾 ∈ Top)
14	12, 13	syl 18	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → 𝐾 ∈ Top)
15		simpl3 1212	. . . . . . . 8 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → 𝐽 ⊆ 𝐾)
16		ssrest 23549	. . . . . . . 8 ⊢ ((𝐾 ∈ Top ∧ 𝐽 ⊆ 𝐾) → (𝐽 ↾t 𝑘) ⊆ (𝐾 ↾t 𝑘))
17	14, 15, 16	syl2anc 596	. . . . . . 7 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (𝐽 ↾t 𝑘) ⊆ (𝐾 ↾t 𝑘))
18		eqid 2763	. . . . . . . . . 10 ⊢ ∪ (𝐾 ↾t 𝑘) = ∪ (𝐾 ↾t 𝑘)
19	18	sscmp 23778	. . . . . . . . 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 3912	. . . . . 6 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → ((𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘) → (𝑥 ∩ 𝑘) ∈ (𝐾 ↾t 𝑘)))
24	22, 23	imim12d 82	. . . . 5 ⊢ (((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) ∧ 𝑘 ∈ 𝒫 𝑋) → (((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)) → ((𝐾 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐾 ↾t 𝑘))))
25	24	ralimdva 3178	. . . 4 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → (∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)) → ∀𝑘 ∈ 𝒫 𝑋((𝐾 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐾 ↾t 𝑘))))
26	25	anim2d 624	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → ((𝑥 ⊆ 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘))) → (𝑥 ⊆ 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐾 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐾 ↾t 𝑘)))))
27		elkgen 23910	. . . 4 ⊢ (𝐽 ∈ (TopOn‘𝑋) → (𝑥 ∈ (𝑘Gen‘𝐽) ↔ (𝑥 ⊆ 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)))))
28	27	3ad2ant1 1151	. . 3 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → (𝑥 ∈ (𝑘Gen‘𝐽) ↔ (𝑥 ⊆ 𝑋 ∧ ∀𝑘 ∈ 𝒫 𝑋((𝐽 ↾t 𝑘) ∈ Comp → (𝑥 ∩ 𝑘) ∈ (𝐽 ↾t 𝑘)))))
29		elkgen 23910	. . . 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 3919	1 ⊢ ((𝐽 ∈ (TopOn‘𝑋) ∧ 𝐾 ∈ (TopOn‘𝑋) ∧ 𝐽 ⊆ 𝐾) → (𝑘Gen‘𝐽) ⊆ (𝑘Gen‘𝐾))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ⊆ wss 3900   ∩ cin 4092  𝒫 cpw 4560  ∪ cuni 4872  ‘cfv 6566  (class class class)co 7451   ↾_t crest 17641  Topctop 23266  TopOnctopon 23283  Compccmp 23759  𝑘Genckgen 23907

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-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

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 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-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  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 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-en 9012  df-fin 9015  df-fi 9440  df-rest 17643  df-topgen 17664  df-top 23267  df-topon 23284  df-bases 23319  df-cmp 23760  df-kgen 23908

This theorem is used by: (None)