fmuldfeqlem1 - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > fmuldfeqlem1		Structured version Visualization version GIF version

Theorem fmuldfeqlem1 42224

Description: induction step for the proof of fmuldfeq 42225. (Contributed by Glauco Siliprandi, 20-Apr-2017.)

**Hypotheses**
Ref	Expression
fmuldfeqlem1.1	⊢ Ⅎ𝑓𝜑
fmuldfeqlem1.2	⊢ Ⅎ𝑔𝜑
fmuldfeqlem1.3	⊢ Ⅎ𝑡𝑌
fmuldfeqlem1.5	⊢ 𝑃 = (𝑓 ∈ 𝑌, 𝑔 ∈ 𝑌 ↦ (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))))
fmuldfeqlem1.6	⊢ 𝐹 = (𝑡 ∈ 𝑇 ↦ (𝑖 ∈ (1...𝑀) ↦ ((𝑈‘𝑖)‘𝑡)))
fmuldfeqlem1.7	⊢ (𝜑 → 𝑇 ∈ V)
fmuldfeqlem1.8	⊢ (𝜑 → 𝑈:(1...𝑀)⟶𝑌)
fmuldfeqlem1.9	⊢ ((𝜑 ∧ 𝑓 ∈ 𝑌 ∧ 𝑔 ∈ 𝑌) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝑌)
fmuldfeqlem1.10	⊢ (𝜑 → 𝑁 ∈ (1...𝑀))
fmuldfeqlem1.11	⊢ (𝜑 → (𝑁 + 1) ∈ (1...𝑀))
fmuldfeqlem1.12	⊢ (𝜑 → ((seq1(𝑃, 𝑈)‘𝑁)‘𝑡) = (seq1( · , (𝐹‘𝑡))‘𝑁))
fmuldfeqlem1.13	⊢ ((𝜑 ∧ 𝑓 ∈ 𝑌) → 𝑓:𝑇⟶ℝ)

**Assertion**
Ref	Expression
fmuldfeqlem1	⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((seq1(𝑃, 𝑈)‘(𝑁 + 1))‘𝑡) = (seq1( · , (𝐹‘𝑡))‘(𝑁 + 1)))

Distinct variable groups: 𝑓,𝑔,𝑡,𝑇 𝑓,𝑁,𝑡 𝑈,𝑓,𝑡 𝑓,𝑌,𝑔 𝑡,𝑖,𝑈 𝑖,𝑀 Allowed substitution hints: 𝜑(𝑡,𝑓,𝑔,𝑖) 𝑃(𝑡,𝑓,𝑔,𝑖) 𝑇(𝑖) 𝑈(𝑔) 𝐹(𝑡,𝑓,𝑔,𝑖) 𝑀(𝑡,𝑓,𝑔) 𝑁(𝑔,𝑖) 𝑌(𝑡,𝑖)

