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 37111
Description: Lemma for kelac2 37112 and dfac21 37113: 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 4870 . . . . 5 {𝑆, {𝒫 𝑆}} ∈ V
2 vex 3189 . . . . . . . 8 𝑥 ∈ V
32elpr 4169 . . . . . . 7 (𝑥 ∈ {𝑆, {𝒫 𝑆}} ↔ (𝑥 = 𝑆𝑥 = {𝒫 𝑆}))
4 vex 3189 . . . . . . . 8 𝑦 ∈ V
54elpr 4169 . . . . . . 7 (𝑦 ∈ {𝑆, {𝒫 𝑆}} ↔ (𝑦 = 𝑆𝑦 = {𝒫 𝑆}))
6 eqtr3 2642 . . . . . . . . 9 ((𝑥 = 𝑆𝑦 = 𝑆) → 𝑥 = 𝑦)
76orcd 407 . . . . . . . 8 ((𝑥 = 𝑆𝑦 = 𝑆) → (𝑥 = 𝑦 ∨ (𝑥𝑦) = ∅))
8 ineq12 3787 . . . . . . . . . 10 ((𝑥 = {𝒫 𝑆} ∧ 𝑦 = 𝑆) → (𝑥𝑦) = ({𝒫 𝑆} ∩ 𝑆))
9 incom 3783 . . . . . . . . . . 11 ({𝒫 𝑆} ∩ 𝑆) = (𝑆 ∩ {𝒫 𝑆})
10 pwuninel 7346 . . . . . . . . . . . 12 ¬ 𝒫 𝑆𝑆
11 disjsn 4216 . . . . . . . . . . . 12 ((𝑆 ∩ {𝒫 𝑆}) = ∅ ↔ ¬ 𝒫 𝑆𝑆)
1210, 11mpbir 221 . . . . . . . . . . 11 (𝑆 ∩ {𝒫 𝑆}) = ∅
139, 12eqtri 2643 . . . . . . . . . 10 ({𝒫 𝑆} ∩ 𝑆) = ∅
148, 13syl6eq 2671 . . . . . . . . 9 ((𝑥 = {𝒫 𝑆} ∧ 𝑦 = 𝑆) → (𝑥𝑦) = ∅)
1514olcd 408 . . . . . . . 8 ((𝑥 = {𝒫 𝑆} ∧ 𝑦 = 𝑆) → (𝑥 = 𝑦 ∨ (𝑥𝑦) = ∅))
16 ineq12 3787 . . . . . . . . . 10 ((𝑥 = 𝑆𝑦 = {𝒫 𝑆}) → (𝑥𝑦) = (𝑆 ∩ {𝒫 𝑆}))
1716, 12syl6eq 2671 . . . . . . . . 9 ((𝑥 = 𝑆𝑦 = {𝒫 𝑆}) → (𝑥𝑦) = ∅)
1817olcd 408 . . . . . . . 8 ((𝑥 = 𝑆𝑦 = {𝒫 𝑆}) → (𝑥 = 𝑦 ∨ (𝑥𝑦) = ∅))
19 eqtr3 2642 . . . . . . . . 9 ((𝑥 = {𝒫 𝑆} ∧ 𝑦 = {𝒫 𝑆}) → 𝑥 = 𝑦)
2019orcd 407 . . . . . . . 8 ((𝑥 = {𝒫 𝑆} ∧ 𝑦 = {𝒫 𝑆}) → (𝑥 = 𝑦 ∨ (𝑥𝑦) = ∅))
217, 15, 18, 20ccase 986 . . . . . . 7 (((𝑥 = 𝑆𝑥 = {𝒫 𝑆}) ∧ (𝑦 = 𝑆𝑦 = {𝒫 𝑆})) → (𝑥 = 𝑦 ∨ (𝑥𝑦) = ∅))
223, 5, 21syl2anb 496 . . . . . 6 ((𝑥 ∈ {𝑆, {𝒫 𝑆}} ∧ 𝑦 ∈ {𝑆, {𝒫 𝑆}}) → (𝑥 = 𝑦 ∨ (𝑥𝑦) = ∅))
2322rgen2a 2971 . . . . 5 𝑥 ∈ {𝑆, {𝒫 𝑆}}∀𝑦 ∈ {𝑆, {𝒫 𝑆}} (𝑥 = 𝑦 ∨ (𝑥𝑦) = ∅)
24 baspartn 20669 . . . . 5 (({𝑆, {𝒫 𝑆}} ∈ V ∧ ∀𝑥 ∈ {𝑆, {𝒫 𝑆}}∀𝑦 ∈ {𝑆, {𝒫 𝑆}} (𝑥 = 𝑦 ∨ (𝑥𝑦) = ∅)) → {𝑆, {𝒫 𝑆}} ∈ TopBases)
251, 23, 24mp2an 707 . . . 4 {𝑆, {𝒫 𝑆}} ∈ TopBases
26 tgcl 20684 . . . 4 ({𝑆, {𝒫 𝑆}} ∈ TopBases → (topGen‘{𝑆, {𝒫 𝑆}}) ∈ Top)
2725, 26mp1i 13 . . 3 (𝑆𝑉 → (topGen‘{𝑆, {𝒫 𝑆}}) ∈ Top)
28 prfi 8179 . . . . . 6 {𝑆, {𝒫 𝑆}} ∈ Fin
29 pwfi 8205 . . . . . 6 ({𝑆, {𝒫 𝑆}} ∈ Fin ↔ 𝒫 {𝑆, {𝒫 𝑆}} ∈ Fin)
3028, 29mpbi 220 . . . . 5 𝒫 {𝑆, {𝒫 𝑆}} ∈ Fin
31 tgdom 20693 . . . . . 6 ({𝑆, {𝒫 𝑆}} ∈ V → (topGen‘{𝑆, {𝒫 𝑆}}) ≼ 𝒫 {𝑆, {𝒫 𝑆}})
321, 31ax-mp 5 . . . . 5 (topGen‘{𝑆, {𝒫 𝑆}}) ≼ 𝒫 {𝑆, {𝒫 𝑆}}
33 domfi 8125 . . . . 5 ((𝒫 {𝑆, {𝒫 𝑆}} ∈ Fin ∧ (topGen‘{𝑆, {𝒫 𝑆}}) ≼ 𝒫 {𝑆, {𝒫 𝑆}}) → (topGen‘{𝑆, {𝒫 𝑆}}) ∈ Fin)
3430, 32, 33mp2an 707 . . . 4 (topGen‘{𝑆, {𝒫 𝑆}}) ∈ Fin
3534a1i 11 . . 3 (𝑆𝑉 → (topGen‘{𝑆, {𝒫 𝑆}}) ∈ Fin)
3627, 35elind 3776 . 2 (𝑆𝑉 → (topGen‘{𝑆, {𝒫 𝑆}}) ∈ (Top ∩ Fin))
37 fincmp 21106 . 2 ((topGen‘{𝑆, {𝒫 𝑆}}) ∈ (Top ∩ Fin) → (topGen‘{𝑆, {𝒫 𝑆}}) ∈ Comp)
3836, 37syl 17 1 (𝑆𝑉 → (topGen‘{𝑆, {𝒫 𝑆}}) ∈ Comp)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wo 383  wa 384   = wceq 1480  wcel 1987  wral 2907  Vcvv 3186  cin 3554  c0 3891  𝒫 cpw 4130  {csn 4148  {cpr 4150   cuni 4402   class class class wbr 4613  cfv 5847  cdom 7897  Fincfn 7899  topGenctg 16019  Topctop 20617  TopBasesctb 20620  Compccmp 21099
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4731  ax-sep 4741  ax-nul 4749  ax-pow 4803  ax-pr 4867  ax-un 6902
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-nel 2894  df-ral 2912  df-rex 2913  df-reu 2914  df-rab 2916  df-v 3188  df-sbc 3418  df-csb 3515  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-pss 3571  df-nul 3892  df-if 4059  df-pw 4132  df-sn 4149  df-pr 4151  df-tp 4153  df-op 4155  df-uni 4403  df-int 4441  df-iun 4487  df-br 4614  df-opab 4674  df-mpt 4675  df-tr 4713  df-eprel 4985  df-id 4989  df-po 4995  df-so 4996  df-fr 5033  df-we 5035  df-xp 5080  df-rel 5081  df-cnv 5082  df-co 5083  df-dm 5084  df-rn 5085  df-res 5086  df-ima 5087  df-pred 5639  df-ord 5685  df-on 5686  df-lim 5687  df-suc 5688  df-iota 5810  df-fun 5849  df-fn 5850  df-f 5851  df-f1 5852  df-fo 5853  df-f1o 5854  df-fv 5855  df-ov 6607  df-oprab 6608  df-mpt2 6609  df-om 7013  df-1st 7113  df-2nd 7114  df-wrecs 7352  df-recs 7413  df-rdg 7451  df-1o 7505  df-2o 7506  df-oadd 7509  df-er 7687  df-map 7804  df-en 7900  df-dom 7901  df-sdom 7902  df-fin 7903  df-topgen 16025  df-top 20621  df-bases 20622  df-cmp 21100
This theorem is referenced by:  kelac2  37112  dfac21  37113
  Copyright terms: Public domain W3C validator