etransclem27 - Mathbox for Glauco Siliprandi

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

Theorem etransclem27 40478

Description: The 𝑁-th derivative of 𝐹 applied to 𝐽 is an integer. (Contributed by Glauco Siliprandi, 5-Apr-2020.)

**Hypotheses**
Ref	Expression
etransclem27.s	⊢ (𝜑 → 𝑆 ∈ {ℝ, ℂ})
etransclem27.x	⊢ (𝜑 → 𝑋 ∈ ((TopOpen‘ℂ_fld) ↾_t 𝑆))
etransclem27.p	⊢ (𝜑 → 𝑃 ∈ ℕ)
etransclem27.h	⊢ 𝐻 = (𝑗 ∈ (0...𝑀) ↦ (𝑥 ∈ 𝑋 ↦ ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃))))
etransclem27.cfi	⊢ (𝜑 → 𝐶 ∈ Fin)
etransclem27.cf	⊢ (𝜑 → 𝐶:dom 𝐶⟶(ℕ₀ ↑_𝑚 (0...𝑀)))
etransclem27.g	⊢ 𝐺 = (𝑥 ∈ 𝑋 ↦ Σ𝑙 ∈ dom 𝐶∏𝑗 ∈ (0...𝑀)(((𝑆 D^𝑛 (𝐻‘𝑗))‘((𝐶‘𝑙)‘𝑗))‘𝑥))
etransclem27.jx	⊢ (𝜑 → 𝐽 ∈ 𝑋)
etransclem27.jz	⊢ (𝜑 → 𝐽 ∈ ℤ)

**Assertion**
Ref	Expression
etransclem27	⊢ (𝜑 → (𝐺‘𝐽) ∈ ℤ)

Distinct variable groups: 𝐶,𝑗,𝑙,𝑥 𝑥,𝐻 𝑗,𝐽,𝑙,𝑥 𝑗,𝑀,𝑥 𝑃,𝑗,𝑥 𝑥,𝑆 𝑗,𝑋,𝑥 𝜑,𝑗,𝑙,𝑥 Allowed substitution hints: 𝑃(𝑙) 𝑆(𝑗,𝑙) 𝐺(𝑥,𝑗,𝑙) 𝐻(𝑗,𝑙) 𝑀(𝑙) 𝑋(𝑙)

