etransclem4 - Mathbox for Glauco Siliprandi

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

Theorem etransclem4 45039

Description: 𝐹 expressed as a finite product. (Contributed by Glauco Siliprandi, 5-Apr-2020.)

**Hypotheses**
Ref	Expression
etransclem4.a	⊢ (𝜑 → 𝐴 ⊆ ℂ)
etransclem4.p	⊢ (𝜑 → 𝑃 ∈ ℕ)
etransclem4.M	⊢ (𝜑 → 𝑀 ∈ ℕ₀)
etransclem4.f	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ ((𝑥↑(𝑃 − 1)) · ∏𝑗 ∈ (1...𝑀)((𝑥 − 𝑗)↑𝑃)))
etransclem4.h	⊢ 𝐻 = (𝑗 ∈ (0...𝑀) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃))))
etransclem4.e	⊢ 𝐸 = (𝑥 ∈ 𝐴 ↦ ∏𝑗 ∈ (0...𝑀)((𝐻‘𝑗)‘𝑥))

**Assertion**
Ref	Expression
etransclem4	⊢ (𝜑 → 𝐹 = 𝐸)

Distinct variable groups: 𝐴,𝑗,𝑥 𝑗,𝑀 𝑃,𝑗 𝜑,𝑗,𝑥 Allowed substitution hints: 𝑃(𝑥) 𝐸(𝑥,𝑗) 𝐹(𝑥,𝑗) 𝐻(𝑥,𝑗) 𝑀(𝑥)

