Theorem dfac14lem 23607

Description: Lemma for dfac14 23608. 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 23606 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 2810	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑧 → (𝑃 ∈ 𝑦 ↔ 𝑃 ∈ 𝑧))
2		eqeq1 2730	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑧 → (𝑦 = (𝑆 ∪ {𝑃}) ↔ 𝑧 = (𝑆 ∪ {𝑃})))
3	1, 2	imbi12d 343	. . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → ((𝑃 ∈ 𝑦 → 𝑦 = (𝑆 ∪ {𝑃})) ↔ (𝑃 ∈ 𝑧 → 𝑧 = (𝑆 ∪ {𝑃}))))
4		dfac14lem.r	. . . . . . . . . 10 ⊢ 𝑅 = {𝑦 ∈ 𝒫 (𝑆 ∪ {𝑃}) ∣ (𝑃 ∈ 𝑦 → 𝑦 = (𝑆 ∪ {𝑃}))}
5	3, 4	elrab2 3684	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝑅 ↔ (𝑧 ∈ 𝒫 (𝑆 ∪ {𝑃}) ∧ (𝑃 ∈ 𝑧 → 𝑧 = (𝑆 ∪ {𝑃}))))
6		dfac14lem.0	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ≠ ∅)
7	6	adantr 479	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐼) ∧ 𝑧 ∈ 𝒫 (𝑆 ∪ {𝑃})) → 𝑆 ≠ ∅)
8		ineq1 4204	. . . . . . . . . . . . . 14 ⊢ (𝑧 = (𝑆 ∪ {𝑃}) → (𝑧 ∩ 𝑆) = ((𝑆 ∪ {𝑃}) ∩ 𝑆))
9		ssun1 4171	. . . . . . . . . . . . . . 15 ⊢ 𝑆 ⊆ (𝑆 ∪ {𝑃})
10		sseqin2 4214	. . . . . . . . . . . . . . 15 ⊢ (𝑆 ⊆ (𝑆 ∪ {𝑃}) ↔ ((𝑆 ∪ {𝑃}) ∩ 𝑆) = 𝑆)
11	9, 10	mpbi 229	. . . . . . . . . . . . . 14 ⊢ ((𝑆 ∪ {𝑃}) ∩ 𝑆) = 𝑆
12	8, 11	eqtrdi 2782	. . . . . . . . . . . . 13 ⊢ (𝑧 = (𝑆 ∪ {𝑃}) → (𝑧 ∩ 𝑆) = 𝑆)
13	12	neeq1d 2990	. . . . . . . . . . . 12 ⊢ (𝑧 = (𝑆 ∪ {𝑃}) → ((𝑧 ∩ 𝑆) ≠ ∅ ↔ 𝑆 ≠ ∅))
14	7, 13	syl5ibrcom 246	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐼) ∧ 𝑧 ∈ 𝒫 (𝑆 ∪ {𝑃})) → (𝑧 = (𝑆 ∪ {𝑃}) → (𝑧 ∩ 𝑆) ≠ ∅))
15	14	imim2d 57	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐼) ∧ 𝑧 ∈ 𝒫 (𝑆 ∪ {𝑃})) → ((𝑃 ∈ 𝑧 → 𝑧 = (𝑆 ∪ {𝑃})) → (𝑃 ∈ 𝑧 → (𝑧 ∩ 𝑆) ≠ ∅)))
16	15	expimpd 452	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ((𝑧 ∈ 𝒫 (𝑆 ∪ {𝑃}) ∧ (𝑃 ∈ 𝑧 → 𝑧 = (𝑆 ∪ {𝑃}))) → (𝑃 ∈ 𝑧 → (𝑧 ∩ 𝑆) ≠ ∅)))
17	5, 16	biimtrid 241	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑧 ∈ 𝑅 → (𝑃 ∈ 𝑧 → (𝑧 ∩ 𝑆) ≠ ∅)))
18	17	ralrimiv 3135	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ∀𝑧 ∈ 𝑅 (𝑃 ∈ 𝑧 → (𝑧 ∩ 𝑆) ≠ ∅))
19		dfac14lem.s	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ∈ 𝑊)
20		snex 5428	. . . . . . . . . . . 12 ⊢ {𝑃} ∈ V
21		unexg 7747	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ 𝑊 ∧ {𝑃} ∈ V) → (𝑆 ∪ {𝑃}) ∈ V)
22	19, 20, 21	sylancl 584	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑆 ∪ {𝑃}) ∈ V)
23		ssun2 4172	. . . . . . . . . . . 12 ⊢ {𝑃} ⊆ (𝑆 ∪ {𝑃})
24		dfac14lem.p	. . . . . . . . . . . . . 14 ⊢ 𝑃 = 𝒫 ∪ 𝑆
25		uniexg 7741	. . . . . . . . . . . . . . 15 ⊢ (𝑆 ∈ 𝑊 → ∪ 𝑆 ∈ V)
26		pwexg 5373	. . . . . . . . . . . . . . 15 ⊢ (∪ 𝑆 ∈ V → 𝒫 ∪ 𝑆 ∈ V)
27	19, 25, 26	3syl 18	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝒫 ∪ 𝑆 ∈ V)
28	24, 27	eqeltrid 2830	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑃 ∈ V)
29		snidg 4658	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ V → 𝑃 ∈ {𝑃})
30	28, 29	syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑃 ∈ {𝑃})
31	23, 30	sselid 3977	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑃 ∈ (𝑆 ∪ {𝑃}))
32		epttop 22998	. . . . . . . . . . 11 ⊢ (((𝑆 ∪ {𝑃}) ∈ V ∧ 𝑃 ∈ (𝑆 ∪ {𝑃})) → {𝑦 ∈ 𝒫 (𝑆 ∪ {𝑃}) ∣ (𝑃 ∈ 𝑦 → 𝑦 = (𝑆 ∪ {𝑃}))} ∈ (TopOn‘(𝑆 ∪ {𝑃})))
33	22, 31, 32	syl2anc 582	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → {𝑦 ∈ 𝒫 (𝑆 ∪ {𝑃}) ∣ (𝑃 ∈ 𝑦 → 𝑦 = (𝑆 ∪ {𝑃}))} ∈ (TopOn‘(𝑆 ∪ {𝑃})))
34	4, 33	eqeltrid 2830	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑅 ∈ (TopOn‘(𝑆 ∪ {𝑃})))
35		topontop 22901	. . . . . . . . 9 ⊢ (𝑅 ∈ (TopOn‘(𝑆 ∪ {𝑃})) → 𝑅 ∈ Top)
36	34, 35	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑅 ∈ Top)
37		toponuni 22902	. . . . . . . . . 10 ⊢ (𝑅 ∈ (TopOn‘(𝑆 ∪ {𝑃})) → (𝑆 ∪ {𝑃}) = ∪ 𝑅)
38	34, 37	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑆 ∪ {𝑃}) = ∪ 𝑅)
39	9, 38	sseqtrid 4032	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑆 ⊆ ∪ 𝑅)
40	31, 38	eleqtrd 2828	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑃 ∈ ∪ 𝑅)
41		eqid 2726	. . . . . . . . 9 ⊢ ∪ 𝑅 = ∪ 𝑅
42	41	elcls 23063	. . . . . . . 8 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ⊆ ∪ 𝑅 ∧ 𝑃 ∈ ∪ 𝑅) → (𝑃 ∈ ((cls‘𝑅)‘𝑆) ↔ ∀𝑧 ∈ 𝑅 (𝑃 ∈ 𝑧 → (𝑧 ∩ 𝑆) ≠ ∅)))
43	36, 39, 40, 42	syl3anc 1368	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑃 ∈ ((cls‘𝑅)‘𝑆) ↔ ∀𝑧 ∈ 𝑅 (𝑃 ∈ 𝑧 → (𝑧 ∩ 𝑆) ≠ ∅)))
44	18, 43	mpbird 256	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑃 ∈ ((cls‘𝑅)‘𝑆))
45	44	ralrimiva 3136	. . . . 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 256	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ 𝑃) ∈ X𝑥 ∈ 𝐼 ((cls‘𝑅)‘𝑆))
50	49	ne0d 4336	. . 3 ⊢ (𝜑 → X𝑥 ∈ 𝐼 ((cls‘𝑅)‘𝑆) ≠ ∅)
51		dfac14lem.c	. . 3 ⊢ (𝜑 → ((cls‘𝐽)‘X𝑥 ∈ 𝐼 𝑆) = X𝑥 ∈ 𝐼 ((cls‘𝑅)‘𝑆))
52	34	ralrimiva 3136	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 𝑅 ∈ (TopOn‘(𝑆 ∪ {𝑃})))
53		dfac14lem.j	. . . . . 6 ⊢ 𝐽 = (∏t‘(𝑥 ∈ 𝐼 ↦ 𝑅))
54	53	pttopon 23586	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐼 𝑅 ∈ (TopOn‘(𝑆 ∪ {𝑃}))) → 𝐽 ∈ (TopOn‘X𝑥 ∈ 𝐼 (𝑆 ∪ {𝑃})))
55	46, 52, 54	syl2anc 582	. . . 4 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘X𝑥 ∈ 𝐼 (𝑆 ∪ {𝑃})))
56		topontop 22901	. . . 4 ⊢ (𝐽 ∈ (TopOn‘X𝑥 ∈ 𝐼 (𝑆 ∪ {𝑃})) → 𝐽 ∈ Top)
57		cls0 23070	. . . 4 ⊢ (𝐽 ∈ Top → ((cls‘𝐽)‘∅) = ∅)
58	55, 56, 57	3syl 18	. . 3 ⊢ (𝜑 → ((cls‘𝐽)‘∅) = ∅)
59	50, 51, 58	3netr4d 3008	. 2 ⊢ (𝜑 → ((cls‘𝐽)‘X𝑥 ∈ 𝐼 𝑆) ≠ ((cls‘𝐽)‘∅))
60		fveq2 6891	. . 3 ⊢ (X𝑥 ∈ 𝐼 𝑆 = ∅ → ((cls‘𝐽)‘X𝑥 ∈ 𝐼 𝑆) = ((cls‘𝐽)‘∅))
61	60	necon3i 2963	. 2 ⊢ (((cls‘𝐽)‘X𝑥 ∈ 𝐼 𝑆) ≠ ((cls‘𝐽)‘∅) → X𝑥 ∈ 𝐼 𝑆 ≠ ∅)
62	59, 61	syl 17	1 ⊢ (𝜑 → X𝑥 ∈ 𝐼 𝑆 ≠ ∅)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   = wceq 1534   ∈ wcel 2099   ≠ wne 2930  ∀wral 3051  {crab 3420  Vcvv 3463   ∪ cun 3945   ∩ cin 3946   ⊆ wss 3947  ∅c0 4323  𝒫 cpw 4598  {csn 4624  ∪ cuni 4906   ↦ cmpt 5227  ‘cfv 6544  Xcixp 8916  ∏_tcpt 17446  Topctop 22881  TopOnctopon 22898  clsccl 23008

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2697  ax-rep 5281  ax-sep 5295  ax-nul 5302  ax-pow 5360  ax-pr 5424  ax-un 7736

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2704  df-cleq 2718  df-clel 2803  df-nfc 2878  df-ne 2931  df-ral 3052  df-rex 3061  df-reu 3366  df-rab 3421  df-v 3465  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3967  df-nul 4324  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4907  df-int 4948  df-iun 4996  df-iin 4997  df-br 5145  df-opab 5207  df-mpt 5228  df-tr 5262  df-id 5571  df-eprel 5577  df-po 5585  df-so 5586  df-fr 5628  df-we 5630  df-xp 5679  df-rel 5680  df-cnv 5681  df-co 5682  df-dm 5683  df-rn 5684  df-res 5685  df-ima 5686  df-ord 6369  df-on 6370  df-lim 6371  df-suc 6372  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-om 7867  df-1o 8486  df-2o 8487  df-ixp 8917  df-en 8965  df-fin 8968  df-fi 9445  df-topgen 17451  df-pt 17452  df-top 22882  df-topon 22899  df-bases 22935  df-cld 23009  df-ntr 23010  df-cls 23011

This theorem is referenced by:  dfac14  23608