Theorem ptex 13671

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 13668	. . 3 ⊢ ∏t = (𝑓 ∈ V ↦ (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝑓 ∧ ∀𝑦 ∈ dom 𝑓(𝑔‘𝑦) ∈ (𝑓‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝑓‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝑓(𝑔‘𝑦))}))
2		dmeq 4981	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
3	2	fneq2d 5472	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑔 Fn dom 𝑓 ↔ 𝑔 Fn dom 𝐹))
4		fveq1 5694	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑦) = (𝐹‘𝑦))
5	4	eleq2d 2308	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → ((𝑔‘𝑦) ∈ (𝑓‘𝑦) ↔ (𝑔‘𝑦) ∈ (𝐹‘𝑦)))
6	2, 5	raleqbidv 2765	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (∀𝑦 ∈ dom 𝑓(𝑔‘𝑦) ∈ (𝑓‘𝑦) ↔ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦)))
7	2	difeq1d 3346	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (dom 𝑓 ∖ 𝑧) = (dom 𝐹 ∖ 𝑧))
8	4	unieqd 3946	. . . . . . . . . . 11 ⊢ (𝑓 = 𝐹 → ∪ (𝑓‘𝑦) = ∪ (𝐹‘𝑦))
9	8	eqeq2d 2250	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → ((𝑔‘𝑦) = ∪ (𝑓‘𝑦) ↔ (𝑔‘𝑦) = ∪ (𝐹‘𝑦)))
10	7, 9	raleqbidv 2765	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (∀𝑦 ∈ (dom 𝑓 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝑓‘𝑦) ↔ ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)))
11	10	rexbidv 2551	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝑓‘𝑦) ↔ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)))
12	3, 6, 11	3anbi123d 1353	. . . . . . 7 ⊢ (𝑓 = 𝐹 → ((𝑔 Fn dom 𝑓 ∧ ∀𝑦 ∈ dom 𝑓(𝑔‘𝑦) ∈ (𝑓‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝑓‘𝑦)) ↔ (𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦))))
13	2	ixpeq1d 6992	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → X𝑦 ∈ dom 𝑓(𝑔‘𝑦) = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))
14	13	eqeq2d 2250	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑥 = X𝑦 ∈ dom 𝑓(𝑔‘𝑦) ↔ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦)))
15	12, 14	anbi12d 477	. . . . . 6 ⊢ (𝑓 = 𝐹 → (((𝑔 Fn dom 𝑓 ∧ ∀𝑦 ∈ dom 𝑓(𝑔‘𝑦) ∈ (𝑓‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝑓‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝑓(𝑔‘𝑦)) ↔ ((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))))
16	15	exbidv 1878	. . . . 5 ⊢ (𝑓 = 𝐹 → (∃𝑔((𝑔 Fn dom 𝑓 ∧ ∀𝑦 ∈ dom 𝑓(𝑔‘𝑦) ∈ (𝑓‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝑓‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝑓(𝑔‘𝑦)) ↔ ∃𝑔((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))))
17	16	abbidv 2358	. . . 4 ⊢ (𝑓 = 𝐹 → {𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝑓 ∧ ∀𝑦 ∈ dom 𝑓(𝑔‘𝑦) ∈ (𝑓‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝑓‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝑓(𝑔‘𝑦))} = {𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))})
18	17	fveq2d 5699	. . 3 ⊢ (𝑓 = 𝐹 → (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝑓 ∧ ∀𝑦 ∈ dom 𝑓(𝑔‘𝑦) ∈ (𝑓‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝑓 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝑓‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝑓(𝑔‘𝑦))}) = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))}))
19		elex 2833	. . 3 ⊢ (𝐹 ∈ 𝑉 → 𝐹 ∈ V)
20		dmexg 5046	. . . . . . . . . 10 ⊢ (𝐹 ∈ 𝑉 → dom 𝐹 ∈ V)
21		vex 2824	. . . . . . . . . . . . 13 ⊢ 𝑔 ∈ V
22		vex 2824	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
23	21, 22	fvex 5715	. . . . . . . . . . . 12 ⊢ (𝑔‘𝑦) ∈ V
24	23	a1i 9	. . . . . . . . . . 11 ⊢ (𝐹 ∈ 𝑉 → (𝑔‘𝑦) ∈ V)
25	24	ralrimivw 2624	. . . . . . . . . 10 ⊢ (𝐹 ∈ 𝑉 → ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ V)
26		ixpexgg 7004	. . . . . . . . . 10 ⊢ ((dom 𝐹 ∈ V ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ V) → X𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ V)
27	20, 25, 26	syl2anc 415	. . . . . . . . 9 ⊢ (𝐹 ∈ 𝑉 → X𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ V)
28	27	ralrimivw 2624	. . . . . . . 8 ⊢ (𝐹 ∈ 𝑉 → ∀𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)X𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ V)
29		dfiun2g 4044	. . . . . . . 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 5047	. . . . . . . . . 10 ⊢ (𝐹 ∈ 𝑉 → ran 𝐹 ∈ V)
32	31	uniexd 4586	. . . . . . . . 9 ⊢ (𝐹 ∈ 𝑉 → ∪ ran 𝐹 ∈ V)
33		mapvalg 6932	. . . . . . . . . 10 ⊢ ((∪ ran 𝐹 ∈ V ∧ dom 𝐹 ∈ V) → (∪ ran 𝐹 ↑𝑚 dom 𝐹) = {𝑔 ∣ 𝑔:dom 𝐹⟶∪ ran 𝐹})
34		mapex 6928	. . . . . . . . . . 11 ⊢ ((dom 𝐹 ∈ V ∧ ∪ ran 𝐹 ∈ V) → {𝑔 ∣ 𝑔:dom 𝐹⟶∪ ran 𝐹} ∈ V)
35	34	ancoms 268	. . . . . . . . . 10 ⊢ ((∪ ran 𝐹 ∈ V ∧ dom 𝐹 ∈ V) → {𝑔 ∣ 𝑔:dom 𝐹⟶∪ ran 𝐹} ∈ V)
36	33, 35	eqeltrd 2315	. . . . . . . . 9 ⊢ ((∪ ran 𝐹 ∈ V ∧ dom 𝐹 ∈ V) → (∪ ran 𝐹 ↑𝑚 dom 𝐹) ∈ V)
37	32, 20, 36	syl2anc 415	. . . . . . . 8 ⊢ (𝐹 ∈ 𝑉 → (∪ ran 𝐹 ↑𝑚 dom 𝐹) ∈ V)
38		iunexg 6348	. . . . . . . 8 ⊢ (((∪ ran 𝐹 ↑𝑚 dom 𝐹) ∈ V ∧ ∀𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)X𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ V) → ∪ 𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)X𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ V)
39	37, 28, 38	syl2anc 415	. . . . . . 7 ⊢ (𝐹 ∈ 𝑉 → ∪ 𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)X𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ V)
40	30, 39	eqeltrrd 2316	. . . . . 6 ⊢ (𝐹 ∈ 𝑉 → ∪ {𝑥 ∣ ∃𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦)} ∈ V)
41		uniexb 4619	. . . . . 6 ⊢ ({𝑥 ∣ ∃𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦)} ∈ V ↔ ∪ {𝑥 ∣ ∃𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦)} ∈ V)
42	40, 41	sylibr 134	. . . . 5 ⊢ (𝐹 ∈ 𝑉 → {𝑥 ∣ ∃𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦)} ∈ V)
43		simp1 1028	. . . . . . . . . . 11 ⊢ ((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) → 𝑔 Fn dom 𝐹)
44		fvssunirng 5710	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ V → (𝐹‘𝑦) ⊆ ∪ ran 𝐹)
45	44	elv 2825	. . . . . . . . . . . . . 14 ⊢ (𝐹‘𝑦) ⊆ ∪ ran 𝐹
46	45	sseli 3244	. . . . . . . . . . . . 13 ⊢ ((𝑔‘𝑦) ∈ (𝐹‘𝑦) → (𝑔‘𝑦) ∈ ∪ ran 𝐹)
47	46	ralimi 2613	. . . . . . . . . . . 12 ⊢ (∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) → ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ ∪ ran 𝐹)
48	47	3ad2ant2 1050	. . . . . . . . . . 11 ⊢ ((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) → ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ ∪ ran 𝐹)
49		ffnfv 5866	. . . . . . . . . . 11 ⊢ (𝑔:dom 𝐹⟶∪ ran 𝐹 ↔ (𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ ∪ ran 𝐹))
50	43, 48, 49	sylanbrc 421	. . . . . . . . . 10 ⊢ ((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) → 𝑔:dom 𝐹⟶∪ ran 𝐹)
51	32, 20	elmapd 6936	. . . . . . . . . 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 1933	. . . . . . 7 ⊢ (𝐹 ∈ 𝑉 → (∃𝑔((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦)) → ∃𝑔(𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))))
55		df-rex 2534	. . . . . . 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 3321	. . . . 5 ⊢ (𝐹 ∈ 𝑉 → {𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))} ⊆ {𝑥 ∣ ∃𝑔 ∈ (∪ ran 𝐹 ↑𝑚 dom 𝐹)𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦)})
58	42, 57	ssexd 4273	. . . 4 ⊢ (𝐹 ∈ 𝑉 → {𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))} ∈ V)
59		tgvalex 13670	. . . 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 5799	. 2 ⊢ (𝐹 ∈ 𝑉 → (∏t‘𝐹) = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn dom 𝐹 ∧ ∀𝑦 ∈ dom 𝐹(𝑔‘𝑦) ∈ (𝐹‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (dom 𝐹 ∖ 𝑧)(𝑔‘𝑦) = ∪ (𝐹‘𝑦)) ∧ 𝑥 = X𝑦 ∈ dom 𝐹(𝑔‘𝑦))}))
62	61, 60	eqeltrd 2315	1 ⊢ (𝐹 ∈ 𝑉 → (∏t‘𝐹) ∈ V)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009   = wceq 1402  ∃wex 1545   ∈ wcel 2209  {cab 2224  ∀wral 2528  ∃wrex 2529  Vcvv 2821   ∖ cdif 3217   ⊆ wss 3220  ∪ cuni 3935  ∪ ciun 4012  dom cdm 4774  ran crn 4775   Fn wfn 5372  ⟶wf 5373  ‘cfv 5377  (class class class)co 6085   ↑_𝑚 cmap 6922  Xcixp 6980  Fincfn 7022  topGenctg 13661  ∏_tcpt 13662

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-map 6924  df-ixp 6981  df-topgen 13667  df-pt 13668

This theorem is used by:  prdsex  14256  prdsval  14257  prdsbaslemss  14258  psrval  15134  fnpsr  15135  psrbasg  15150  psrplusgg  15154  psrmulrg  15158