Theorem kelac2 43089

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

Step	Hyp	Ref	Expression
1		kelac2.z	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ≠ ∅)
2		kelac2.s	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ∈ 𝑉)
3		kelac2lem 43088	. . 3 ⊢ (𝑆 ∈ 𝑉 → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Comp)
4		cmptop 23333	. . 3 ⊢ ((topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Comp → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Top)
5	2, 3, 4	3syl 18	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Top)
6		uncom 4133	. . . . . . 7 ⊢ (𝑆 ∪ {𝒫 ∪ 𝑆}) = ({𝒫 ∪ 𝑆} ∪ 𝑆)
7	6	difeq1i 4097	. . . . . 6 ⊢ ((𝑆 ∪ {𝒫 ∪ 𝑆}) ∖ 𝑆) = (({𝒫 ∪ 𝑆} ∪ 𝑆) ∖ 𝑆)
8		difun2 4456	. . . . . 6 ⊢ (({𝒫 ∪ 𝑆} ∪ 𝑆) ∖ 𝑆) = ({𝒫 ∪ 𝑆} ∖ 𝑆)
9	7, 8	eqtri 2758	. . . . 5 ⊢ ((𝑆 ∪ {𝒫 ∪ 𝑆}) ∖ 𝑆) = ({𝒫 ∪ 𝑆} ∖ 𝑆)
10		snex 5406	. . . . . . 7 ⊢ {𝒫 ∪ 𝑆} ∈ V
11		uniprg 4899	. . . . . . 7 ⊢ ((𝑆 ∈ 𝑉 ∧ {𝒫 ∪ 𝑆} ∈ V) → ∪ {𝑆, {𝒫 ∪ 𝑆}} = (𝑆 ∪ {𝒫 ∪ 𝑆}))
12	2, 10, 11	sylancl 586	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ∪ {𝑆, {𝒫 ∪ 𝑆}} = (𝑆 ∪ {𝒫 ∪ 𝑆}))
13	12	difeq1d 4100	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (∪ {𝑆, {𝒫 ∪ 𝑆}} ∖ 𝑆) = ((𝑆 ∪ {𝒫 ∪ 𝑆}) ∖ 𝑆))
14		incom 4184	. . . . . . 7 ⊢ ({𝒫 ∪ 𝑆} ∩ 𝑆) = (𝑆 ∩ {𝒫 ∪ 𝑆})
15		pwuninel 8274	. . . . . . . . 9 ⊢ ¬ 𝒫 ∪ 𝑆 ∈ 𝑆
16	15	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ¬ 𝒫 ∪ 𝑆 ∈ 𝑆)
17		disjsn 4687	. . . . . . . 8 ⊢ ((𝑆 ∩ {𝒫 ∪ 𝑆}) = ∅ ↔ ¬ 𝒫 ∪ 𝑆 ∈ 𝑆)
18	16, 17	sylibr 234	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑆 ∩ {𝒫 ∪ 𝑆}) = ∅)
19	14, 18	eqtrid 2782	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ({𝒫 ∪ 𝑆} ∩ 𝑆) = ∅)
20		disj3 4429	. . . . . 6 ⊢ (({𝒫 ∪ 𝑆} ∩ 𝑆) = ∅ ↔ {𝒫 ∪ 𝑆} = ({𝒫 ∪ 𝑆} ∖ 𝑆))
21	19, 20	sylib 218	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → {𝒫 ∪ 𝑆} = ({𝒫 ∪ 𝑆} ∖ 𝑆))
22	9, 13, 21	3eqtr4a 2796	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (∪ {𝑆, {𝒫 ∪ 𝑆}} ∖ 𝑆) = {𝒫 ∪ 𝑆})
23		prex 5407	. . . . . 6 ⊢ {𝑆, {𝒫 ∪ 𝑆}} ∈ V
24		bastg 22904	. . . . . 6 ⊢ ({𝑆, {𝒫 ∪ 𝑆}} ∈ V → {𝑆, {𝒫 ∪ 𝑆}} ⊆ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}))
25	23, 24	mp1i 13	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → {𝑆, {𝒫 ∪ 𝑆}} ⊆ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}))
26	10	prid2 4739	. . . . . 6 ⊢ {𝒫 ∪ 𝑆} ∈ {𝑆, {𝒫 ∪ 𝑆}}
27	26	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → {𝒫 ∪ 𝑆} ∈ {𝑆, {𝒫 ∪ 𝑆}})
28	25, 27	sseldd 3959	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → {𝒫 ∪ 𝑆} ∈ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}))
29	22, 28	eqeltrd 2834	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (∪ {𝑆, {𝒫 ∪ 𝑆}} ∖ 𝑆) ∈ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}))
30		prid1g 4736	. . . . 5 ⊢ (𝑆 ∈ 𝑉 → 𝑆 ∈ {𝑆, {𝒫 ∪ 𝑆}})
31		elssuni 4913	. . . . 5 ⊢ (𝑆 ∈ {𝑆, {𝒫 ∪ 𝑆}} → 𝑆 ⊆ ∪ {𝑆, {𝒫 ∪ 𝑆}})
32	2, 30, 31	3syl 18	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ⊆ ∪ {𝑆, {𝒫 ∪ 𝑆}})
33		unitg 22905	. . . . . . 7 ⊢ ({𝑆, {𝒫 ∪ 𝑆}} ∈ V → ∪ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) = ∪ {𝑆, {𝒫 ∪ 𝑆}})
34	23, 33	ax-mp 5	. . . . . 6 ⊢ ∪ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}) = ∪ {𝑆, {𝒫 ∪ 𝑆}}
35	34	eqcomi 2744	. . . . 5 ⊢ ∪ {𝑆, {𝒫 ∪ 𝑆}} = ∪ (topGen‘{𝑆, {𝒫 ∪ 𝑆}})
36	35	iscld2 22966	. . . 4 ⊢ (((topGen‘{𝑆, {𝒫 ∪ 𝑆}}) ∈ Top ∧ 𝑆 ⊆ ∪ {𝑆, {𝒫 ∪ 𝑆}}) → (𝑆 ∈ (Clsd‘(topGen‘{𝑆, {𝒫 ∪ 𝑆}})) ↔ (∪ {𝑆, {𝒫 ∪ 𝑆}} ∖ 𝑆) ∈ (topGen‘{𝑆, {𝒫 ∪ 𝑆}})))
37	5, 32, 36	syl2anc 584	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑆 ∈ (Clsd‘(topGen‘{𝑆, {𝒫 ∪ 𝑆}})) ↔ (∪ {𝑆, {𝒫 ∪ 𝑆}} ∖ 𝑆) ∈ (topGen‘{𝑆, {𝒫 ∪ 𝑆}})))
38	29, 37	mpbird 257	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ∈ (Clsd‘(topGen‘{𝑆, {𝒫 ∪ 𝑆}})))
39		f1oi 6856	. . 3 ⊢ ( I ↾ 𝑆):𝑆–1-1-onto→𝑆
40	39	a1i 11	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ( I ↾ 𝑆):𝑆–1-1-onto→𝑆)
41		elssuni 4913	. . . . 5 ⊢ ({𝒫 ∪ 𝑆} ∈ {𝑆, {𝒫 ∪ 𝑆}} → {𝒫 ∪ 𝑆} ⊆ ∪ {𝑆, {𝒫 ∪ 𝑆}})
42	26, 41	mp1i 13	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → {𝒫 ∪ 𝑆} ⊆ ∪ {𝑆, {𝒫 ∪ 𝑆}})
43		uniexg 7734	. . . . 5 ⊢ (𝑆 ∈ 𝑉 → ∪ 𝑆 ∈ V)
44		pwexg 5348	. . . . 5 ⊢ (∪ 𝑆 ∈ V → 𝒫 ∪ 𝑆 ∈ V)
45		snidg 4636	. . . . 5 ⊢ (𝒫 ∪ 𝑆 ∈ V → 𝒫 ∪ 𝑆 ∈ {𝒫 ∪ 𝑆})
46	2, 43, 44, 45	4syl 19	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝒫 ∪ 𝑆 ∈ {𝒫 ∪ 𝑆})
47	42, 46	sseldd 3959	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝒫 ∪ 𝑆 ∈ ∪ {𝑆, {𝒫 ∪ 𝑆}})
48	47, 34	eleqtrrdi 2845	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝒫 ∪ 𝑆 ∈ ∪ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}))
49		kelac2.k	. 2 ⊢ (𝜑 → (∏t‘(𝑥 ∈ 𝐼 ↦ (topGen‘{𝑆, {𝒫 ∪ 𝑆}}))) ∈ Comp)
50	1, 5, 38, 40, 48, 49	kelac1 43087	1 ⊢ (𝜑 → X𝑥 ∈ 𝐼 𝑆 ≠ ∅)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2108   ≠ wne 2932  Vcvv 3459   ∖ cdif 3923   ∪ cun 3924   ∩ cin 3925   ⊆ wss 3926  ∅c0 4308  𝒫 cpw 4575  {csn 4601  {cpr 4603  ∪ cuni 4883   ↦ cmpt 5201   I cid 5547   ↾ cres 5656  –1-1-onto→wf1o 6530  ‘cfv 6531  Xcixp 8911  topGenctg 17451  ∏_tcpt 17452  Topctop 22831  Clsdccld 22954  Compccmp 23324

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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729

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 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-int 4923  df-iun 4969  df-iin 4970  df-br 5120  df-opab 5182  df-mpt 5202  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-we 5608  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 6355  df-on 6356  df-lim 6357  df-suc 6358  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-om 7862  df-1o 8480  df-2o 8481  df-ixp 8912  df-en 8960  df-dom 8961  df-fin 8963  df-fi 9423  df-topgen 17457  df-pt 17458  df-top 22832  df-bases 22884  df-cld 22957  df-cmp 23325

This theorem is referenced by:  dfac21  43090