Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  kelac2lem Structured version   Visualization version   GIF version

Theorem kelac2lem 44206
Description: Lemma for kelac2 44207 and dfac21 44208: 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.
StepHypRef Expression
1 prex 5399 . . . . 5 {𝑆, {𝒫 ∪ 𝑆}} ∈ V
2 vex 3457 . . . . . . . 8 𝑥 ∈ V
32elpr 4608 . . . . . . 7 (𝑥 ∈ {𝑆, {𝒫 ∪ 𝑆}} ↔ (𝑥 = 𝑆 ∨ 𝑥 = {𝒫 ∪ 𝑆}))
4 vex 3457 . . . . . . . 8 𝑦 ∈ V
54elpr 4608 . . . . . . 7 (𝑦 ∈ {𝑆, {𝒫 ∪ 𝑆}} ↔ (𝑦 = 𝑆 ∨ 𝑦 = {𝒫 ∪ 𝑆}))
6 eqtr3 2785 . . . . . . . . 9 ((𝑥 = 𝑆 ∧ 𝑦 = 𝑆) → 𝑥 = 𝑦)
76orcd 887 . . . . . . . 8 ((𝑥 = 𝑆 ∧ 𝑦 = 𝑆) → (𝑥 = 𝑦 ∨ (𝑥 ∩ 𝑦) = ∅))
8 ineq12 4114 . . . . . . . . . 10 ((𝑥 = {𝒫 ∪ 𝑆} ∧ 𝑦 = 𝑆) → (𝑥 ∩ 𝑦) = ({𝒫 ∪ 𝑆} ∩ 𝑆))
9 incom 4108 . . . . . . . . . . 11 ({𝒫 ∪ 𝑆} ∩ 𝑆) = (𝑆 ∩ {𝒫 ∪ 𝑆})
10 pwuninel 8303 . . . . . . . . . . . 12 ¬ 𝒫 ∪ 𝑆 ∈ 𝑆
11 disjsn 4671 . . . . . . . . . . . 12 ((𝑆 ∩ {𝒫 ∪ 𝑆}) = ∅ ↔ ¬ 𝒫 ∪ 𝑆 ∈ 𝑆)
1210, 11mpbir 234 . . . . . . . . . . 11 (𝑆 ∩ {𝒫 ∪ 𝑆}) = ∅
139, 12eqtri 2786 . . . . . . . . . 10 ({𝒫 ∪ 𝑆} ∩ 𝑆) = ∅
148, 13eqtrdi 2814 . . . . . . . . 9 ((𝑥 = {𝒫 ∪ 𝑆} ∧ 𝑦 = 𝑆) → (𝑥 ∩ 𝑦) = ∅)
1514olcd 888 . . . . . . . 8 ((𝑥 = {𝒫 ∪ 𝑆} ∧ 𝑦 = 𝑆) → (𝑥 = 𝑦 ∨ (𝑥 ∩ 𝑦) = ∅))
16 ineq12 4114 . . . . . . . . . 10 ((𝑥 = 𝑆 ∧ 𝑦 = {𝒫 ∪ 𝑆}) → (𝑥 ∩ 𝑦) = (𝑆 ∩ {𝒫 ∪ 𝑆}))
1716, 12eqtrdi 2814 . . . . . . . . 9 ((𝑥 = 𝑆 ∧ 𝑦 = {𝒫 ∪ 𝑆}) → (𝑥 ∩ 𝑦) = ∅)
1817olcd 888 . . . . . . . 8 ((𝑥 = 𝑆 ∧ 𝑦 = {𝒫 ∪ 𝑆}) → (𝑥 = 𝑦 ∨ (𝑥 ∩ 𝑦) = ∅))
19 eqtr3 2785 . . . . . . . . 9 ((𝑥 = {𝒫 ∪ 𝑆} ∧ 𝑦 = {𝒫 ∪ 𝑆}) → 𝑥 = 𝑦)
2019orcd 887 . . . . . . . 8 ((𝑥 = {𝒫 ∪ 𝑆} ∧ 𝑦 = {𝒫 ∪ 𝑆}) → (𝑥 = 𝑦 ∨ (𝑥 ∩ 𝑦) = ∅))
217, 15, 18, 20ccase 1053 . . . . . . 7 (((𝑥 = 𝑆 ∨ 𝑥 = {𝒫 ∪ 𝑆}) ∧ (𝑦 = 𝑆 ∨ 𝑦 = {𝒫 ∪ 𝑆})) → (𝑥 = 𝑦 ∨ (𝑥 ∩ 𝑦) = ∅))
223, 5, 21syl2anb 610 . . . . . 6 ((𝑥 ∈ {𝑆, {𝒫 ∪ 𝑆}} ∧ 𝑦 ∈ {𝑆, {𝒫 ∪ 𝑆}}) → (𝑥 = 𝑦 ∨ (𝑥 ∩ 𝑦) = ∅))
2322rgen2 3205 . . . . 5 ∀𝑥 ∈ {𝑆, {𝒫 ∪ 𝑆}}∀𝑦 ∈ {𝑆, {𝒫 ∪ 𝑆}} (𝑥 = 𝑦 ∨ (𝑥 ∩ 𝑦) = ∅)
24 baspartn 23284 . . . . 5 (({𝑆, {𝒫 ∪ 𝑆}} ∈ V ∧ ∀𝑥 ∈ {𝑆, {𝒫 ∪ 𝑆}}∀𝑦 ∈ {𝑆, {𝒫 ∪ 𝑆}} (𝑥 = 𝑦 ∨ (𝑥 ∩ 𝑦) = ∅)) → {𝑆, {𝒫 ∪ 𝑆}} ∈ TopBases)
251, 23, 24mp2an 705 . . . 4 {𝑆, {𝒫 ∪ 𝑆}} ∈ TopBases
26 tgcl 23299 . . . 4 ({𝑆, {𝒫 ∪ 𝑆}} ∈ TopBases → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Top)
2725, 26mp1i 14 . . 3 (𝑆 ∈ 𝑉 → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Top)
28 prfi 9326 . . . . . 6 {𝑆, {𝒫 ∪ 𝑆}} ∈ Fin
29 pwfi 9321 . . . . . 6 ({𝑆, {𝒫 ∪ 𝑆}} ∈ Fin ↔ 𝒫 {𝑆, {𝒫 ∪ 𝑆}} ∈ Fin)
3028, 29mpbi 233 . . . . 5 𝒫 {𝑆, {𝒫 ∪ 𝑆}} ∈ Fin
31 tgdom 23308 . . . . . 6 ({𝑆, {𝒫 ∪ 𝑆}} ∈ V → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ≼ 𝒫 {𝑆, {𝒫 ∪ 𝑆}})
321, 31ax-mp 5 . . . . 5 (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ≼ 𝒫 {𝑆, {𝒫 ∪ 𝑆}}
33 domfi 9215 . . . . 5 ((𝒫 {𝑆, {𝒫 ∪ 𝑆}} ∈ Fin ∧ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ≼ 𝒫 {𝑆, {𝒫 ∪ 𝑆}}) → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Fin)
3430, 32, 33mp2an 705 . . . 4 (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Fin
3534a1i 11 . . 3 (𝑆 ∈ 𝑉 → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Fin)
3627, 35elind 4099 . 2 (𝑆 ∈ 𝑉 → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ (Top ∩ Fin))
37 fincmp 23723 . 2 ((topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ (Top ∩ Fin) → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Comp)
3836, 37syl 18 1 (𝑆 ∈ 𝑉 → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Comp)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∨ wo 861   = wceq 1569   ∈ wcel 2146  ∀wral 3079  Vcvv 3453   ∩ cin 4091  ∅c0 4280  𝒫 cpw 4559  {csn 4587  {cpr 4589  ∪ cuni 4869   class class class wbr 5105  ‘cfv 6546   ≼ cdom 8982  Fincfn 8984  topGenctg 17620  Topctop 23223  TopBasesctb 23275  Compccmp 23716
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5234  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-iun 4955  df-br 5106  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5549  df-eprel 5554  df-po 5562  df-so 5563  df-fr 5607  df-we 5609  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-ord 6371  df-on 6372  df-lim 6373  df-suc 6374  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-f1 6551  df-fo 6552  df-f1o 6553  df-fv 6554  df-om 7885  df-1o 8487  df-2o 8488  df-en 8985  df-dom 8986  df-fin 8988  df-topgen 17626  df-top 23224  df-bases 23276  df-cmp 23717
This theorem is used by:  kelac2  44207  dfac21  44208
  Copyright terms: Public domain W3C validator