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

Theorem kelac2 44333
Description: Kelley's choice, most common form: compactness of a product of knob topologies recovers choice. (Contributed by Stefan O'Rear, 22-Feb-2015.)
Hypotheses
Ref Expression
kelac2.s ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ∈ 𝑉)
kelac2.z ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ≠ ∅)
kelac2.k (𝜑 → (∏t‘(𝑥 ∈ 𝐼 ↦ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}))) ∈ Comp)
Assertion
Ref Expression
kelac2 (𝜑 → X𝑥 ∈ 𝐼 𝑆 ≠ ∅)
Distinct variable groups:   𝜑,𝑥   𝑥,𝐼
Allowed substitution hints:   𝑆(𝑥)   𝑉(𝑥)

Proof of Theorem kelac2
StepHypRef Expression
1 kelac2.z . 2 ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ≠ ∅)
2 kelac2.s . . 3 ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ∈ 𝑉)
3 kelac2lem 44332 . . 3 (𝑆 ∈ 𝑉 → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Comp)
4 cmptop 23768 . . 3 ((topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Comp → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Top)
52, 3, 43syl 19 . 2 ((𝜑 ∧ 𝑥 ∈ 𝐼) → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Top)
6 uncom 4160 . . . . . . 7 (𝑆 ∪ {𝒫 ∪ 𝑆}) = ({𝒫 ∪ 𝑆} ∪ 𝑆)
76difeq1i 4062 . . . . . 6 ((𝑆 ∪ {𝒫 ∪ 𝑆}) ∖ 𝑆) = (({𝒫 ∪ 𝑆} ∪ 𝑆) ∖ 𝑆)
8 difun2 4440 . . . . . 6 (({𝒫 ∪ 𝑆} ∪ 𝑆) ∖ 𝑆) = ({𝒫 ∪ 𝑆} ∖ 𝑆)
97, 8eqtri 2786 . . . . 5 ((𝑆 ∪ {𝒫 ∪ 𝑆}) ∖ 𝑆) = ({𝒫 ∪ 𝑆} ∖ 𝑆)
10 snex 5404 . . . . . . 7 {𝒫 ∪ 𝑆} ∈ V
11 uniprg 4888 . . . . . . 7 ((𝑆 ∈ 𝑉 ∧ {𝒫 ∪ 𝑆} ∈ V) → ∪ {𝑆, {𝒫 ∪ 𝑆}} = (𝑆 ∪ {𝒫 ∪ 𝑆}))
122, 10, 11sylancl 598 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ 𝐼) → ∪ {𝑆, {𝒫 ∪ 𝑆}} = (𝑆 ∪ {𝒫 ∪ 𝑆}))
1312difeq1d 4065 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝐼) → (∪ {𝑆, {𝒫 ∪ 𝑆}} ∖ 𝑆) = ((𝑆 ∪ {𝒫 ∪ 𝑆}) ∖ 𝑆))
14 incom 4109 . . . . . . 7 ({𝒫 ∪ 𝑆} ∩ 𝑆) = (𝑆 ∩ {𝒫 ∪ 𝑆})
15 pwuninel 8330 . . . . . . . . 9 ¬ 𝒫 ∪ 𝑆 ∈ 𝑆
1615a1i 11 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ 𝐼) → ¬ 𝒫 ∪ 𝑆 ∈ 𝑆)
17 disjsn 4673 . . . . . . . 8 ((𝑆 ∩ {𝒫 ∪ 𝑆}) = ∅ ↔ ¬ 𝒫 ∪ 𝑆 ∈ 𝑆)
1816, 17sylibr 237 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑆 ∩ {𝒫 ∪ 𝑆}) = ∅)
1914, 18eqtrid 2810 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ 𝐼) → ({𝒫 ∪ 𝑆} ∩ 𝑆) = ∅)
20 disj3 4410 . . . . . 6 (({𝒫 ∪ 𝑆} ∩ 𝑆) = ∅ ↔ {𝒫 ∪ 𝑆} = ({𝒫 ∪ 𝑆} ∖ 𝑆))
2119, 20sylib 221 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝐼) → {𝒫 ∪ 𝑆} = ({𝒫 ∪ 𝑆} ∖ 𝑆))
229, 13, 213eqtr4a 2824 . . . 4 ((𝜑 ∧ 𝑥 ∈ 𝐼) → (∪ {𝑆, {𝒫 ∪ 𝑆}} ∖ 𝑆) = {𝒫 ∪ 𝑆})
23 prex 5403 . . . . . 6 {𝑆, {𝒫 ∪ 𝑆}} ∈ V
24 bastg 23339 . . . . . 6 ({𝑆, {𝒫 ∪ 𝑆}} ∈ V → {𝑆, {𝒫 ∪ 𝑆}} ⊆ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}))
2523, 24mp1i 14 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝐼) → {𝑆, {𝒫 ∪ 𝑆}} ⊆ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}))
2610prid2 4726 . . . . . 6 {𝒫 ∪ 𝑆} ∈ {𝑆, {𝒫 ∪ 𝑆}}
2726a1i 11 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝐼) → {𝒫 ∪ 𝑆} ∈ {𝑆, {𝒫 ∪ 𝑆}})
2825, 27sseldd 3914 . . . 4 ((𝜑 ∧ 𝑥 ∈ 𝐼) → {𝒫 ∪ 𝑆} ∈ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}))
2922, 28eqeltrd 2864 . . 3 ((𝜑 ∧ 𝑥 ∈ 𝐼) → (∪ {𝑆, {𝒫 ∪ 𝑆}} ∖ 𝑆) ∈ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}))
30 prid1g 4723 . . . . 5 (𝑆 ∈ 𝑉 → 𝑆 ∈ {𝑆, {𝒫 ∪ 𝑆}})
31 elssuni 4904 . . . . 5 (𝑆 ∈ {𝑆, {𝒫 ∪ 𝑆}} → 𝑆 ⊆ ∪ {𝑆, {𝒫 ∪ 𝑆}})
322, 30, 313syl 19 . . . 4 ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ⊆ ∪ {𝑆, {𝒫 ∪ 𝑆}})
33 unitg 23340 . . . . . . 7 ({𝑆, {𝒫 ∪ 𝑆}} ∈ V → ∪ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) = ∪ {𝑆, {𝒫 ∪ 𝑆}})
3423, 33ax-mp 5 . . . . . 6 ∪ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) = ∪ {𝑆, {𝒫 ∪ 𝑆}}
3534eqcomi 2772 . . . . 5 ∪ {𝑆, {𝒫 ∪ 𝑆}} = ∪ (topGen‘{𝑆, {𝒫 ∪ 𝑆}})
3635iscld2 23401 . . . 4 (((topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Top ∧ 𝑆 ⊆ ∪ {𝑆, {𝒫 ∪ 𝑆}}) → (𝑆 ∈ (Clsd‘(topGen‘{𝑆, {𝒫 ∪ 𝑆}})) ↔ (∪ {𝑆, {𝒫 ∪ 𝑆}} ∖ 𝑆) ∈ (topGen‘{𝑆, {𝒫 ∪ 𝑆}})))
375, 32, 36syl2anc 596 . . 3 ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑆 ∈ (Clsd‘(topGen‘{𝑆, {𝒫 ∪ 𝑆}})) ↔ (∪ {𝑆, {𝒫 ∪ 𝑆}} ∖ 𝑆) ∈ (topGen‘{𝑆, {𝒫 ∪ 𝑆}})))
3829, 37mpbird 260 . 2 ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ∈ (Clsd‘(topGen‘{𝑆, {𝒫 ∪ 𝑆}})))
39 f1oi 6894 . . 3 ( I ↾ 𝑆):𝑆⟶1-1onto𝑆
4039a1i 11 . 2 ((𝜑 ∧ 𝑥 ∈ 𝐼) → ( I ↾ 𝑆):𝑆⟶1-1onto𝑆)
41 elssuni 4904 . . . . 5 ({𝒫 ∪ 𝑆} ∈ {𝑆, {𝒫 ∪ 𝑆}} → {𝒫 ∪ 𝑆} ⊆ ∪ {𝑆, {𝒫 ∪ 𝑆}})
4226, 41mp1i 14 . . . 4 ((𝜑 ∧ 𝑥 ∈ 𝐼) → {𝒫 ∪ 𝑆} ⊆ ∪ {𝑆, {𝒫 ∪ 𝑆}})
43 uniexg 7789 . . . . 5 (𝑆 ∈ 𝑉 → ∪ 𝑆 ∈ V)
44 pwexg 5347 . . . . 5 (∪ 𝑆 ∈ V → 𝒫 ∪ 𝑆 ∈ V)
45 snidg 4622 . . . . 5 (𝒫 ∪ 𝑆 ∈ V → 𝒫 ∪ 𝑆 ∈ {𝒫 ∪ 𝑆})
462, 43, 44, 454syl 20 . . . 4 ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝒫 ∪ 𝑆 ∈ {𝒫 ∪ 𝑆})
4742, 46sseldd 3914 . . 3 ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝒫 ∪ 𝑆 ∈ ∪ {𝑆, {𝒫 ∪ 𝑆}})
4847, 34eleqtrrdi 2875 . 2 ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝒫 ∪ 𝑆 ∈ ∪ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}))
49 kelac2.k . 2 (𝜑 → (∏t‘(𝑥 ∈ 𝐼 ↦ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}))) ∈ Comp)
501, 5, 38, 40, 48, 49kelac1 44331 1 (𝜑 → X𝑥 ∈ 𝐼 𝑆 ≠ ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048   ∩ cin 4092   ∪ cun 4152  ∅c0 4281  𝒫 cpw 4560  {csn 4588  {cpr 4590  ∪ cuni 4872   ↦ cmpt 5192   I cid 5552   ↾ cres 5660  ⟶1-1ontowf1o 6565  ‘cfv 6566  Xcixp 8963  topGenctg 17658  ∏tcpt 17659  Topctop 23266  Clsdccld 23389  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-int 4913  df-iun 4958  df-iin 4959  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-ixp 8964  df-en 9012  df-dom 9013  df-fin 9015  df-fi 9440  df-topgen 17664  df-pt 17665  df-top 23267  df-bases 23319  df-cld 23392  df-cmp 23760
This theorem is used by:  dfac21  44334
  Copyright terms: Public domain W3C validator