Theorem ptex 13494

Description: Existence of the product topology. (Contributed by Jim Kingdon, 19-Mar-2025.)

Assertion

Ref	Expression
ptex	⊢ (𝐹 ∈ 𝑉 → (∏t‘𝐹) ∈ V)

Proof of Theorem ptex

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

Step	Hyp	Ref	Expression
1		df-pt 13491	. . 3 ⊢ ∏t = (𝑓 ∈ V ↦ (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝑓 ∧ ∀𝑦 ∈ dom 𝑓(𝑔‘𝑦) ∈ (𝑓‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝑓‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝑓(𝑔‘𝑦))}))
2		dmeq 4958	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
3	2	fneq2d 5449	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑔 Fn dom 𝑓 ↔ 𝑔 Fn dom 𝐹))
4		fveq1 5671	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑦) = (𝐹‘𝑦))
5	4	eleq2d 2304	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → ((𝑔‘𝑦) ∈ (𝑓‘𝑦) ↔ (𝑔‘𝑦) ∈ (𝐹‘𝑦)))
6	2, 5	raleqbidv 2759	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (∀𝑦 ∈ dom 𝑓(𝑔‘𝑦) ∈ (𝑓‘𝑦) ↔ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦)))
7	2	difeq1d 3338	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (dom 𝑓 ∖ 𝑧) = (dom 𝐹 ∖ 𝑧))
8	4	unieqd 3927	. . . . . . . . . . 11 ⊢ (𝑓 = 𝐹 → ∪ (𝑓‘𝑦) = ∪ (𝐹‘𝑦))
9	8	eqeq2d 2246	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → ((𝑔‘𝑦) = ∪ (𝑓‘𝑦) ↔ (𝑔‘𝑦) = ∪ (𝐹‘𝑦)))
10	7, 9	raleqbidv 2759	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (∀𝑦 ∈ (dom 𝑓 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝑓‘𝑦) ↔ ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)))
11	10	rexbidv 2545	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝑓‘𝑦) ↔ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)))
12	3, 6, 11	3anbi123d 1349	. . . . . . 7 ⊢ (𝑓 = 𝐹 → ((𝑔 Fn dom 𝑓 ∧ ∀𝑦 ∈ dom 𝑓(𝑔‘𝑦) ∈ (𝑓‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝑓‘𝑦)) ↔ (𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦))))
13	2	ixpeq1d 6947	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → X𝑦 ∈ dom 𝑓(𝑔‘𝑦) = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))
14	13	eqeq2d 2246	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑥 = X𝑦 ∈ dom 𝑓(𝑔‘𝑦) ↔ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦)))
15	12, 14	anbi12d 473	. . . . . 6 ⊢ (𝑓 = 𝐹 → (((𝑔 Fn dom 𝑓 ∧ ∀𝑦 ∈ dom 𝑓(𝑔‘𝑦) ∈ (𝑓‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝑓‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝑓(𝑔‘𝑦)) ↔ ((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))))
16	15	exbidv 1874	. . . . 5 ⊢ (𝑓 = 𝐹 → (∃𝑔((𝑔 Fn dom 𝑓 ∧ ∀𝑦 ∈ dom 𝑓(𝑔‘𝑦) ∈ (𝑓‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝑓‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝑓(𝑔‘𝑦)) ↔ ∃𝑔((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))))
17	16	abbidv 2354	. . . 4 ⊢ (𝑓 = 𝐹 → {𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝑓 ∧ ∀𝑦 ∈ dom 𝑓(𝑔‘𝑦) ∈ (𝑓‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝑓‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝑓(𝑔‘𝑦))} = {𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))})
18	17	fveq2d 5676	. . 3 ⊢ (𝑓 = 𝐹 → (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝑓 ∧ ∀𝑦 ∈ dom 𝑓(𝑔‘𝑦) ∈ (𝑓‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝑓‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝑓(𝑔‘𝑦))}) = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))}))
19		elex 2827	. . 3 ⊢ (𝐹 ∈ 𝑉 → 𝐹 ∈ V)
20		dmexg 5023	. . . . . . . . . 10 ⊢ (𝐹 ∈ 𝑉 → dom 𝐹 ∈ V)
21		vex 2818	. . . . . . . . . . . . 13 ⊢ 𝑔 ∈ V
22		vex 2818	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
23	21, 22	fvex 5692	. . . . . . . . . . . 12 ⊢ (𝑔‘𝑦) ∈ V
24	23	a1i 9	. . . . . . . . . . 11 ⊢ (𝐹 ∈ 𝑉 → (𝑔‘𝑦) ∈ V)
25	24	ralrimivw 2618	. . . . . . . . . 10 ⊢ (𝐹 ∈ 𝑉 → ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ V)
26		ixpexgg 6959	. . . . . . . . . 10 ⊢ ((dom 𝐹 ∈ V ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ V) → X𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ V)
27	20, 25, 26	syl2anc 411	. . . . . . . . 9 ⊢ (𝐹 ∈ 𝑉 → X𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ V)
28	27	ralrimivw 2618	. . . . . . . 8 ⊢ (𝐹 ∈ 𝑉 → ∀𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)X𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ V)
29		dfiun2g 4025	. . . . . . . 8 ⊢ (∀𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)X𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ V → ∪ 𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)X𝑦 ∈ dom 𝐹(𝑔‘𝑦) = ∪ {𝑥 ∣ ∃𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦)})
30	28, 29	syl 14	. . . . . . 7 ⊢ (𝐹 ∈ 𝑉 → ∪ 𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)X𝑦 ∈ dom 𝐹(𝑔‘𝑦) = ∪ {𝑥 ∣ ∃𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦)})
31		rnexg 5024	. . . . . . . . . 10 ⊢ (𝐹 ∈ 𝑉 → ran 𝐹 ∈ V)
32	31	uniexd 4563	. . . . . . . . 9 ⊢ (𝐹 ∈ 𝑉 → ∪ ran 𝐹 ∈ V)
33		mapvalg 6894	. . . . . . . . . 10 ⊢ ((∪ ran 𝐹 ∈ V ∧ dom 𝐹 ∈ V) → (∪ ran 𝐹 ↑𝑚 dom 𝐹) = {𝑔 ∣ 𝑔:dom 𝐹⟶∪ ran 𝐹})
34		mapex 6890	. . . . . . . . . . 11 ⊢ ((dom 𝐹 ∈ V ∧ ∪ ran 𝐹 ∈ V) → {𝑔 ∣ 𝑔:dom 𝐹⟶∪ ran 𝐹} ∈ V)
35	34	ancoms 268	. . . . . . . . . 10 ⊢ ((∪ ran 𝐹 ∈ V ∧ dom 𝐹 ∈ V) → {𝑔 ∣ 𝑔:dom 𝐹⟶∪ ran 𝐹} ∈ V)
36	33, 35	eqeltrd 2311	. . . . . . . . 9 ⊢ ((∪ ran 𝐹 ∈ V ∧ dom 𝐹 ∈ V) → (∪ ran 𝐹 ↑𝑚 dom 𝐹) ∈ V)
37	32, 20, 36	syl2anc 411	. . . . . . . 8 ⊢ (𝐹 ∈ 𝑉 → (∪ ran 𝐹 ↑𝑚 dom 𝐹) ∈ V)
38		iunexg 6314	. . . . . . . 8 ⊢ (((∪ ran 𝐹 ↑𝑚 dom 𝐹) ∈ V ∧ ∀𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)X𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ V) → ∪ 𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)X𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ V)
39	37, 28, 38	syl2anc 411	. . . . . . 7 ⊢ (𝐹 ∈ 𝑉 → ∪ 𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)X𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ V)
40	30, 39	eqeltrrd 2312	. . . . . 6 ⊢ (𝐹 ∈ 𝑉 → ∪ {𝑥 ∣ ∃𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦)} ∈ V)
41		uniexb 4596	. . . . . 6 ⊢ ({𝑥 ∣ ∃𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦)} ∈ V ↔ ∪ {𝑥 ∣ ∃𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦)} ∈ V)
42	40, 41	sylibr 134	. . . . 5 ⊢ (𝐹 ∈ 𝑉 → {𝑥 ∣ ∃𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦)} ∈ V)
43		simp1 1024	. . . . . . . . . . 11 ⊢ ((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) → 𝑔 Fn dom 𝐹)
44		fvssunirng 5687	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ V → (𝐹‘𝑦) ⊆ ∪ ran 𝐹)
45	44	elv 2819	. . . . . . . . . . . . . 14 ⊢ (𝐹‘𝑦) ⊆ ∪ ran 𝐹
46	45	sseli 3236	. . . . . . . . . . . . 13 ⊢ ((𝑔‘𝑦) ∈ (𝐹‘𝑦) → (𝑔‘𝑦) ∈ ∪ ran 𝐹)
47	46	ralimi 2607	. . . . . . . . . . . 12 ⊢ (∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) → ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ ∪ ran 𝐹)
48	47	3ad2ant2 1046	. . . . . . . . . . 11 ⊢ ((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) → ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ ∪ ran 𝐹)
49		ffnfv 5837	. . . . . . . . . . 11 ⊢ (𝑔:dom 𝐹⟶∪ ran 𝐹 ↔ (𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ ∪ ran 𝐹))
50	43, 48, 49	sylanbrc 417	. . . . . . . . . 10 ⊢ ((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) → 𝑔:dom 𝐹⟶∪ ran 𝐹)
51	32, 20	elmapd 6898	. . . . . . . . . 10 ⊢ (𝐹 ∈ 𝑉 → (𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹) ↔ 𝑔:dom 𝐹⟶∪ ran 𝐹))
52	50, 51	imbitrrid 156	. . . . . . . . 9 ⊢ (𝐹 ∈ 𝑉 → ((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) → 𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)))
53	52	anim1d 336	. . . . . . . 8 ⊢ (𝐹 ∈ 𝑉 → (((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦)) → (𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))))
54	53	eximdv 1929	. . . . . . 7 ⊢ (𝐹 ∈ 𝑉 → (∃𝑔((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦)) → ∃𝑔(𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))))
55		df-rex 2528	. . . . . . 7 ⊢ (∃𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦) ↔ ∃𝑔(𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦)))
56	54, 55	imbitrrdi 162	. . . . . 6 ⊢ (𝐹 ∈ 𝑉 → (∃𝑔((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦)) → ∃𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦)))
57	56	ss2abdv 3313	. . . . 5 ⊢ (𝐹 ∈ 𝑉 → {𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))} ⊆ {𝑥 ∣ ∃𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦)})
58	42, 57	ssexd 4252	. . . 4 ⊢ (𝐹 ∈ 𝑉 → {𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))} ∈ V)
59		tgvalex 13493	. . . 4 ⊢ ({𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))} ∈ V → (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))}) ∈ V)
60	58, 59	syl 14	. . 3 ⊢ (𝐹 ∈ 𝑉 → (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))}) ∈ V)
61	1, 18, 19, 60	fvmptd3 5773	. 2 ⊢ (𝐹 ∈ 𝑉 → (∏t‘𝐹) = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))}))
62	61, 60	eqeltrd 2311	1 ⊢ (𝐹 ∈ 𝑉 → (∏t‘𝐹) ∈ V)

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 1005   = wceq 1398  ∃wex 1541   ∈ wcel 2205  {cab 2220  ∀wral 2522  ∃wrex 2523  Vcvv 2815   ∖ cdif 3210   ⊆ wss 3213  ∪ cuni 3916  ∪ ciun 3993  dom cdm 4751  ran crn 4752   Fn wfn 5349  ⟶wf 5350  ‘cfv 5354  (class class class)co 6052   ↑_𝑚 cmap 6884  Xcixp 6935  Fincfn 6977  topGenctg 13484  ∏_tcpt 13485

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-id 4416  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-ov 6055  df-oprab 6056  df-mpo 6057  df-map 6886  df-ixp 6936  df-topgen 13490  df-pt 13491

This theorem is referenced by:  prdsex  13499  prdsval  13503  prdsbaslemss  13504  psrval  14831  fnpsr  14832  psrbasg  14846  psrplusgg  14850