Theorem dfac14lem 23560

Description: Lemma for dfac14 23561. By equipping 𝑆 ∪ {𝑃} for some 𝑃 ∉ 𝑆 with the particular point topology, we can show that 𝑃 is in the closure of 𝑆; hence the sequence 𝑃(𝑥) is in the product of the closures, and we can utilize this instance of ptcls 23559 to extract an element of the closure of X𝑘 ∈ 𝐼𝑆. (Contributed by Mario Carneiro, 2-Sep-2015.)

Hypotheses

Ref	Expression
dfac14lem.i	⊢ (𝜑 → 𝐼 ∈ 𝑉)
dfac14lem.s	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ∈ 𝑊)
dfac14lem.0	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ≠ ∅)
dfac14lem.p	⊢ 𝑃 = 𝒫 ∪ 𝑆
dfac14lem.r	⊢ 𝑅 = {𝑦 ∈ 𝒫 (𝑆 ∪ {𝑃}) ∣ (𝑃 ∈ 𝑦 → 𝑦 = (𝑆 ∪ {𝑃}))}
dfac14lem.j	⊢ 𝐽 = (∏t‘(𝑥 ∈ 𝐼 ↦ 𝑅))
dfac14lem.c	⊢ (𝜑 → ((cls‘𝐽)‘X𝑥 ∈ 𝐼 𝑆) = X𝑥 ∈ 𝐼 ((cls‘𝑅)‘𝑆))

Assertion

Ref	Expression
dfac14lem	⊢ (𝜑 → X𝑥 ∈ 𝐼 𝑆 ≠ ∅)

Distinct variable groups:   𝑥,𝐼   𝑦,𝑃   𝜑,𝑥   𝑦,𝑆

Allowed substitution hints:   𝜑(𝑦)   𝑃(𝑥)   𝑅(𝑥,𝑦)   𝑆(𝑥)   𝐼(𝑦)   𝐽(𝑥,𝑦)   𝑉(𝑥,𝑦)   𝑊(𝑥,𝑦)