Proof of Theorem fmuldfeqlem1 Dummy variables ℎ 𝑙 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ovex 7168	. . . . . . . 8 ⊢ (1...𝑀) ∈ V
2	1	mptex 6963	. . . . . . 7 ⊢ (𝑖 ∈ (1...𝑀) ↦ ((𝑈‘𝑖)‘𝑡)) ∈ V
3		fmuldfeqlem1.6	. . . . . . . 8 ⊢ 𝐹 = (𝑡 ∈ 𝑇 ↦ (𝑖 ∈ (1...𝑀) ↦ ((𝑈‘𝑖)‘𝑡)))
4	3	fvmpt2 6756	. . . . . . 7 ⊢ ((𝑡 ∈ 𝑇 ∧ (𝑖 ∈ (1...𝑀) ↦ ((𝑈‘𝑖)‘𝑡)) ∈ V) → (𝐹‘𝑡) = (𝑖 ∈ (1...𝑀) ↦ ((𝑈‘𝑖)‘𝑡)))
5	2, 4	mpan2 690	. . . . . 6 ⊢ (𝑡 ∈ 𝑇 → (𝐹‘𝑡) = (𝑖 ∈ (1...𝑀) ↦ ((𝑈‘𝑖)‘𝑡)))
6		fveq2 6645	. . . . . . . 8 ⊢ (𝑖 = 𝑗 → (𝑈‘𝑖) = (𝑈‘𝑗))
7	6	fveq1d 6647	. . . . . . 7 ⊢ (𝑖 = 𝑗 → ((𝑈‘𝑖)‘𝑡) = ((𝑈‘𝑗)‘𝑡))
8	7	cbvmptv 5133	. . . . . 6 ⊢ (𝑖 ∈ (1...𝑀) ↦ ((𝑈‘𝑖)‘𝑡)) = (𝑗 ∈ (1...𝑀) ↦ ((𝑈‘𝑗)‘𝑡))
9	5, 8	eqtrdi 2849	. . . . 5 ⊢ (𝑡 ∈ 𝑇 → (𝐹‘𝑡) = (𝑗 ∈ (1...𝑀) ↦ ((𝑈‘𝑗)‘𝑡)))
10	9	adantl 485	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐹‘𝑡) = (𝑗 ∈ (1...𝑀) ↦ ((𝑈‘𝑗)‘𝑡)))
11		fveq2 6645	. . . . . 6 ⊢ (𝑗 = (𝑁 + 1) → (𝑈‘𝑗) = (𝑈‘(𝑁 + 1)))
12	11	fveq1d 6647	. . . . 5 ⊢ (𝑗 = (𝑁 + 1) → ((𝑈‘𝑗)‘𝑡) = ((𝑈‘(𝑁 + 1))‘𝑡))
13	12	adantl 485	. . . 4 ⊢ (((𝜑 ∧ 𝑡 ∈ 𝑇) ∧ 𝑗 = (𝑁 + 1)) → ((𝑈‘𝑗)‘𝑡) = ((𝑈‘(𝑁 + 1))‘𝑡))
14		fmuldfeqlem1.11	. . . . 5 ⊢ (𝜑 → (𝑁 + 1) ∈ (1...𝑀))
15	14	adantr 484	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝑁 + 1) ∈ (1...𝑀))
16		fmuldfeqlem1.8	. . . . . . 7 ⊢ (𝜑 → 𝑈:(1...𝑀)⟶𝑌)
17	16, 14	ffvelrnd 6829	. . . . . 6 ⊢ (𝜑 → (𝑈‘(𝑁 + 1)) ∈ 𝑌)
18	17	ancli 552	. . . . . 6 ⊢ (𝜑 → (𝜑 ∧ (𝑈‘(𝑁 + 1)) ∈ 𝑌))
19		nfcv 2955	. . . . . . 7 ⊢ Ⅎ𝑓(𝑈‘(𝑁 + 1))
20		fmuldfeqlem1.1	. . . . . . . . 9 ⊢ Ⅎ𝑓𝜑
21		nfv 1915	. . . . . . . . 9 ⊢ Ⅎ𝑓(𝑈‘(𝑁 + 1)) ∈ 𝑌
22	20, 21	nfan 1900	. . . . . . . 8 ⊢ Ⅎ𝑓(𝜑 ∧ (𝑈‘(𝑁 + 1)) ∈ 𝑌)
23		nfv 1915	. . . . . . . 8 ⊢ Ⅎ𝑓(𝑈‘(𝑁 + 1)):𝑇⟶ℝ
24	22, 23	nfim 1897	. . . . . . 7 ⊢ Ⅎ𝑓((𝜑 ∧ (𝑈‘(𝑁 + 1)) ∈ 𝑌) → (𝑈‘(𝑁 + 1)):𝑇⟶ℝ)
25		eleq1 2877	. . . . . . . . 9 ⊢ (𝑓 = (𝑈‘(𝑁 + 1)) → (𝑓 ∈ 𝑌 ↔ (𝑈‘(𝑁 + 1)) ∈ 𝑌))
26	25	anbi2d 631	. . . . . . . 8 ⊢ (𝑓 = (𝑈‘(𝑁 + 1)) → ((𝜑 ∧ 𝑓 ∈ 𝑌) ↔ (𝜑 ∧ (𝑈‘(𝑁 + 1)) ∈ 𝑌)))
27		feq1 6468	. . . . . . . 8 ⊢ (𝑓 = (𝑈‘(𝑁 + 1)) → (𝑓:𝑇⟶ℝ ↔ (𝑈‘(𝑁 + 1)):𝑇⟶ℝ))
28	26, 27	imbi12d 348	. . . . . . 7 ⊢ (𝑓 = (𝑈‘(𝑁 + 1)) → (((𝜑 ∧ 𝑓 ∈ 𝑌) → 𝑓:𝑇⟶ℝ) ↔ ((𝜑 ∧ (𝑈‘(𝑁 + 1)) ∈ 𝑌) → (𝑈‘(𝑁 + 1)):𝑇⟶ℝ)))
29		fmuldfeqlem1.13	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑌) → 𝑓:𝑇⟶ℝ)
30	19, 24, 28, 29	vtoclgf 3513	. . . . . 6 ⊢ ((𝑈‘(𝑁 + 1)) ∈ 𝑌 → ((𝜑 ∧ (𝑈‘(𝑁 + 1)) ∈ 𝑌) → (𝑈‘(𝑁 + 1)):𝑇⟶ℝ))
31	17, 18, 30	sylc 65	. . . . 5 ⊢ (𝜑 → (𝑈‘(𝑁 + 1)):𝑇⟶ℝ)
32	31	ffvelrnda 6828	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((𝑈‘(𝑁 + 1))‘𝑡) ∈ ℝ)
33	10, 13, 15, 32	fvmptd 6752	. . 3 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((𝐹‘𝑡)‘(𝑁 + 1)) = ((𝑈‘(𝑁 + 1))‘𝑡))
34	33	oveq2d 7151	. 2 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((seq1( · , (𝐹‘𝑡))‘𝑁) · ((𝐹‘𝑡)‘(𝑁 + 1))) = ((seq1( · , (𝐹‘𝑡))‘𝑁) · ((𝑈‘(𝑁 + 1))‘𝑡)))
35		fmuldfeqlem1.10	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ (1...𝑀))
36		elfzuz 12898	. . . . 5 ⊢ (𝑁 ∈ (1...𝑀) → 𝑁 ∈ (ℤ_≥‘1))
37	35, 36	syl 17	. . . 4 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘1))
38		seqp1 13379	. . . 4 ⊢ (𝑁 ∈ (ℤ_≥‘1) → (seq1( · , (𝐹‘𝑡))‘(𝑁 + 1)) = ((seq1( · , (𝐹‘𝑡))‘𝑁) · ((𝐹‘𝑡)‘(𝑁 + 1))))
39	37, 38	syl 17	. . 3 ⊢ (𝜑 → (seq1( · , (𝐹‘𝑡))‘(𝑁 + 1)) = ((seq1( · , (𝐹‘𝑡))‘𝑁) · ((𝐹‘𝑡)‘(𝑁 + 1))))
40	39	adantr 484	. 2 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (seq1( · , (𝐹‘𝑡))‘(𝑁 + 1)) = ((seq1( · , (𝐹‘𝑡))‘𝑁) · ((𝐹‘𝑡)‘(𝑁 + 1))))
41		seqp1 13379	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘1) → (seq1(𝑃, 𝑈)‘(𝑁 + 1)) = ((seq1(𝑃, 𝑈)‘𝑁)𝑃(𝑈‘(𝑁 + 1))))
42	37, 41	syl 17	. . . . 5 ⊢ (𝜑 → (seq1(𝑃, 𝑈)‘(𝑁 + 1)) = ((seq1(𝑃, 𝑈)‘𝑁)𝑃(𝑈‘(𝑁 + 1))))
43		fmuldfeqlem1.5	. . . . . . . 8 ⊢ 𝑃 = (𝑓 ∈ 𝑌, 𝑔 ∈ 𝑌 ↦ (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))))
44		nfcv 2955	. . . . . . . . 9 ⊢ Ⅎℎ(𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡)))
45		nfcv 2955	. . . . . . . . 9 ⊢ Ⅎ𝑙(𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡)))
46		nfcv 2955	. . . . . . . . 9 ⊢ Ⅎ𝑓(𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑙‘𝑡)))
47		nfcv 2955	. . . . . . . . 9 ⊢ Ⅎ𝑔(𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑙‘𝑡)))
48		fveq1 6644	. . . . . . . . . . 11 ⊢ (𝑓 = ℎ → (𝑓‘𝑡) = (ℎ‘𝑡))
49		fveq1 6644	. . . . . . . . . . 11 ⊢ (𝑔 = 𝑙 → (𝑔‘𝑡) = (𝑙‘𝑡))
50	48, 49	oveqan12d 7154	. . . . . . . . . 10 ⊢ ((𝑓 = ℎ ∧ 𝑔 = 𝑙) → ((𝑓‘𝑡) · (𝑔‘𝑡)) = ((ℎ‘𝑡) · (𝑙‘𝑡)))
51	50	mpteq2dv 5126	. . . . . . . . 9 ⊢ ((𝑓 = ℎ ∧ 𝑔 = 𝑙) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) = (𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑙‘𝑡))))
52	44, 45, 46, 47, 51	cbvmpo 7227	. . . . . . . 8 ⊢ (𝑓 ∈ 𝑌, 𝑔 ∈ 𝑌 ↦ (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡)))) = (ℎ ∈ 𝑌, 𝑙 ∈ 𝑌 ↦ (𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑙‘𝑡))))
53	43, 52	eqtri 2821	. . . . . . 7 ⊢ 𝑃 = (ℎ ∈ 𝑌, 𝑙 ∈ 𝑌 ↦ (𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑙‘𝑡))))
54	53	a1i 11	. . . . . 6 ⊢ (𝜑 → 𝑃 = (ℎ ∈ 𝑌, 𝑙 ∈ 𝑌 ↦ (𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑙‘𝑡)))))
55		nfcv 2955	. . . . . . . . . . . 12 ⊢ Ⅎ𝑡1
56		fmuldfeqlem1.3	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑡𝑌
57		nfmpt1 5128	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑡(𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡)))
58	56, 56, 57	nfmpo 7215	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑡(𝑓 ∈ 𝑌, 𝑔 ∈ 𝑌 ↦ (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))))
59	43, 58	nfcxfr 2953	. . . . . . . . . . . 12 ⊢ Ⅎ𝑡𝑃
60		nfcv 2955	. . . . . . . . . . . 12 ⊢ Ⅎ𝑡𝑈
61	55, 59, 60	nfseq 13374	. . . . . . . . . . 11 ⊢ Ⅎ𝑡seq1(𝑃, 𝑈)
62		nfcv 2955	. . . . . . . . . . 11 ⊢ Ⅎ𝑡𝑁
63	61, 62	nffv 6655	. . . . . . . . . 10 ⊢ Ⅎ𝑡(seq1(𝑃, 𝑈)‘𝑁)
64	63	nfeq2 2972	. . . . . . . . 9 ⊢ Ⅎ𝑡 ℎ = (seq1(𝑃, 𝑈)‘𝑁)
65		nfv 1915	. . . . . . . . 9 ⊢ Ⅎ𝑡 𝑙 = (𝑈‘(𝑁 + 1))
66	64, 65	nfan 1900	. . . . . . . 8 ⊢ Ⅎ𝑡(ℎ = (seq1(𝑃, 𝑈)‘𝑁) ∧ 𝑙 = (𝑈‘(𝑁 + 1)))
67		fveq1 6644	. . . . . . . . . 10 ⊢ (ℎ = (seq1(𝑃, 𝑈)‘𝑁) → (ℎ‘𝑡) = ((seq1(𝑃, 𝑈)‘𝑁)‘𝑡))
68	67	ad2antrr 725	. . . . . . . . 9 ⊢ (((ℎ = (seq1(𝑃, 𝑈)‘𝑁) ∧ 𝑙 = (𝑈‘(𝑁 + 1))) ∧ 𝑡 ∈ 𝑇) → (ℎ‘𝑡) = ((seq1(𝑃, 𝑈)‘𝑁)‘𝑡))
69		fveq1 6644	. . . . . . . . . 10 ⊢ (𝑙 = (𝑈‘(𝑁 + 1)) → (𝑙‘𝑡) = ((𝑈‘(𝑁 + 1))‘𝑡))
70	69	ad2antlr 726	. . . . . . . . 9 ⊢ (((ℎ = (seq1(𝑃, 𝑈)‘𝑁) ∧ 𝑙 = (𝑈‘(𝑁 + 1))) ∧ 𝑡 ∈ 𝑇) → (𝑙‘𝑡) = ((𝑈‘(𝑁 + 1))‘𝑡))
71	68, 70	oveq12d 7153	. . . . . . . 8 ⊢ (((ℎ = (seq1(𝑃, 𝑈)‘𝑁) ∧ 𝑙 = (𝑈‘(𝑁 + 1))) ∧ 𝑡 ∈ 𝑇) → ((ℎ‘𝑡) · (𝑙‘𝑡)) = (((seq1(𝑃, 𝑈)‘𝑁)‘𝑡) · ((𝑈‘(𝑁 + 1))‘𝑡)))
72	66, 71	mpteq2da 5124	. . . . . . 7 ⊢ ((ℎ = (seq1(𝑃, 𝑈)‘𝑁) ∧ 𝑙 = (𝑈‘(𝑁 + 1))) → (𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑙‘𝑡))) = (𝑡 ∈ 𝑇 ↦ (((seq1(𝑃, 𝑈)‘𝑁)‘𝑡) · ((𝑈‘(𝑁 + 1))‘𝑡))))
73	72	adantl 485	. . . . . 6 ⊢ ((𝜑 ∧ (ℎ = (seq1(𝑃, 𝑈)‘𝑁) ∧ 𝑙 = (𝑈‘(𝑁 + 1)))) → (𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑙‘𝑡))) = (𝑡 ∈ 𝑇 ↦ (((seq1(𝑃, 𝑈)‘𝑁)‘𝑡) · ((𝑈‘(𝑁 + 1))‘𝑡))))
74		eqid 2798	. . . . . . 7 ⊢ (seq1(𝑃, 𝑈)‘𝑁) = (seq1(𝑃, 𝑈)‘𝑁)
75		3simpc 1147	. . . . . . . 8 ⊢ ((𝜑 ∧ ℎ ∈ 𝑌 ∧ 𝑙 ∈ 𝑌) → (ℎ ∈ 𝑌 ∧ 𝑙 ∈ 𝑌))
76		nfcv 2955	. . . . . . . . 9 ⊢ Ⅎ𝑓ℎ
77		nfcv 2955	. . . . . . . . 9 ⊢ Ⅎ𝑔ℎ
78		nfcv 2955	. . . . . . . . 9 ⊢ Ⅎ𝑔𝑙
79		nfv 1915	. . . . . . . . . . 11 ⊢ Ⅎ𝑓 ℎ ∈ 𝑌
80		nfv 1915	. . . . . . . . . . 11 ⊢ Ⅎ𝑓 𝑔 ∈ 𝑌
81	20, 79, 80	nf3an 1902	. . . . . . . . . 10 ⊢ Ⅎ𝑓(𝜑 ∧ ℎ ∈ 𝑌 ∧ 𝑔 ∈ 𝑌)
82		nfv 1915	. . . . . . . . . 10 ⊢ Ⅎ𝑓(𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑔‘𝑡))) ∈ 𝑌
83	81, 82	nfim 1897	. . . . . . . . 9 ⊢ Ⅎ𝑓((𝜑 ∧ ℎ ∈ 𝑌 ∧ 𝑔 ∈ 𝑌) → (𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑔‘𝑡))) ∈ 𝑌)
84		fmuldfeqlem1.2	. . . . . . . . . . 11 ⊢ Ⅎ𝑔𝜑
85		nfv 1915	. . . . . . . . . . 11 ⊢ Ⅎ𝑔 ℎ ∈ 𝑌
86		nfv 1915	. . . . . . . . . . 11 ⊢ Ⅎ𝑔 𝑙 ∈ 𝑌
87	84, 85, 86	nf3an 1902	. . . . . . . . . 10 ⊢ Ⅎ𝑔(𝜑 ∧ ℎ ∈ 𝑌 ∧ 𝑙 ∈ 𝑌)
88		nfv 1915	. . . . . . . . . 10 ⊢ Ⅎ𝑔(𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑙‘𝑡))) ∈ 𝑌
89	87, 88	nfim 1897	. . . . . . . . 9 ⊢ Ⅎ𝑔((𝜑 ∧ ℎ ∈ 𝑌 ∧ 𝑙 ∈ 𝑌) → (𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑙‘𝑡))) ∈ 𝑌)
90		eleq1 2877	. . . . . . . . . . 11 ⊢ (𝑓 = ℎ → (𝑓 ∈ 𝑌 ↔ ℎ ∈ 𝑌))
91	90	3anbi2d 1438	. . . . . . . . . 10 ⊢ (𝑓 = ℎ → ((𝜑 ∧ 𝑓 ∈ 𝑌 ∧ 𝑔 ∈ 𝑌) ↔ (𝜑 ∧ ℎ ∈ 𝑌 ∧ 𝑔 ∈ 𝑌)))
92	48	oveq1d 7150	. . . . . . . . . . . 12 ⊢ (𝑓 = ℎ → ((𝑓‘𝑡) · (𝑔‘𝑡)) = ((ℎ‘𝑡) · (𝑔‘𝑡)))
93	92	mpteq2dv 5126	. . . . . . . . . . 11 ⊢ (𝑓 = ℎ → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) = (𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑔‘𝑡))))
94	93	eleq1d 2874	. . . . . . . . . 10 ⊢ (𝑓 = ℎ → ((𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝑌 ↔ (𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑔‘𝑡))) ∈ 𝑌))
95	91, 94	imbi12d 348	. . . . . . . . 9 ⊢ (𝑓 = ℎ → (((𝜑 ∧ 𝑓 ∈ 𝑌 ∧ 𝑔 ∈ 𝑌) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝑌) ↔ ((𝜑 ∧ ℎ ∈ 𝑌 ∧ 𝑔 ∈ 𝑌) → (𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑔‘𝑡))) ∈ 𝑌)))
96		eleq1 2877	. . . . . . . . . . 11 ⊢ (𝑔 = 𝑙 → (𝑔 ∈ 𝑌 ↔ 𝑙 ∈ 𝑌))
97	96	3anbi3d 1439	. . . . . . . . . 10 ⊢ (𝑔 = 𝑙 → ((𝜑 ∧ ℎ ∈ 𝑌 ∧ 𝑔 ∈ 𝑌) ↔ (𝜑 ∧ ℎ ∈ 𝑌 ∧ 𝑙 ∈ 𝑌)))
98	49	oveq2d 7151	. . . . . . . . . . . 12 ⊢ (𝑔 = 𝑙 → ((ℎ‘𝑡) · (𝑔‘𝑡)) = ((ℎ‘𝑡) · (𝑙‘𝑡)))
99	98	mpteq2dv 5126	. . . . . . . . . . 11 ⊢ (𝑔 = 𝑙 → (𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑔‘𝑡))) = (𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑙‘𝑡))))
100	99	eleq1d 2874	. . . . . . . . . 10 ⊢ (𝑔 = 𝑙 → ((𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑔‘𝑡))) ∈ 𝑌 ↔ (𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑙‘𝑡))) ∈ 𝑌))
101	97, 100	imbi12d 348	. . . . . . . . 9 ⊢ (𝑔 = 𝑙 → (((𝜑 ∧ ℎ ∈ 𝑌 ∧ 𝑔 ∈ 𝑌) → (𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑔‘𝑡))) ∈ 𝑌) ↔ ((𝜑 ∧ ℎ ∈ 𝑌 ∧ 𝑙 ∈ 𝑌) → (𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑙‘𝑡))) ∈ 𝑌)))
102		fmuldfeqlem1.9	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝑌 ∧ 𝑔 ∈ 𝑌) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝑌)
103	76, 77, 78, 83, 89, 95, 101, 102	vtocl2gf 3518	. . . . . . . 8 ⊢ ((ℎ ∈ 𝑌 ∧ 𝑙 ∈ 𝑌) → ((𝜑 ∧ ℎ ∈ 𝑌 ∧ 𝑙 ∈ 𝑌) → (𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑙‘𝑡))) ∈ 𝑌))
104	75, 103	mpcom 38	. . . . . . 7 ⊢ ((𝜑 ∧ ℎ ∈ 𝑌 ∧ 𝑙 ∈ 𝑌) → (𝑡 ∈ 𝑇 ↦ ((ℎ‘𝑡) · (𝑙‘𝑡))) ∈ 𝑌)
105		fmuldfeqlem1.7	. . . . . . 7 ⊢ (𝜑 → 𝑇 ∈ V)
106	53, 74, 35, 16, 104, 105	fmulcl 42223	. . . . . 6 ⊢ (𝜑 → (seq1(𝑃, 𝑈)‘𝑁) ∈ 𝑌)
107		mptexg 6961	. . . . . . 7 ⊢ (𝑇 ∈ V → (𝑡 ∈ 𝑇 ↦ (((seq1(𝑃, 𝑈)‘𝑁)‘𝑡) · ((𝑈‘(𝑁 + 1))‘𝑡))) ∈ V)
108	105, 107	syl 17	. . . . . 6 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ (((seq1(𝑃, 𝑈)‘𝑁)‘𝑡) · ((𝑈‘(𝑁 + 1))‘𝑡))) ∈ V)
109	54, 73, 106, 17, 108	ovmpod 7281	. . . . 5 ⊢ (𝜑 → ((seq1(𝑃, 𝑈)‘𝑁)𝑃(𝑈‘(𝑁 + 1))) = (𝑡 ∈ 𝑇 ↦ (((seq1(𝑃, 𝑈)‘𝑁)‘𝑡) · ((𝑈‘(𝑁 + 1))‘𝑡))))
110	42, 109	eqtrd 2833	. . . 4 ⊢ (𝜑 → (seq1(𝑃, 𝑈)‘(𝑁 + 1)) = (𝑡 ∈ 𝑇 ↦ (((seq1(𝑃, 𝑈)‘𝑁)‘𝑡) · ((𝑈‘(𝑁 + 1))‘𝑡))))
111	106	ancli 552	. . . . . . 7 ⊢ (𝜑 → (𝜑 ∧ (seq1(𝑃, 𝑈)‘𝑁) ∈ 𝑌))
112		nfcv 2955	. . . . . . . . . 10 ⊢ Ⅎ𝑓1
113		nfmpo1 7213	. . . . . . . . . . 11 ⊢ Ⅎ𝑓(𝑓 ∈ 𝑌, 𝑔 ∈ 𝑌 ↦ (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))))
114	43, 113	nfcxfr 2953	. . . . . . . . . 10 ⊢ Ⅎ𝑓𝑃
115		nfcv 2955	. . . . . . . . . 10 ⊢ Ⅎ𝑓𝑈
116	112, 114, 115	nfseq 13374	. . . . . . . . 9 ⊢ Ⅎ𝑓seq1(𝑃, 𝑈)
117		nfcv 2955	. . . . . . . . 9 ⊢ Ⅎ𝑓𝑁
118	116, 117	nffv 6655	. . . . . . . 8 ⊢ Ⅎ𝑓(seq1(𝑃, 𝑈)‘𝑁)
119	118	nfel1 2971	. . . . . . . . . 10 ⊢ Ⅎ𝑓(seq1(𝑃, 𝑈)‘𝑁) ∈ 𝑌
120	20, 119	nfan 1900	. . . . . . . . 9 ⊢ Ⅎ𝑓(𝜑 ∧ (seq1(𝑃, 𝑈)‘𝑁) ∈ 𝑌)
121		nfcv 2955	. . . . . . . . . 10 ⊢ Ⅎ𝑓𝑇
122		nfcv 2955	. . . . . . . . . 10 ⊢ Ⅎ𝑓ℝ
123	118, 121, 122	nff 6483	. . . . . . . . 9 ⊢ Ⅎ𝑓(seq1(𝑃, 𝑈)‘𝑁):𝑇⟶ℝ
124	120, 123	nfim 1897	. . . . . . . 8 ⊢ Ⅎ𝑓((𝜑 ∧ (seq1(𝑃, 𝑈)‘𝑁) ∈ 𝑌) → (seq1(𝑃, 𝑈)‘𝑁):𝑇⟶ℝ)
125		eleq1 2877	. . . . . . . . . 10 ⊢ (𝑓 = (seq1(𝑃, 𝑈)‘𝑁) → (𝑓 ∈ 𝑌 ↔ (seq1(𝑃, 𝑈)‘𝑁) ∈ 𝑌))
126	125	anbi2d 631	. . . . . . . . 9 ⊢ (𝑓 = (seq1(𝑃, 𝑈)‘𝑁) → ((𝜑 ∧ 𝑓 ∈ 𝑌) ↔ (𝜑 ∧ (seq1(𝑃, 𝑈)‘𝑁) ∈ 𝑌)))
127		feq1 6468	. . . . . . . . 9 ⊢ (𝑓 = (seq1(𝑃, 𝑈)‘𝑁) → (𝑓:𝑇⟶ℝ ↔ (seq1(𝑃, 𝑈)‘𝑁):𝑇⟶ℝ))
128	126, 127	imbi12d 348	. . . . . . . 8 ⊢ (𝑓 = (seq1(𝑃, 𝑈)‘𝑁) → (((𝜑 ∧ 𝑓 ∈ 𝑌) → 𝑓:𝑇⟶ℝ) ↔ ((𝜑 ∧ (seq1(𝑃, 𝑈)‘𝑁) ∈ 𝑌) → (seq1(𝑃, 𝑈)‘𝑁):𝑇⟶ℝ)))
129	118, 124, 128, 29	vtoclgf 3513	. . . . . . 7 ⊢ ((seq1(𝑃, 𝑈)‘𝑁) ∈ 𝑌 → ((𝜑 ∧ (seq1(𝑃, 𝑈)‘𝑁) ∈ 𝑌) → (seq1(𝑃, 𝑈)‘𝑁):𝑇⟶ℝ))
130	106, 111, 129	sylc 65	. . . . . 6 ⊢ (𝜑 → (seq1(𝑃, 𝑈)‘𝑁):𝑇⟶ℝ)
131	130	ffvelrnda 6828	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((seq1(𝑃, 𝑈)‘𝑁)‘𝑡) ∈ ℝ)
132	131, 32	remulcld 10660	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (((seq1(𝑃, 𝑈)‘𝑁)‘𝑡) · ((𝑈‘(𝑁 + 1))‘𝑡)) ∈ ℝ)
133	110, 132	fvmpt2d 6758	. . 3 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((seq1(𝑃, 𝑈)‘(𝑁 + 1))‘𝑡) = (((seq1(𝑃, 𝑈)‘𝑁)‘𝑡) · ((𝑈‘(𝑁 + 1))‘𝑡)))
134		fmuldfeqlem1.12	. . . . 5 ⊢ (𝜑 → ((seq1(𝑃, 𝑈)‘𝑁)‘𝑡) = (seq1( · , (𝐹‘𝑡))‘𝑁))
135	134	oveq1d 7150	. . . 4 ⊢ (𝜑 → (((seq1(𝑃, 𝑈)‘𝑁)‘𝑡) · ((𝑈‘(𝑁 + 1))‘𝑡)) = ((seq1( · , (𝐹‘𝑡))‘𝑁) · ((𝑈‘(𝑁 + 1))‘𝑡)))
136	135	adantr 484	. . 3 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (((seq1(𝑃, 𝑈)‘𝑁)‘𝑡) · ((𝑈‘(𝑁 + 1))‘𝑡)) = ((seq1( · , (𝐹‘𝑡))‘𝑁) · ((𝑈‘(𝑁 + 1))‘𝑡)))
137	133, 136	eqtrd 2833	. 2 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((seq1(𝑃, 𝑈)‘(𝑁 + 1))‘𝑡) = ((seq1( · , (𝐹‘𝑡))‘𝑁) · ((𝑈‘(𝑁 + 1))‘𝑡)))
138	34, 40, 137	3eqtr4rd 2844	1 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((seq1(𝑃, 𝑈)‘(𝑁 + 1))‘𝑡) = (seq1( · , (𝐹‘𝑡))‘(𝑁 + 1)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1084 = wceq 1538 Ⅎwnf 1785 ∈ wcel 2111 Ⅎwnfc 2936 Vcvv 3441 ↦ cmpt 5110 ⟶wf 6320 ‘cfv 6324 (class class class)co 7135 ∈ cmpo 7137 ℝcr 10525 1c1 10527 + caddc 10529 · cmul 10531 ℤ_≥cuz 12231 ...cfz 12885 seqcseq 13364

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12886 df-seq 13365

This theorem is referenced by: fmuldfeq 42225

W3C validator