**Proof of Theorem etransclem4**
Step	Hyp	Ref	Expression
1		simpr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ (0...𝑀)) → 𝑗 ∈ (0...𝑀))
2		etransclem4.a	. . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ⊆ ℂ)
3		cnex 11193	. . . . . . . . . . 11 ⊢ ℂ ∈ V
4	3	ssex 5321	. . . . . . . . . 10 ⊢ (𝐴 ⊆ ℂ → 𝐴 ∈ V)
5		mptexg 7225	. . . . . . . . . 10 ⊢ (𝐴 ∈ V → (𝑥 ∈ 𝐴 ↦ ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃))) ∈ V)
6	2, 4, 5	3syl 18	. . . . . . . . 9 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃))) ∈ V)
7	6	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ (0...𝑀)) → (𝑥 ∈ 𝐴 ↦ ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃))) ∈ V)
8		etransclem4.h	. . . . . . . . 9 ⊢ 𝐻 = (𝑗 ∈ (0...𝑀) ↦ (𝑥 ∈ 𝐴 ↦ ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃))))
9	8	fvmpt2 7009	. . . . . . . 8 ⊢ ((𝑗 ∈ (0...𝑀) ∧ (𝑥 ∈ 𝐴 ↦ ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃))) ∈ V) → (𝐻‘𝑗) = (𝑥 ∈ 𝐴 ↦ ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃))))
10	1, 7, 9	syl2anc 584	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ (0...𝑀)) → (𝐻‘𝑗) = (𝑥 ∈ 𝐴 ↦ ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃))))
11		ovexd 7446	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑗 ∈ (0...𝑀)) ∧ 𝑥 ∈ 𝐴) → ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃)) ∈ V)
12	10, 11	fvmpt2d 7011	. . . . . 6 ⊢ (((𝜑 ∧ 𝑗 ∈ (0...𝑀)) ∧ 𝑥 ∈ 𝐴) → ((𝐻‘𝑗)‘𝑥) = ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃)))
13	12	an32s 650	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑗 ∈ (0...𝑀)) → ((𝐻‘𝑗)‘𝑥) = ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃)))
14	13	prodeq2dv 15869	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∏𝑗 ∈ (0...𝑀)((𝐻‘𝑗)‘𝑥) = ∏𝑗 ∈ (0...𝑀)((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃)))
15		etransclem4.M	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℕ₀)
16		nn0uz 12866	. . . . . . 7 ⊢ ℕ₀ = (ℤ_≥‘0)
17	15, 16	eleqtrdi 2843	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘0))
18	17	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑀 ∈ (ℤ_≥‘0))
19	2	sselda 3982	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℂ)
20	19	adantr 481	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑗 ∈ (0...𝑀)) → 𝑥 ∈ ℂ)
21		elfzelz 13503	. . . . . . . . 9 ⊢ (𝑗 ∈ (0...𝑀) → 𝑗 ∈ ℤ)
22	21	zcnd 12669	. . . . . . . 8 ⊢ (𝑗 ∈ (0...𝑀) → 𝑗 ∈ ℂ)
23	22	adantl 482	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑗 ∈ (0...𝑀)) → 𝑗 ∈ ℂ)
24	20, 23	subcld 11573	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑗 ∈ (0...𝑀)) → (𝑥 − 𝑗) ∈ ℂ)
25		etransclem4.p	. . . . . . . . 9 ⊢ (𝜑 → 𝑃 ∈ ℕ)
26		nnm1nn0 12515	. . . . . . . . 9 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) ∈ ℕ₀)
27	25, 26	syl 17	. . . . . . . 8 ⊢ (𝜑 → (𝑃 − 1) ∈ ℕ₀)
28	25	nnnn0d 12534	. . . . . . . 8 ⊢ (𝜑 → 𝑃 ∈ ℕ₀)
29	27, 28	ifcld 4574	. . . . . . 7 ⊢ (𝜑 → if(𝑗 = 0, (𝑃 − 1), 𝑃) ∈ ℕ₀)
30	29	ad2antrr 724	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑗 ∈ (0...𝑀)) → if(𝑗 = 0, (𝑃 − 1), 𝑃) ∈ ℕ₀)
31	24, 30	expcld 14113	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑗 ∈ (0...𝑀)) → ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃)) ∈ ℂ)
32		oveq2 7419	. . . . . 6 ⊢ (𝑗 = 0 → (𝑥 − 𝑗) = (𝑥 − 0))
33		iftrue 4534	. . . . . 6 ⊢ (𝑗 = 0 → if(𝑗 = 0, (𝑃 − 1), 𝑃) = (𝑃 − 1))
34	32, 33	oveq12d 7429	. . . . 5 ⊢ (𝑗 = 0 → ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃)) = ((𝑥 − 0)↑(𝑃 − 1)))
35	18, 31, 34	fprod1p 15914	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∏𝑗 ∈ (0...𝑀)((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃)) = (((𝑥 − 0)↑(𝑃 − 1)) · ∏𝑗 ∈ ((0 + 1)...𝑀)((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃))))
36	19	subid1d 11562	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑥 − 0) = 𝑥)
37	36	oveq1d 7426	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑥 − 0)↑(𝑃 − 1)) = (𝑥↑(𝑃 − 1)))
38		0p1e1 12336	. . . . . . . . 9 ⊢ (0 + 1) = 1
39	38	oveq1i 7421	. . . . . . . 8 ⊢ ((0 + 1)...𝑀) = (1...𝑀)
40	39	a1i 11	. . . . . . 7 ⊢ (𝜑 → ((0 + 1)...𝑀) = (1...𝑀))
41		0red 11219	. . . . . . . . . . . . 13 ⊢ (𝑗 ∈ (1...𝑀) → 0 ∈ ℝ)
42		1red 11217	. . . . . . . . . . . . 13 ⊢ (𝑗 ∈ (1...𝑀) → 1 ∈ ℝ)
43		elfzelz 13503	. . . . . . . . . . . . . 14 ⊢ (𝑗 ∈ (1...𝑀) → 𝑗 ∈ ℤ)
44	43	zred 12668	. . . . . . . . . . . . 13 ⊢ (𝑗 ∈ (1...𝑀) → 𝑗 ∈ ℝ)
45		0lt1 11738	. . . . . . . . . . . . . 14 ⊢ 0 < 1
46	45	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝑗 ∈ (1...𝑀) → 0 < 1)
47		elfzle1 13506	. . . . . . . . . . . . 13 ⊢ (𝑗 ∈ (1...𝑀) → 1 ≤ 𝑗)
48	41, 42, 44, 46, 47	ltletrd 11376	. . . . . . . . . . . 12 ⊢ (𝑗 ∈ (1...𝑀) → 0 < 𝑗)
49	48	gt0ne0d 11780	. . . . . . . . . . 11 ⊢ (𝑗 ∈ (1...𝑀) → 𝑗 ≠ 0)
50	49	neneqd 2945	. . . . . . . . . 10 ⊢ (𝑗 ∈ (1...𝑀) → ¬ 𝑗 = 0)
51	50	iffalsed 4539	. . . . . . . . 9 ⊢ (𝑗 ∈ (1...𝑀) → if(𝑗 = 0, (𝑃 − 1), 𝑃) = 𝑃)
52	51	oveq2d 7427	. . . . . . . 8 ⊢ (𝑗 ∈ (1...𝑀) → ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃)) = ((𝑥 − 𝑗)↑𝑃))
53	52	adantl 482	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ (1...𝑀)) → ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃)) = ((𝑥 − 𝑗)↑𝑃))
54	40, 53	prodeq12rdv 15873	. . . . . 6 ⊢ (𝜑 → ∏𝑗 ∈ ((0 + 1)...𝑀)((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃)) = ∏𝑗 ∈ (1...𝑀)((𝑥 − 𝑗)↑𝑃))
55	54	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∏𝑗 ∈ ((0 + 1)...𝑀)((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃)) = ∏𝑗 ∈ (1...𝑀)((𝑥 − 𝑗)↑𝑃))
56	37, 55	oveq12d 7429	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (((𝑥 − 0)↑(𝑃 − 1)) · ∏𝑗 ∈ ((0 + 1)...𝑀)((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃))) = ((𝑥↑(𝑃 − 1)) · ∏𝑗 ∈ (1...𝑀)((𝑥 − 𝑗)↑𝑃)))
57	14, 35, 56	3eqtrrd 2777	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝑥↑(𝑃 − 1)) · ∏𝑗 ∈ (1...𝑀)((𝑥 − 𝑗)↑𝑃)) = ∏𝑗 ∈ (0...𝑀)((𝐻‘𝑗)‘𝑥))
58	57	mpteq2dva 5248	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((𝑥↑(𝑃 − 1)) · ∏𝑗 ∈ (1...𝑀)((𝑥 − 𝑗)↑𝑃))) = (𝑥 ∈ 𝐴 ↦ ∏𝑗 ∈ (0...𝑀)((𝐻‘𝑗)‘𝑥)))
59		etransclem4.f	. 2 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ ((𝑥↑(𝑃 − 1)) · ∏𝑗 ∈ (1...𝑀)((𝑥 − 𝑗)↑𝑃)))
60		etransclem4.e	. 2 ⊢ 𝐸 = (𝑥 ∈ 𝐴 ↦ ∏𝑗 ∈ (0...𝑀)((𝐻‘𝑗)‘𝑥))
61	58, 59, 60	3eqtr4g 2797	1 ⊢ (𝜑 → 𝐹 = 𝐸)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 Vcvv 3474 ⊆ wss 3948 ifcif 4528 class class class wbr 5148 ↦ cmpt 5231 ‘cfv 6543 (class class class)co 7411 ℂcc 11110 0cc0 11112 1c1 11113 + caddc 11115 · cmul 11117 < clt 11250 − cmin 11446 ℕcn 12214 ℕ₀cn0 12474 ℤ_≥cuz 12824 ...cfz 13486 ↑cexp 14029 ∏cprod 15851

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7727 ax-inf2 9638 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-pre-sup 11190

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-se 5632 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-1o 8468 df-er 8705 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-sup 9439 df-oi 9507 df-card 9936 df-pnf 11252 df-mnf 11253 df-xr 11254 df-ltxr 11255 df-le 11256 df-sub 11448 df-neg 11449 df-div 11874 df-nn 12215 df-2 12277 df-3 12278 df-n0 12475 df-z 12561 df-uz 12825 df-rp 12977 df-fz 13487 df-fzo 13630 df-seq 13969 df-exp 14030 df-hash 14293 df-cj 15048 df-re 15049 df-im 15050 df-sqrt 15184 df-abs 15185 df-clim 15434 df-prod 15852

This theorem is referenced by: etransclem13 45048 etransclem29 45064

W3C validator