Theorem ptval2 23828

Description: The value of the product topology function. (Contributed by Mario Carneiro, 7-Feb-2015.)

Hypotheses

Ref	Expression
ptval2.1	⊢ 𝐽 = (∏t‘𝐹)
ptval2.2	⊢ 𝑋 = ∪ 𝐽
ptval2.3	⊢ 𝐺 = (𝑘 ∈ 𝐴, 𝑢 ∈ (𝐹‘𝑘) ↦ (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝑘)) “ 𝑢))

Assertion

Ref	Expression
ptval2	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → 𝐽 = (topGen‘(fi‘({𝑋} ∪ ran 𝐺))))

Distinct variable groups:   𝑢,𝑘,𝑤,𝐴   𝑘,𝐹,𝑢,𝑤   𝑘,𝑉,𝑢,𝑤   𝑤,𝑋

Allowed substitution hints:   𝐺(𝑤, 𝑢, 𝑘)   𝐽(𝑤, 𝑢, 𝑘)   𝑋(𝑢, 𝑘)

Proof of Theorem ptval2

Dummy variables 𝑔 𝑛 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ffn 6703	. . 3 ⊢ (𝐹:𝐴⟶Top → 𝐹 Fn 𝐴)
2		ptval2.1	. . . 4 ⊢ 𝐽 = (∏t‘𝐹)
3		eqid 2760	. . . . 5 ⊢ {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}
4	3	ptval 23797	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹 Fn 𝐴) → (∏t‘𝐹) = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
5	2, 4	eqtrid 2807	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹 Fn 𝐴) → 𝐽 = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
6	1, 5	sylan2 605	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → 𝐽 = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
7		eqid 2760	. . . . 5 ⊢ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) = X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛)
8	3, 7	ptbasfi 23808	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} = (fi‘({X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛)} ∪ ran (𝑘 ∈ 𝐴, 𝑢 ∈ (𝐹‘𝑘) ↦ (◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑘)) “ 𝑢)))))
9	2	ptuni 23821	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) = ∪ 𝐽)
10		ptval2.2	. . . . . . . 8 ⊢ 𝑋 = ∪ 𝐽
11	9, 10	eqtr4di 2813	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) = 𝑋)
12	11	sneqd 4596	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → {X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛)} = {𝑋})
13	11	3ad2ant1 1151	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ 𝑘 ∈ 𝐴 ∧ 𝑢 ∈ (𝐹‘𝑘)) → X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) = 𝑋)
14	13	mpteq1d 5195	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ 𝑘 ∈ 𝐴 ∧ 𝑢 ∈ (𝐹‘𝑘)) → (𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑘)) = (𝑤 ∈ 𝑋 ↦ (𝑤‘𝑘)))
15	14	cnveqd 5855	. . . . . . . . . 10 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ 𝑘 ∈ 𝐴 ∧ 𝑢 ∈ (𝐹‘𝑘)) → ◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑘)) = ◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝑘)))
16	15	imaeq1d 6055	. . . . . . . . 9 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) ∧ 𝑘 ∈ 𝐴 ∧ 𝑢 ∈ (𝐹‘𝑘)) → (◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑘)) “ 𝑢) = (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝑘)) “ 𝑢))
17	16	mpoeq3dva 7491	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → (𝑘 ∈ 𝐴, 𝑢 ∈ (𝐹‘𝑘) ↦ (◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑘)) “ 𝑢)) = (𝑘 ∈ 𝐴, 𝑢 ∈ (𝐹‘𝑘) ↦ (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝑘)) “ 𝑢)))
18		ptval2.3	. . . . . . . 8 ⊢ 𝐺 = (𝑘 ∈ 𝐴, 𝑢 ∈ (𝐹‘𝑘) ↦ (◡(𝑤 ∈ 𝑋 ↦ (𝑤‘𝑘)) “ 𝑢))
19	17, 18	eqtr4di 2813	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → (𝑘 ∈ 𝐴, 𝑢 ∈ (𝐹‘𝑘) ↦ (◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑘)) “ 𝑢)) = 𝐺)
20	19	rneqd 5922	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → ran (𝑘 ∈ 𝐴, 𝑢 ∈ (𝐹‘𝑘) ↦ (◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑘)) “ 𝑢)) = ran 𝐺)
21	12, 20	uneq12d 4116	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → ({X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛)} ∪ ran (𝑘 ∈ 𝐴, 𝑢 ∈ (𝐹‘𝑘) ↦ (◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑘)) “ 𝑢))) = ({𝑋} ∪ ran 𝐺))
22	21	fveq2d 6883	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → (fi‘({X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛)} ∪ ran (𝑘 ∈ 𝐴, 𝑢 ∈ (𝐹‘𝑘) ↦ (◡(𝑤 ∈ X𝑛 ∈ 𝐴 ∪ (𝐹‘𝑛) ↦ (𝑤‘𝑘)) “ 𝑢)))) = (fi‘({𝑋} ∪ ran 𝐺)))
23	8, 22	eqtrd 2795	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} = (fi‘({𝑋} ∪ ran 𝐺)))
24	23	fveq2d 6883	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}) = (topGen‘(fi‘({𝑋} ∪ ran 𝐺))))
25	6, 24	eqtrd 2795	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → 𝐽 = (topGen‘(fi‘({𝑋} ∪ ran 𝐺))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145  {cab 2738  ∀wral 3076  ∃wrex 3086   ∖ cdif 3896   ∪ cun 3897  {csn 4584  ∪ cuni 4867   ↦ cmpt 5186  ^◡ccnv 5654  ran crn 5656   “ cima 5658   Fn wfn 6528  ⟶wf 6529  ‘cfv 6533   ∈ cmpo 7416  Xcixp 8905  Fincfn 8953  ficfi 9381  topGenctg 17523  ∏_tcpt 17524  Topctop 23119

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7864  df-1st 7987  df-2nd 7988  df-1o 8456  df-2o 8457  df-ixp 8906  df-en 8954  df-dom 8955  df-fin 8957  df-fi 9382  df-topgen 17529  df-pt 17530  df-top 23120  df-bases 23172

This theorem is used by:  ptrescn  23866  ptrest  38369