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 44332
Description: Lemma for kelac2 44333 and dfac21 44334: 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 5403 . . . . 5 {𝑆, {𝒫 ∪ 𝑆}} ∈ V
2 vex 3458 . . . . . . . 8 𝑥 ∈ V
32elpr 4609 . . . . . . 7 (𝑥 ∈ {𝑆, {𝒫 ∪ 𝑆}} ↔ (𝑥 = 𝑆 ∨ 𝑥 = {𝒫 ∪ 𝑆}))
4 vex 3458 . . . . . . . 8 𝑦 ∈ V
54elpr 4609 . . . . . . 7 (𝑦 ∈ {𝑆, {𝒫 ∪ 𝑆}} ↔ (𝑦 = 𝑆 ∨ 𝑦 = {𝒫 ∪ 𝑆}))
6 eqtr3 2785 . . . . . . . . 9 ((𝑥 = 𝑆 ∧ 𝑦 = 𝑆) → 𝑥 = 𝑦)
76orcd 887 . . . . . . . 8 ((𝑥 = 𝑆 ∧ 𝑦 = 𝑆) → (𝑥 = 𝑦 ∨ (𝑥 ∩ 𝑦) = ∅))
8 ineq12 4115 . . . . . . . . . 10 ((𝑥 = {𝒫 ∪ 𝑆} ∧ 𝑦 = 𝑆) → (𝑥 ∩ 𝑦) = ({𝒫 ∪ 𝑆} ∩ 𝑆))
9 incom 4109 . . . . . . . . . . 11 ({𝒫 ∪ 𝑆} ∩ 𝑆) = (𝑆 ∩ {𝒫 ∪ 𝑆})
10 pwuninel 8330 . . . . . . . . . . . 12 ¬ 𝒫 ∪ 𝑆 ∈ 𝑆
11 disjsn 4673 . . . . . . . . . . . 12 ((𝑆 ∩ {𝒫 ∪ 𝑆}) = ∅ ↔ ¬ 𝒫 ∪ 𝑆 ∈ 𝑆)
1210, 11mpbir 234 . . . . . . . . . . 11 (𝑆 ∩ {𝒫 ∪ 𝑆}) = ∅
139, 12eqtri 2786 . . . . . . . . . 10 ({𝒫 ∪ 𝑆} ∩ 𝑆) = ∅
148, 13eqtrdi 2814 . . . . . . . . 9 ((𝑥 = {𝒫 ∪ 𝑆} ∧ 𝑦 = 𝑆) → (𝑥 ∩ 𝑦) = ∅)
1514olcd 888 . . . . . . . 8 ((𝑥 = {𝒫 ∪ 𝑆} ∧ 𝑦 = 𝑆) → (𝑥 = 𝑦 ∨ (𝑥 ∩ 𝑦) = ∅))
16 ineq12 4115 . . . . . . . . . 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 3206 . . . . 5 ∀𝑥 ∈ {𝑆, {𝒫 ∪ 𝑆}}∀𝑦 ∈ {𝑆, {𝒫 ∪ 𝑆}} (𝑥 = 𝑦 ∨ (𝑥 ∩ 𝑦) = ∅)
24 baspartn 23327 . . . . 5 (({𝑆, {𝒫 ∪ 𝑆}} ∈ V ∧ ∀𝑥 ∈ {𝑆, {𝒫 ∪ 𝑆}}∀𝑦 ∈ {𝑆, {𝒫 ∪ 𝑆}} (𝑥 = 𝑦 ∨ (𝑥 ∩ 𝑦) = ∅)) → {𝑆, {𝒫 ∪ 𝑆}} ∈ TopBases)
251, 23, 24mp2an 705 . . . 4 {𝑆, {𝒫 ∪ 𝑆}} ∈ TopBases
26 tgcl 23342 . . . 4 ({𝑆, {𝒫 ∪ 𝑆}} ∈ TopBases → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Top)
2725, 26mp1i 14 . . 3 (𝑆 ∈ 𝑉 → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Top)
28 prfi 9353 . . . . . 6 {𝑆, {𝒫 ∪ 𝑆}} ∈ Fin
29 pwfi 9348 . . . . . 6 ({𝑆, {𝒫 ∪ 𝑆}} ∈ Fin ↔ 𝒫 {𝑆, {𝒫 ∪ 𝑆}} ∈ Fin)
3028, 29mpbi 233 . . . . 5 𝒫 {𝑆, {𝒫 ∪ 𝑆}} ∈ Fin
31 tgdom 23351 . . . . . 6 ({𝑆, {𝒫 ∪ 𝑆}} ∈ V → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ≼ 𝒫 {𝑆, {𝒫 ∪ 𝑆}})
321, 31ax-mp 5 . . . . 5 (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ≼ 𝒫 {𝑆, {𝒫 ∪ 𝑆}}
33 domfi 9242 . . . . 5 ((𝒫 {𝑆, {𝒫 ∪ 𝑆}} ∈ Fin ∧ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ≼ 𝒫 {𝑆, {𝒫 ∪ 𝑆}}) → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Fin)
3430, 32, 33mp2an 705 . . . 4 (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Fin
3534a1i 11 . . 3 (𝑆 ∈ 𝑉 → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Fin)
3627, 35elind 4100 . 2 (𝑆 ∈ 𝑉 → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ (Top ∩ Fin))
37 fincmp 23766 . 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 1570   ∈ wcel 2147  ∀wral 3080  Vcvv 3454   ∩ cin 4092  ∅c0 4281  𝒫 cpw 4560  {csn 4588  {cpr 4590  ∪ cuni 4872   class class class wbr 5108  ‘cfv 6566   ≼ cdom 9009  Fincfn 9011  topGenctg 17658  Topctop 23266  TopBasesctb 23318  Compccmp 23759
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-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-om 7912  df-1o 8514  df-2o 8515  df-en 9012  df-dom 9013  df-fin 9015  df-topgen 17664  df-top 23267  df-bases 23319  df-cmp 23760
This theorem is used by:  kelac2  44333  dfac21  44334
  Copyright terms: Public domain W3C validator