Proof of Theorem etransclem27 Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		etransclem27.g	. . . 4 ⊢ 𝐺 = (𝑥 ∈ 𝑋 ↦ Σ𝑙 ∈ dom 𝐶∏𝑗 ∈ (0...𝑀)(((𝑆 D^𝑛 (𝐻‘𝑗))‘((𝐶‘𝑙)‘𝑗))‘𝑥))
2	1	a1i 11	. . 3 ⊢ (𝜑 → 𝐺 = (𝑥 ∈ 𝑋 ↦ Σ𝑙 ∈ dom 𝐶∏𝑗 ∈ (0...𝑀)(((𝑆 D^𝑛 (𝐻‘𝑗))‘((𝐶‘𝑙)‘𝑗))‘𝑥)))
3		fveq2 6191	. . . . . 6 ⊢ (𝑥 = 𝐽 → (((𝑆 D^𝑛 (𝐻‘𝑗))‘((𝐶‘𝑙)‘𝑗))‘𝑥) = (((𝑆 D^𝑛 (𝐻‘𝑗))‘((𝐶‘𝑙)‘𝑗))‘𝐽))
4	3	prodeq2ad 39824	. . . . 5 ⊢ (𝑥 = 𝐽 → ∏𝑗 ∈ (0...𝑀)(((𝑆 D^𝑛 (𝐻‘𝑗))‘((𝐶‘𝑙)‘𝑗))‘𝑥) = ∏𝑗 ∈ (0...𝑀)(((𝑆 D^𝑛 (𝐻‘𝑗))‘((𝐶‘𝑙)‘𝑗))‘𝐽))
5	4	sumeq2ad 14434	. . . 4 ⊢ (𝑥 = 𝐽 → Σ𝑙 ∈ dom 𝐶∏𝑗 ∈ (0...𝑀)(((𝑆 D^𝑛 (𝐻‘𝑗))‘((𝐶‘𝑙)‘𝑗))‘𝑥) = Σ𝑙 ∈ dom 𝐶∏𝑗 ∈ (0...𝑀)(((𝑆 D^𝑛 (𝐻‘𝑗))‘((𝐶‘𝑙)‘𝑗))‘𝐽))
6	5	adantl 482	. . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐽) → Σ𝑙 ∈ dom 𝐶∏𝑗 ∈ (0...𝑀)(((𝑆 D^𝑛 (𝐻‘𝑗))‘((𝐶‘𝑙)‘𝑗))‘𝑥) = Σ𝑙 ∈ dom 𝐶∏𝑗 ∈ (0...𝑀)(((𝑆 D^𝑛 (𝐻‘𝑗))‘((𝐶‘𝑙)‘𝑗))‘𝐽))
7		etransclem27.jx	. . 3 ⊢ (𝜑 → 𝐽 ∈ 𝑋)
8		etransclem27.cfi	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ Fin)
9		dmfi 8244	. . . . 5 ⊢ (𝐶 ∈ Fin → dom 𝐶 ∈ Fin)
10	8, 9	syl 17	. . . 4 ⊢ (𝜑 → dom 𝐶 ∈ Fin)
11		fzfid 12772	. . . . 5 ⊢ ((𝜑 ∧ 𝑙 ∈ dom 𝐶) → (0...𝑀) ∈ Fin)
12		etransclem27.s	. . . . . . . 8 ⊢ (𝜑 → 𝑆 ∈ {ℝ, ℂ})
13	12	ad2antrr 762	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) → 𝑆 ∈ {ℝ, ℂ})
14		etransclem27.x	. . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ ((TopOpen‘ℂ_fld) ↾_t 𝑆))
15	14	ad2antrr 762	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) → 𝑋 ∈ ((TopOpen‘ℂ_fld) ↾_t 𝑆))
16		etransclem27.p	. . . . . . . 8 ⊢ (𝜑 → 𝑃 ∈ ℕ)
17	16	ad2antrr 762	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) → 𝑃 ∈ ℕ)
18		etransclem27.h	. . . . . . . 8 ⊢ 𝐻 = (𝑗 ∈ (0...𝑀) ↦ (𝑥 ∈ 𝑋 ↦ ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃))))
19		etransclem5 40456	. . . . . . . 8 ⊢ (𝑗 ∈ (0...𝑀) ↦ (𝑥 ∈ 𝑋 ↦ ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃)))) = (𝑧 ∈ (0...𝑀) ↦ (𝑦 ∈ 𝑋 ↦ ((𝑦 − 𝑧)↑if(𝑧 = 0, (𝑃 − 1), 𝑃))))
20	18, 19	eqtri 2644	. . . . . . 7 ⊢ 𝐻 = (𝑧 ∈ (0...𝑀) ↦ (𝑦 ∈ 𝑋 ↦ ((𝑦 − 𝑧)↑if(𝑧 = 0, (𝑃 − 1), 𝑃))))
21		simpr 477	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) → 𝑗 ∈ (0...𝑀))
22		etransclem27.cf	. . . . . . . . . 10 ⊢ (𝜑 → 𝐶:dom 𝐶⟶(ℕ₀ ↑_𝑚 (0...𝑀)))
23	22	ffvelrnda 6359	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑙 ∈ dom 𝐶) → (𝐶‘𝑙) ∈ (ℕ₀ ↑_𝑚 (0...𝑀)))
24		elmapi 7879	. . . . . . . . 9 ⊢ ((𝐶‘𝑙) ∈ (ℕ₀ ↑_𝑚 (0...𝑀)) → (𝐶‘𝑙):(0...𝑀)⟶ℕ₀)
25	23, 24	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑙 ∈ dom 𝐶) → (𝐶‘𝑙):(0...𝑀)⟶ℕ₀)
26	25	ffvelrnda 6359	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) → ((𝐶‘𝑙)‘𝑗) ∈ ℕ₀)
27	13, 15, 17, 20, 21, 26	etransclem20 40471	. . . . . 6 ⊢ (((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) → ((𝑆 D^𝑛 (𝐻‘𝑗))‘((𝐶‘𝑙)‘𝑗)):𝑋⟶ℂ)
28	7	ad2antrr 762	. . . . . 6 ⊢ (((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) → 𝐽 ∈ 𝑋)
29	27, 28	ffvelrnd 6360	. . . . 5 ⊢ (((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) → (((𝑆 D^𝑛 (𝐻‘𝑗))‘((𝐶‘𝑙)‘𝑗))‘𝐽) ∈ ℂ)
30	11, 29	fprodcl 14682	. . . 4 ⊢ ((𝜑 ∧ 𝑙 ∈ dom 𝐶) → ∏𝑗 ∈ (0...𝑀)(((𝑆 D^𝑛 (𝐻‘𝑗))‘((𝐶‘𝑙)‘𝑗))‘𝐽) ∈ ℂ)
31	10, 30	fsumcl 14464	. . 3 ⊢ (𝜑 → Σ𝑙 ∈ dom 𝐶∏𝑗 ∈ (0...𝑀)(((𝑆 D^𝑛 (𝐻‘𝑗))‘((𝐶‘𝑙)‘𝑗))‘𝐽) ∈ ℂ)
32	2, 6, 7, 31	fvmptd 6288	. 2 ⊢ (𝜑 → (𝐺‘𝐽) = Σ𝑙 ∈ dom 𝐶∏𝑗 ∈ (0...𝑀)(((𝑆 D^𝑛 (𝐻‘𝑗))‘((𝐶‘𝑙)‘𝑗))‘𝐽))
33	13, 15, 17, 20, 21, 26, 28	etransclem21 40472	. . . . 5 ⊢ (((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) → (((𝑆 D^𝑛 (𝐻‘𝑗))‘((𝐶‘𝑙)‘𝑗))‘𝐽) = if(if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗), 0, (((!‘if(𝑗 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)))) · ((𝐽 − 𝑗)↑(if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗))))))
34		iftrue 4092	. . . . . . . 8 ⊢ (if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗) → if(if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗), 0, (((!‘if(𝑗 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)))) · ((𝐽 − 𝑗)↑(if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗))))) = 0)
35		0zd 11389	. . . . . . . 8 ⊢ (if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗) → 0 ∈ ℤ)
36	34, 35	eqeltrd 2701	. . . . . . 7 ⊢ (if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗) → if(if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗), 0, (((!‘if(𝑗 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)))) · ((𝐽 − 𝑗)↑(if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗))))) ∈ ℤ)
37	36	adantl 482	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → if(if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗), 0, (((!‘if(𝑗 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)))) · ((𝐽 − 𝑗)↑(if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗))))) ∈ ℤ)
38		0zd 11389	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → 0 ∈ ℤ)
39		nnm1nn0 11334	. . . . . . . . . . . . . . . . 17 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) ∈ ℕ₀)
40	16, 39	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝑃 − 1) ∈ ℕ₀)
41	16	nnnn0d 11351	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝑃 ∈ ℕ₀)
42	40, 41	ifcld 4131	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → if(𝑗 = 0, (𝑃 − 1), 𝑃) ∈ ℕ₀)
43	42	nn0zd 11480	. . . . . . . . . . . . . 14 ⊢ (𝜑 → if(𝑗 = 0, (𝑃 − 1), 𝑃) ∈ ℤ)
44	43	ad3antrrr 766	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → if(𝑗 = 0, (𝑃 − 1), 𝑃) ∈ ℤ)
45	26	nn0zd 11480	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) → ((𝐶‘𝑙)‘𝑗) ∈ ℤ)
46	45	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → ((𝐶‘𝑙)‘𝑗) ∈ ℤ)
47	44, 46	zsubcld 11487	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → (if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)) ∈ ℤ)
48	38, 44, 47	3jca 1242	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → (0 ∈ ℤ ∧ if(𝑗 = 0, (𝑃 − 1), 𝑃) ∈ ℤ ∧ (if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)) ∈ ℤ))
49	46	zred 11482	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → ((𝐶‘𝑙)‘𝑗) ∈ ℝ)
50	44	zred 11482	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → if(𝑗 = 0, (𝑃 − 1), 𝑃) ∈ ℝ)
51		simpr 477	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗))
52	49, 50, 51	nltled 10187	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → ((𝐶‘𝑙)‘𝑗) ≤ if(𝑗 = 0, (𝑃 − 1), 𝑃))
53	50, 49	subge0d 10617	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → (0 ≤ (if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)) ↔ ((𝐶‘𝑙)‘𝑗) ≤ if(𝑗 = 0, (𝑃 − 1), 𝑃)))
54	52, 53	mpbird 247	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → 0 ≤ (if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)))
55		0red 10041	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) → 0 ∈ ℝ)
56	26	nn0red 11352	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) → ((𝐶‘𝑙)‘𝑗) ∈ ℝ)
57	42	nn0red 11352	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → if(𝑗 = 0, (𝑃 − 1), 𝑃) ∈ ℝ)
58	57	ad2antrr 762	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) → if(𝑗 = 0, (𝑃 − 1), 𝑃) ∈ ℝ)
59	26	nn0ge0d 11354	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) → 0 ≤ ((𝐶‘𝑙)‘𝑗))
60	55, 56, 58, 59	lesub2dd 10644	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) → (if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)) ≤ (if(𝑗 = 0, (𝑃 − 1), 𝑃) − 0))
61	58	recnd 10068	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) → if(𝑗 = 0, (𝑃 − 1), 𝑃) ∈ ℂ)
62	61	subid1d 10381	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) → (if(𝑗 = 0, (𝑃 − 1), 𝑃) − 0) = if(𝑗 = 0, (𝑃 − 1), 𝑃))
63	60, 62	breqtrd 4679	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) → (if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)) ≤ if(𝑗 = 0, (𝑃 − 1), 𝑃))
64	63	adantr 481	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → (if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)) ≤ if(𝑗 = 0, (𝑃 − 1), 𝑃))
65	48, 54, 64	jca32 558	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → ((0 ∈ ℤ ∧ if(𝑗 = 0, (𝑃 − 1), 𝑃) ∈ ℤ ∧ (if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)) ∈ ℤ) ∧ (0 ≤ (if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)) ∧ (if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)) ≤ if(𝑗 = 0, (𝑃 − 1), 𝑃))))
66		elfz2 12333	. . . . . . . . . . 11 ⊢ ((if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)) ∈ (0...if(𝑗 = 0, (𝑃 − 1), 𝑃)) ↔ ((0 ∈ ℤ ∧ if(𝑗 = 0, (𝑃 − 1), 𝑃) ∈ ℤ ∧ (if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)) ∈ ℤ) ∧ (0 ≤ (if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)) ∧ (if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)) ≤ if(𝑗 = 0, (𝑃 − 1), 𝑃))))
67	65, 66	sylibr 224	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → (if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)) ∈ (0...if(𝑗 = 0, (𝑃 − 1), 𝑃)))
68		permnn 13113	. . . . . . . . . 10 ⊢ ((if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)) ∈ (0...if(𝑗 = 0, (𝑃 − 1), 𝑃)) → ((!‘if(𝑗 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)))) ∈ ℕ)
69	67, 68	syl 17	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → ((!‘if(𝑗 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)))) ∈ ℕ)
70	69	nnzd 11481	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → ((!‘if(𝑗 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)))) ∈ ℤ)
71		etransclem27.jz	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐽 ∈ ℤ)
72	71	ad3antrrr 766	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → 𝐽 ∈ ℤ)
73		elfzelz 12342	. . . . . . . . . . 11 ⊢ (𝑗 ∈ (0...𝑀) → 𝑗 ∈ ℤ)
74	73	ad2antlr 763	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → 𝑗 ∈ ℤ)
75	72, 74	zsubcld 11487	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → (𝐽 − 𝑗) ∈ ℤ)
76		elnn0z 11390	. . . . . . . . . 10 ⊢ ((if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)) ∈ ℕ₀ ↔ ((if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)) ∈ ℤ ∧ 0 ≤ (if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗))))
77	47, 54, 76	sylanbrc 698	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → (if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)) ∈ ℕ₀)
78		zexpcl 12875	. . . . . . . . 9 ⊢ (((𝐽 − 𝑗) ∈ ℤ ∧ (if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)) ∈ ℕ₀) → ((𝐽 − 𝑗)↑(if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗))) ∈ ℤ)
79	75, 77, 78	syl2anc 693	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → ((𝐽 − 𝑗)↑(if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗))) ∈ ℤ)
80	70, 79	zmulcld 11488	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → (((!‘if(𝑗 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)))) · ((𝐽 − 𝑗)↑(if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)))) ∈ ℤ)
81	38, 80	ifcld 4131	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) ∧ ¬ if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗)) → if(if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗), 0, (((!‘if(𝑗 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)))) · ((𝐽 − 𝑗)↑(if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗))))) ∈ ℤ)
82	37, 81	pm2.61dan 832	. . . . 5 ⊢ (((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) → if(if(𝑗 = 0, (𝑃 − 1), 𝑃) < ((𝐶‘𝑙)‘𝑗), 0, (((!‘if(𝑗 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗)))) · ((𝐽 − 𝑗)↑(if(𝑗 = 0, (𝑃 − 1), 𝑃) − ((𝐶‘𝑙)‘𝑗))))) ∈ ℤ)
83	33, 82	eqeltrd 2701	. . . 4 ⊢ (((𝜑 ∧ 𝑙 ∈ dom 𝐶) ∧ 𝑗 ∈ (0...𝑀)) → (((𝑆 D^𝑛 (𝐻‘𝑗))‘((𝐶‘𝑙)‘𝑗))‘𝐽) ∈ ℤ)
84	11, 83	fprodzcl 14684	. . 3 ⊢ ((𝜑 ∧ 𝑙 ∈ dom 𝐶) → ∏𝑗 ∈ (0...𝑀)(((𝑆 D^𝑛 (𝐻‘𝑗))‘((𝐶‘𝑙)‘𝑗))‘𝐽) ∈ ℤ)
85	10, 84	fsumzcl 14466	. 2 ⊢ (𝜑 → Σ𝑙 ∈ dom 𝐶∏𝑗 ∈ (0...𝑀)(((𝑆 D^𝑛 (𝐻‘𝑗))‘((𝐶‘𝑙)‘𝑗))‘𝐽) ∈ ℤ)
86	32, 85	eqeltrd 2701	1 ⊢ (𝜑 → (𝐺‘𝐽) ∈ ℤ)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ifcif 4086 {cpr 4179 class class class wbr 4653 ↦ cmpt 4729 dom cdm 5114 ⟶wf 5884 ‘cfv 5888 (class class class)co 6650 ↑_𝑚 cmap 7857 Fincfn 7955 ℂcc 9934 ℝcr 9935 0cc0 9936 1c1 9937 · cmul 9941 < clt 10074 ≤ cle 10075 − cmin 10266 / cdiv 10684 ℕcn 11020 ℕ₀cn0 11292 ℤcz 11377 ...cfz 12326 ↑cexp 12860 !cfa 13060 Σcsu 14416 ∏cprod 14635 ↾_t crest 16081 TopOpenctopn 16082 ℂ_fldccnfld 19746 D^𝑛 cdvn 23628

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-inf2 8538 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-pre-sup 10014 ax-addf 10015 ax-mulf 10016

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-fal 1489 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-iin 4523 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-se 5074 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-isom 5897 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-of 6897 df-om 7066 df-1st 7168 df-2nd 7169 df-supp 7296 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-2o 7561 df-oadd 7564 df-er 7742 df-map 7859 df-pm 7860 df-ixp 7909 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-fsupp 8276 df-fi 8317 df-sup 8348 df-inf 8349 df-oi 8415 df-card 8765 df-cda 8990 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-2 11079 df-3 11080 df-4 11081 df-5 11082 df-6 11083 df-7 11084 df-8 11085 df-9 11086 df-n0 11293 df-z 11378 df-dec 11494 df-uz 11688 df-q 11789 df-rp 11833 df-xneg 11946 df-xadd 11947 df-xmul 11948 df-icc 12182 df-fz 12327 df-fzo 12466 df-seq 12802 df-exp 12861 df-fac 13061 df-bc 13090 df-hash 13118 df-cj 13839 df-re 13840 df-im 13841 df-sqrt 13975 df-abs 13976 df-clim 14219 df-sum 14417 df-prod 14636 df-struct 15859 df-ndx 15860 df-slot 15861 df-base 15863 df-sets 15864 df-ress 15865 df-plusg 15954 df-mulr 15955 df-starv 15956 df-sca 15957 df-vsca 15958 df-ip 15959 df-tset 15960 df-ple 15961 df-ds 15964 df-unif 15965 df-hom 15966 df-cco 15967 df-rest 16083 df-topn 16084 df-0g 16102 df-gsum 16103 df-topgen 16104 df-pt 16105 df-prds 16108 df-xrs 16162 df-qtop 16167 df-imas 16168 df-xps 16170 df-mre 16246 df-mrc 16247 df-acs 16249 df-mgm 17242 df-sgrp 17284 df-mnd 17295 df-submnd 17336 df-mulg 17541 df-cntz 17750 df-cmn 18195 df-psmet 19738 df-xmet 19739 df-met 19740 df-bl 19741 df-mopn 19742 df-fbas 19743 df-fg 19744 df-cnfld 19747 df-top 20699 df-topon 20716 df-topsp 20737 df-bases 20750 df-cld 20823 df-ntr 20824 df-cls 20825 df-nei 20902 df-lp 20940 df-perf 20941 df-cn 21031 df-cnp 21032 df-haus 21119 df-tx 21365 df-hmeo 21558 df-fil 21650 df-fm 21742 df-flim 21743 df-flf 21744 df-xms 22125 df-ms 22126 df-tms 22127 df-cncf 22681 df-limc 23630 df-dv 23631 df-dvn 23632

This theorem is referenced by: (None)

W3C validator