Theorem kelac2lem 43060

Description: Lemma for kelac2 43061 and dfac21 43062: knob topologies are compact. (Contributed by Stefan O'Rear, 22-Feb-2015.)

Assertion

Ref	Expression
kelac2lem	⊢ (𝑆 ∈ 𝑉 → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Comp)

Proof of Theorem kelac2lem

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

Step	Hyp	Ref	Expression
1		prex 5395	. . . . 5 ⊢ {𝑆, {𝒫 ∪ 𝑆}} ∈ V
2		vex 3454	. . . . . . . 8 ⊢ 𝑥 ∈ V
3	2	elpr 4617	. . . . . . 7 ⊢ (𝑥 ∈ {𝑆, {𝒫 ∪ 𝑆}} ↔ (𝑥 = 𝑆 ∨ 𝑥 = {𝒫 ∪ 𝑆}))
4		vex 3454	. . . . . . . 8 ⊢ 𝑦 ∈ V
5	4	elpr 4617	. . . . . . 7 ⊢ (𝑦 ∈ {𝑆, {𝒫 ∪ 𝑆}} ↔ (𝑦 = 𝑆 ∨ 𝑦 = {𝒫 ∪ 𝑆}))
6		eqtr3 2752	. . . . . . . . 9 ⊢ ((𝑥 = 𝑆 ∧ 𝑦 = 𝑆) → 𝑥 = 𝑦)
7	6	orcd 873	. . . . . . . 8 ⊢ ((𝑥 = 𝑆 ∧ 𝑦 = 𝑆) → (𝑥 = 𝑦 ∨ (𝑥 ∩ 𝑦) = ∅))
8		ineq12 4181	. . . . . . . . . 10 ⊢ ((𝑥 = {𝒫 ∪ 𝑆} ∧ 𝑦 = 𝑆) → (𝑥 ∩ 𝑦) = ({𝒫 ∪ 𝑆} ∩ 𝑆))
9		incom 4175	. . . . . . . . . . 11 ⊢ ({𝒫 ∪ 𝑆} ∩ 𝑆) = (𝑆 ∩ {𝒫 ∪ 𝑆})
10		pwuninel 8257	. . . . . . . . . . . 12 ⊢ ¬ 𝒫 ∪ 𝑆 ∈ 𝑆
11		disjsn 4678	. . . . . . . . . . . 12 ⊢ ((𝑆 ∩ {𝒫 ∪ 𝑆}) = ∅ ↔ ¬ 𝒫 ∪ 𝑆 ∈ 𝑆)
12	10, 11	mpbir 231	. . . . . . . . . . 11 ⊢ (𝑆 ∩ {𝒫 ∪ 𝑆}) = ∅
13	9, 12	eqtri 2753	. . . . . . . . . 10 ⊢ ({𝒫 ∪ 𝑆} ∩ 𝑆) = ∅
14	8, 13	eqtrdi 2781	. . . . . . . . 9 ⊢ ((𝑥 = {𝒫 ∪ 𝑆} ∧ 𝑦 = 𝑆) → (𝑥 ∩ 𝑦) = ∅)
15	14	olcd 874	. . . . . . . 8 ⊢ ((𝑥 = {𝒫 ∪ 𝑆} ∧ 𝑦 = 𝑆) → (𝑥 = 𝑦 ∨ (𝑥 ∩ 𝑦) = ∅))
16		ineq12 4181	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑆 ∧ 𝑦 = {𝒫 ∪ 𝑆}) → (𝑥 ∩ 𝑦) = (𝑆 ∩ {𝒫 ∪ 𝑆}))
17	16, 12	eqtrdi 2781	. . . . . . . . 9 ⊢ ((𝑥 = 𝑆 ∧ 𝑦 = {𝒫 ∪ 𝑆}) → (𝑥 ∩ 𝑦) = ∅)
18	17	olcd 874	. . . . . . . 8 ⊢ ((𝑥 = 𝑆 ∧ 𝑦 = {𝒫 ∪ 𝑆}) → (𝑥 = 𝑦 ∨ (𝑥 ∩ 𝑦) = ∅))
19		eqtr3 2752	. . . . . . . . 9 ⊢ ((𝑥 = {𝒫 ∪ 𝑆} ∧ 𝑦 = {𝒫 ∪ 𝑆}) → 𝑥 = 𝑦)
20	19	orcd 873	. . . . . . . 8 ⊢ ((𝑥 = {𝒫 ∪ 𝑆} ∧ 𝑦 = {𝒫 ∪ 𝑆}) → (𝑥 = 𝑦 ∨ (𝑥 ∩ 𝑦) = ∅))
21	7, 15, 18, 20	ccase 1037	. . . . . . 7 ⊢ (((𝑥 = 𝑆 ∨ 𝑥 = {𝒫 ∪ 𝑆}) ∧ (𝑦 = 𝑆 ∨ 𝑦 = {𝒫 ∪ 𝑆})) → (𝑥 = 𝑦 ∨ (𝑥 ∩ 𝑦) = ∅))
22	3, 5, 21	syl2anb 598	. . . . . 6 ⊢ ((𝑥 ∈ {𝑆, {𝒫 ∪ 𝑆}} ∧ 𝑦 ∈ {𝑆, {𝒫 ∪ 𝑆}}) → (𝑥 = 𝑦 ∨ (𝑥 ∩ 𝑦) = ∅))
23	22	rgen2 3178	. . . . 5 ⊢ ∀𝑥 ∈ {𝑆, {𝒫 ∪ 𝑆}}∀𝑦 ∈ {𝑆, {𝒫 ∪ 𝑆}} (𝑥 = 𝑦 ∨ (𝑥 ∩ 𝑦) = ∅)
24		baspartn 22848	. . . . 5 ⊢ (({𝑆, {𝒫 ∪ 𝑆}} ∈ V ∧ ∀𝑥 ∈ {𝑆, {𝒫 ∪ 𝑆}}∀𝑦 ∈ {𝑆, {𝒫 ∪ 𝑆}} (𝑥 = 𝑦 ∨ (𝑥 ∩ 𝑦) = ∅)) → {𝑆, {𝒫 ∪ 𝑆}} ∈ TopBases)
25	1, 23, 24	mp2an 692	. . . 4 ⊢ {𝑆, {𝒫 ∪ 𝑆}} ∈ TopBases
26		tgcl 22863	. . . 4 ⊢ ({𝑆, {𝒫 ∪ 𝑆}} ∈ TopBases → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Top)
27	25, 26	mp1i 13	. . 3 ⊢ (𝑆 ∈ 𝑉 → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Top)
28		prfi 9281	. . . . . 6 ⊢ {𝑆, {𝒫 ∪ 𝑆}} ∈ Fin
29		pwfi 9275	. . . . . 6 ⊢ ({𝑆, {𝒫 ∪ 𝑆}} ∈ Fin ↔ 𝒫 {𝑆, {𝒫 ∪ 𝑆}} ∈ Fin)
30	28, 29	mpbi 230	. . . . 5 ⊢ 𝒫 {𝑆, {𝒫 ∪ 𝑆}} ∈ Fin
31		tgdom 22872	. . . . . 6 ⊢ ({𝑆, {𝒫 ∪ 𝑆}} ∈ V → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ≼ 𝒫 {𝑆, {𝒫 ∪ 𝑆}})
32	1, 31	ax-mp 5	. . . . 5 ⊢ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ≼ 𝒫 {𝑆, {𝒫 ∪ 𝑆}}
33		domfi 9159	. . . . 5 ⊢ ((𝒫 {𝑆, {𝒫 ∪ 𝑆}} ∈ Fin ∧ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ≼ 𝒫 {𝑆, {𝒫 ∪ 𝑆}}) → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Fin)
34	30, 32, 33	mp2an 692	. . . 4 ⊢ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Fin
35	34	a1i 11	. . 3 ⊢ (𝑆 ∈ 𝑉 → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Fin)
36	27, 35	elind 4166	. 2 ⊢ (𝑆 ∈ 𝑉 → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ (Top ∩ Fin))
37		fincmp 23287	. 2 ⊢ ((topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ (Top ∩ Fin) → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Comp)
38	36, 37	syl 17	1 ⊢ (𝑆 ∈ 𝑉 → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Comp)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∨ wo 847   = wceq 1540   ∈ wcel 2109  ∀wral 3045  Vcvv 3450   ∩ cin 3916  ∅c0 4299  𝒫 cpw 4566  {csn 4592  {cpr 4594  ∪ cuni 4874   class class class wbr 5110  ‘cfv 6514   ≼ cdom 8919  Fincfn 8921  topGenctg 17407  Topctop 22787  TopBasesctb 22839  Compccmp 23280

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-om 7846  df-1o 8437  df-2o 8438  df-en 8922  df-dom 8923  df-fin 8925  df-topgen 17413  df-top 22788  df-bases 22840  df-cmp 23281

This theorem is referenced by:  kelac2  43061  dfac21  43062