Proof of Theorem dfac14lem

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eleq2w 2819	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑧 → (𝑃 ∈ 𝑦 ↔ 𝑃 ∈ 𝑧))
2		eqeq1 2740	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑧 → (𝑦 = (𝑆 ∪ {𝑃}) ↔ 𝑧 = (𝑆 ∪ {𝑃})))
3	1, 2	imbi12d 344	. . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → ((𝑃 ∈ 𝑦 → 𝑦 = (𝑆 ∪ {𝑃})) ↔ (𝑃 ∈ 𝑧 → 𝑧 = (𝑆 ∪ {𝑃}))))
4		dfac14lem.r	. . . . . . . . . 10 ⊢ 𝑅 = {𝑦 ∈ 𝒫 (𝑆 ∪ {𝑃}) ∣ (𝑃 ∈ 𝑦 → 𝑦 = (𝑆 ∪ {𝑃}))}
5	3, 4	elrab2 3679	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝑅 ↔ (𝑧 ∈ 𝒫 (𝑆 ∪ {𝑃}) ∧ (𝑃 ∈ 𝑧 → 𝑧 = (𝑆 ∪ {𝑃}))))
6		dfac14lem.0	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ≠ ∅)
7	6	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐼) ∧ 𝑧 ∈ 𝒫 (𝑆 ∪ {𝑃})) → 𝑆 ≠ ∅)
8		ineq1 4193	. . . . . . . . . . . . . 14 ⊢ (𝑧 = (𝑆 ∪ {𝑃}) → (𝑧 ∩ 𝑆) = ((𝑆 ∪ {𝑃}) ∩ 𝑆))
9		ssun1 4158	. . . . . . . . . . . . . . 15 ⊢ 𝑆 ⊆ (𝑆 ∪ {𝑃})
10		sseqin2 4203	. . . . . . . . . . . . . . 15 ⊢ (𝑆 ⊆ (𝑆 ∪ {𝑃}) ↔ ((𝑆 ∪ {𝑃}) ∩ 𝑆) = 𝑆)
11	9, 10	mpbi 230	. . . . . . . . . . . . . 14 ⊢ ((𝑆 ∪ {𝑃}) ∩ 𝑆) = 𝑆
12	8, 11	eqtrdi 2787	. . . . . . . . . . . . 13 ⊢ (𝑧 = (𝑆 ∪ {𝑃}) → (𝑧 ∩ 𝑆) = 𝑆)
13	12	neeq1d 2992	. . . . . . . . . . . 12 ⊢ (𝑧 = (𝑆 ∪ {𝑃}) → ((𝑧 ∩ 𝑆) ≠ ∅ ↔ 𝑆 ≠ ∅))
14	7, 13	syl5ibrcom 247	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐼) ∧ 𝑧 ∈ 𝒫 (𝑆 ∪ {𝑃})) → (𝑧 = (𝑆 ∪ {𝑃}) → (𝑧 ∩ 𝑆) ≠ ∅))
15	14	imim2d 57	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐼) ∧ 𝑧 ∈ 𝒫 (𝑆 ∪ {𝑃})) → ((𝑃 ∈ 𝑧 → 𝑧 = (𝑆 ∪ {𝑃})) → (𝑃 ∈ 𝑧 → (𝑧 ∩ 𝑆) ≠ ∅)))
16	15	expimpd 453	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ((𝑧 ∈ 𝒫 (𝑆 ∪ {𝑃}) ∧ (𝑃 ∈ 𝑧 → 𝑧 = (𝑆 ∪ {𝑃}))) → (𝑃 ∈ 𝑧 → (𝑧 ∩ 𝑆) ≠ ∅)))
17	5, 16	biimtrid 242	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑧 ∈ 𝑅 → (𝑃 ∈ 𝑧 → (𝑧 ∩ 𝑆) ≠ ∅)))
18	17	ralrimiv 3132	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ∀𝑧 ∈ 𝑅 (𝑃 ∈ 𝑧 → (𝑧 ∩ 𝑆) ≠ ∅))
19		dfac14lem.s	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ∈ 𝑊)
20		snex 5411	. . . . . . . . . . . 12 ⊢ {𝑃} ∈ V
21		unexg 7742	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ 𝑊 ∧ {𝑃} ∈ V) → (𝑆 ∪ {𝑃}) ∈ V)
22	19, 20, 21	sylancl 586	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑆 ∪ {𝑃}) ∈ V)
23		ssun2 4159	. . . . . . . . . . . 12 ⊢ {𝑃} ⊆ (𝑆 ∪ {𝑃})
24		dfac14lem.p	. . . . . . . . . . . . . 14 ⊢ 𝑃 = 𝒫 ∪ 𝑆
25		uniexg 7739	. . . . . . . . . . . . . . 15 ⊢ (𝑆 ∈ 𝑊 → ∪ 𝑆 ∈ V)
26		pwexg 5353	. . . . . . . . . . . . . . 15 ⊢ (∪ 𝑆 ∈ V → 𝒫 ∪ 𝑆 ∈ V)
27	19, 25, 26	3syl 18	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝒫 ∪ 𝑆 ∈ V)
28	24, 27	eqeltrid 2839	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑃 ∈ V)
29		snidg 4641	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ V → 𝑃 ∈ {𝑃})
30	28, 29	syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑃 ∈ {𝑃})
31	23, 30	sselid 3961	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑃 ∈ (𝑆 ∪ {𝑃}))
32		epttop 22952	. . . . . . . . . . 11 ⊢ (((𝑆 ∪ {𝑃}) ∈ V ∧ 𝑃 ∈ (𝑆 ∪ {𝑃})) → {𝑦 ∈ 𝒫 (𝑆 ∪ {𝑃}) ∣ (𝑃 ∈ 𝑦 → 𝑦 = (𝑆 ∪ {𝑃}))} ∈ (TopOn‘(𝑆 ∪ {𝑃})))
33	22, 31, 32	syl2anc 584	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → {𝑦 ∈ 𝒫 (𝑆 ∪ {𝑃}) ∣ (𝑃 ∈ 𝑦 → 𝑦 = (𝑆 ∪ {𝑃}))} ∈ (TopOn‘(𝑆 ∪ {𝑃})))
34	4, 33	eqeltrid 2839	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑅 ∈ (TopOn‘(𝑆 ∪ {𝑃})))
35		topontop 22856	. . . . . . . . 9 ⊢ (𝑅 ∈ (TopOn‘(𝑆 ∪ {𝑃})) → 𝑅 ∈ Top)
36	34, 35	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑅 ∈ Top)
37		toponuni 22857	. . . . . . . . . 10 ⊢ (𝑅 ∈ (TopOn‘(𝑆 ∪ {𝑃})) → (𝑆 ∪ {𝑃}) = ∪ 𝑅)
38	34, 37	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑆 ∪ {𝑃}) = ∪ 𝑅)
39	9, 38	sseqtrid 4006	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ⊆ ∪ 𝑅)
40	31, 38	eleqtrd 2837	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑃 ∈ ∪ 𝑅)
41		eqid 2736	. . . . . . . . 9 ⊢ ∪ 𝑅 = ∪ 𝑅
42	41	elcls 23016	. . . . . . . 8 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ⊆ ∪ 𝑅 ∧ 𝑃 ∈ ∪ 𝑅) → (𝑃 ∈ ((cls‘𝑅)‘𝑆) ↔ ∀𝑧 ∈ 𝑅 (𝑃 ∈ 𝑧 → (𝑧 ∩ 𝑆) ≠ ∅)))
43	36, 39, 40, 42	syl3anc 1373	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑃 ∈ ((cls‘𝑅)‘𝑆) ↔ ∀𝑧 ∈ 𝑅 (𝑃 ∈ 𝑧 → (𝑧 ∩ 𝑆) ≠ ∅)))
44	18, 43	mpbird 257	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑃 ∈ ((cls‘𝑅)‘𝑆))
45	44	ralrimiva 3133	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 𝑃 ∈ ((cls‘𝑅)‘𝑆))
46		dfac14lem.i	. . . . . 6 ⊢ (𝜑 → 𝐼 ∈ 𝑉)
47		mptelixpg 8954	. . . . . 6 ⊢ (𝐼 ∈ 𝑉 → ((𝑥 ∈ 𝐼 ↦ 𝑃) ∈ X𝑥 ∈ 𝐼 ((cls‘𝑅)‘𝑆) ↔ ∀𝑥 ∈ 𝐼 𝑃 ∈ ((cls‘𝑅)‘𝑆)))
48	46, 47	syl 17	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ 𝐼 ↦ 𝑃) ∈ X𝑥 ∈ 𝐼 ((cls‘𝑅)‘𝑆) ↔ ∀𝑥 ∈ 𝐼 𝑃 ∈ ((cls‘𝑅)‘𝑆)))
49	45, 48	mpbird 257	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ 𝑃) ∈ X𝑥 ∈ 𝐼 ((cls‘𝑅)‘𝑆))
50	49	ne0d 4322	. . 3 ⊢ (𝜑 → X𝑥 ∈ 𝐼 ((cls‘𝑅)‘𝑆) ≠ ∅)
51		dfac14lem.c	. . 3 ⊢ (𝜑 → ((cls‘𝐽)‘X𝑥 ∈ 𝐼 𝑆) = X𝑥 ∈ 𝐼 ((cls‘𝑅)‘𝑆))
52	34	ralrimiva 3133	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 𝑅 ∈ (TopOn‘(𝑆 ∪ {𝑃})))
53		dfac14lem.j	. . . . . 6 ⊢ 𝐽 = (∏t‘(𝑥 ∈ 𝐼 ↦ 𝑅))
54	53	pttopon 23539	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐼 𝑅 ∈ (TopOn‘(𝑆 ∪ {𝑃}))) → 𝐽 ∈ (TopOn‘X𝑥 ∈ 𝐼 (𝑆 ∪ {𝑃})))
55	46, 52, 54	syl2anc 584	. . . 4 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘X𝑥 ∈ 𝐼 (𝑆 ∪ {𝑃})))
56		topontop 22856	. . . 4 ⊢ (𝐽 ∈ (TopOn‘X𝑥 ∈ 𝐼 (𝑆 ∪ {𝑃})) → 𝐽 ∈ Top)
57		cls0 23023	. . . 4 ⊢ (𝐽 ∈ Top → ((cls‘𝐽)‘∅) = ∅)
58	55, 56, 57	3syl 18	. . 3 ⊢ (𝜑 → ((cls‘𝐽)‘∅) = ∅)
59	50, 51, 58	3netr4d 3010	. 2 ⊢ (𝜑 → ((cls‘𝐽)‘X𝑥 ∈ 𝐼 𝑆) ≠ ((cls‘𝐽)‘∅))
60		fveq2 6881	. . 3 ⊢ (X𝑥 ∈ 𝐼 𝑆 = ∅ → ((cls‘𝐽)‘X𝑥 ∈ 𝐼 𝑆) = ((cls‘𝐽)‘∅))
61	60	necon3i 2965	. 2 ⊢ (((cls‘𝐽)‘X𝑥 ∈ 𝐼 𝑆) ≠ ((cls‘𝐽)‘∅) → X𝑥 ∈ 𝐼 𝑆 ≠ ∅)
62	59, 61	syl 17	1 ⊢ (𝜑 → X𝑥 ∈ 𝐼 𝑆 ≠ ∅)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109   ≠ wne 2933  ∀wral 3052  {crab 3420  Vcvv 3464   ∪ cun 3929   ∩ cin 3930   ⊆ wss 3931  ∅c0 4313  𝒫 cpw 4580  {csn 4606  ∪ cuni 4888   ↦ cmpt 5206  ‘cfv 6536  Xcixp 8916  ∏_tcpt 17457  Topctop 22836  TopOnctopon 22853  clsccl 22961

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 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-rep 5254  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734

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 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-pss 3951  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-int 4928  df-iun 4974  df-iin 4975  df-br 5125  df-opab 5187  df-mpt 5207  df-tr 5235  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-om 7867  df-1o 8485  df-2o 8486  df-ixp 8917  df-en 8965  df-fin 8968  df-fi 9428  df-topgen 17462  df-pt 17463  df-top 22837  df-topon 22854  df-bases 22889  df-cld 22962  df-ntr 22963  df-cls 22964

This theorem is referenced by:  dfac14  23561