mettrifi - Mathbox for Jeff Madsen

	Mathbox for Jeff Madsen		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > mettrifi		Structured version Visualization version GIF version

Theorem mettrifi 37751

Description: Generalized triangle inequality for arbitrary finite sums. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 4-Jun-2014.)

**Hypotheses**
Ref	Expression
mettrifi.2	⊢ (𝜑 → 𝐷 ∈ (Met‘𝑋))
mettrifi.3	⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
mettrifi.4	⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) ∈ 𝑋)

**Assertion**
Ref	Expression
mettrifi	⊢ (𝜑 → ((𝐹‘𝑀)𝐷(𝐹‘𝑁)) ≤ Σ𝑘 ∈ (𝑀...(𝑁 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))

Distinct variable groups: 𝐷,𝑘 𝑘,𝐹 𝑘,𝑀 𝑘,𝑁 𝜑,𝑘 𝑘,𝑋

Proof of Theorem mettrifi Dummy variables 𝑛 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mettrifi.3	. . 3 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
2		eluzfz2 13493	. . 3 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑁 ∈ (𝑀...𝑁))
3	1, 2	syl 17	. 2 ⊢ (𝜑 → 𝑁 ∈ (𝑀...𝑁))
4		eleq1 2816	. . . . . 6 ⊢ (𝑥 = 𝑀 → (𝑥 ∈ (𝑀...𝑁) ↔ 𝑀 ∈ (𝑀...𝑁)))
5		fveq2 6858	. . . . . . . 8 ⊢ (𝑥 = 𝑀 → (𝐹‘𝑥) = (𝐹‘𝑀))
6	5	oveq2d 7403	. . . . . . 7 ⊢ (𝑥 = 𝑀 → ((𝐹‘𝑀)𝐷(𝐹‘𝑥)) = ((𝐹‘𝑀)𝐷(𝐹‘𝑀)))
7		oveq1 7394	. . . . . . . . 9 ⊢ (𝑥 = 𝑀 → (𝑥 − 1) = (𝑀 − 1))
8	7	oveq2d 7403	. . . . . . . 8 ⊢ (𝑥 = 𝑀 → (𝑀...(𝑥 − 1)) = (𝑀...(𝑀 − 1)))
9	8	sumeq1d 15666	. . . . . . 7 ⊢ (𝑥 = 𝑀 → Σ𝑘 ∈ (𝑀...(𝑥 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) = Σ𝑘 ∈ (𝑀...(𝑀 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))
10	6, 9	breq12d 5120	. . . . . 6 ⊢ (𝑥 = 𝑀 → (((𝐹‘𝑀)𝐷(𝐹‘𝑥)) ≤ Σ𝑘 ∈ (𝑀...(𝑥 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ↔ ((𝐹‘𝑀)𝐷(𝐹‘𝑀)) ≤ Σ𝑘 ∈ (𝑀...(𝑀 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))))
11	4, 10	imbi12d 344	. . . . 5 ⊢ (𝑥 = 𝑀 → ((𝑥 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑥)) ≤ Σ𝑘 ∈ (𝑀...(𝑥 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))) ↔ (𝑀 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑀)) ≤ Σ𝑘 ∈ (𝑀...(𝑀 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))))
12	11	imbi2d 340	. . . 4 ⊢ (𝑥 = 𝑀 → ((𝜑 → (𝑥 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑥)) ≤ Σ𝑘 ∈ (𝑀...(𝑥 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))) ↔ (𝜑 → (𝑀 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑀)) ≤ Σ𝑘 ∈ (𝑀...(𝑀 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))))))
13		eleq1 2816	. . . . . 6 ⊢ (𝑥 = 𝑛 → (𝑥 ∈ (𝑀...𝑁) ↔ 𝑛 ∈ (𝑀...𝑁)))
14		fveq2 6858	. . . . . . . 8 ⊢ (𝑥 = 𝑛 → (𝐹‘𝑥) = (𝐹‘𝑛))
15	14	oveq2d 7403	. . . . . . 7 ⊢ (𝑥 = 𝑛 → ((𝐹‘𝑀)𝐷(𝐹‘𝑥)) = ((𝐹‘𝑀)𝐷(𝐹‘𝑛)))
16		oveq1 7394	. . . . . . . . 9 ⊢ (𝑥 = 𝑛 → (𝑥 − 1) = (𝑛 − 1))
17	16	oveq2d 7403	. . . . . . . 8 ⊢ (𝑥 = 𝑛 → (𝑀...(𝑥 − 1)) = (𝑀...(𝑛 − 1)))
18	17	sumeq1d 15666	. . . . . . 7 ⊢ (𝑥 = 𝑛 → Σ𝑘 ∈ (𝑀...(𝑥 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) = Σ𝑘 ∈ (𝑀...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))
19	15, 18	breq12d 5120	. . . . . 6 ⊢ (𝑥 = 𝑛 → (((𝐹‘𝑀)𝐷(𝐹‘𝑥)) ≤ Σ𝑘 ∈ (𝑀...(𝑥 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ↔ ((𝐹‘𝑀)𝐷(𝐹‘𝑛)) ≤ Σ𝑘 ∈ (𝑀...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))))
20	13, 19	imbi12d 344	. . . . 5 ⊢ (𝑥 = 𝑛 → ((𝑥 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑥)) ≤ Σ𝑘 ∈ (𝑀...(𝑥 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))) ↔ (𝑛 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑛)) ≤ Σ𝑘 ∈ (𝑀...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))))
21	20	imbi2d 340	. . . 4 ⊢ (𝑥 = 𝑛 → ((𝜑 → (𝑥 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑥)) ≤ Σ𝑘 ∈ (𝑀...(𝑥 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))) ↔ (𝜑 → (𝑛 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑛)) ≤ Σ𝑘 ∈ (𝑀...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))))))
22		eleq1 2816	. . . . . 6 ⊢ (𝑥 = (𝑛 + 1) → (𝑥 ∈ (𝑀...𝑁) ↔ (𝑛 + 1) ∈ (𝑀...𝑁)))
23		fveq2 6858	. . . . . . . 8 ⊢ (𝑥 = (𝑛 + 1) → (𝐹‘𝑥) = (𝐹‘(𝑛 + 1)))
24	23	oveq2d 7403	. . . . . . 7 ⊢ (𝑥 = (𝑛 + 1) → ((𝐹‘𝑀)𝐷(𝐹‘𝑥)) = ((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))))
25		oveq1 7394	. . . . . . . . 9 ⊢ (𝑥 = (𝑛 + 1) → (𝑥 − 1) = ((𝑛 + 1) − 1))
26	25	oveq2d 7403	. . . . . . . 8 ⊢ (𝑥 = (𝑛 + 1) → (𝑀...(𝑥 − 1)) = (𝑀...((𝑛 + 1) − 1)))
27	26	sumeq1d 15666	. . . . . . 7 ⊢ (𝑥 = (𝑛 + 1) → Σ𝑘 ∈ (𝑀...(𝑥 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) = Σ𝑘 ∈ (𝑀...((𝑛 + 1) − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))
28	24, 27	breq12d 5120	. . . . . 6 ⊢ (𝑥 = (𝑛 + 1) → (((𝐹‘𝑀)𝐷(𝐹‘𝑥)) ≤ Σ𝑘 ∈ (𝑀...(𝑥 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ↔ ((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ≤ Σ𝑘 ∈ (𝑀...((𝑛 + 1) − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))))
29	22, 28	imbi12d 344	. . . . 5 ⊢ (𝑥 = (𝑛 + 1) → ((𝑥 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑥)) ≤ Σ𝑘 ∈ (𝑀...(𝑥 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))) ↔ ((𝑛 + 1) ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ≤ Σ𝑘 ∈ (𝑀...((𝑛 + 1) − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))))
30	29	imbi2d 340	. . . 4 ⊢ (𝑥 = (𝑛 + 1) → ((𝜑 → (𝑥 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑥)) ≤ Σ𝑘 ∈ (𝑀...(𝑥 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))) ↔ (𝜑 → ((𝑛 + 1) ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ≤ Σ𝑘 ∈ (𝑀...((𝑛 + 1) − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))))))
31		eleq1 2816	. . . . . 6 ⊢ (𝑥 = 𝑁 → (𝑥 ∈ (𝑀...𝑁) ↔ 𝑁 ∈ (𝑀...𝑁)))
32		fveq2 6858	. . . . . . . 8 ⊢ (𝑥 = 𝑁 → (𝐹‘𝑥) = (𝐹‘𝑁))
33	32	oveq2d 7403	. . . . . . 7 ⊢ (𝑥 = 𝑁 → ((𝐹‘𝑀)𝐷(𝐹‘𝑥)) = ((𝐹‘𝑀)𝐷(𝐹‘𝑁)))
34		oveq1 7394	. . . . . . . . 9 ⊢ (𝑥 = 𝑁 → (𝑥 − 1) = (𝑁 − 1))
35	34	oveq2d 7403	. . . . . . . 8 ⊢ (𝑥 = 𝑁 → (𝑀...(𝑥 − 1)) = (𝑀...(𝑁 − 1)))
36	35	sumeq1d 15666	. . . . . . 7 ⊢ (𝑥 = 𝑁 → Σ𝑘 ∈ (𝑀...(𝑥 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) = Σ𝑘 ∈ (𝑀...(𝑁 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))
37	33, 36	breq12d 5120	. . . . . 6 ⊢ (𝑥 = 𝑁 → (((𝐹‘𝑀)𝐷(𝐹‘𝑥)) ≤ Σ𝑘 ∈ (𝑀...(𝑥 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ↔ ((𝐹‘𝑀)𝐷(𝐹‘𝑁)) ≤ Σ𝑘 ∈ (𝑀...(𝑁 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))))
38	31, 37	imbi12d 344	. . . . 5 ⊢ (𝑥 = 𝑁 → ((𝑥 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑥)) ≤ Σ𝑘 ∈ (𝑀...(𝑥 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))) ↔ (𝑁 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑁)) ≤ Σ𝑘 ∈ (𝑀...(𝑁 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))))
39	38	imbi2d 340	. . . 4 ⊢ (𝑥 = 𝑁 → ((𝜑 → (𝑥 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑥)) ≤ Σ𝑘 ∈ (𝑀...(𝑥 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))) ↔ (𝜑 → (𝑁 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑁)) ≤ Σ𝑘 ∈ (𝑀...(𝑁 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))))))
40		0le0 12287	. . . . . . . 8 ⊢ 0 ≤ 0
41	40	a1i 11	. . . . . . 7 ⊢ (𝜑 → 0 ≤ 0)
42		mettrifi.2	. . . . . . . 8 ⊢ (𝜑 → 𝐷 ∈ (Met‘𝑋))
43		eluzfz1 13492	. . . . . . . . . 10 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ (𝑀...𝑁))
44	1, 43	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ (𝑀...𝑁))
45		mettrifi.4	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) ∈ 𝑋)
46	45	ralrimiva 3125	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑘 ∈ (𝑀...𝑁)(𝐹‘𝑘) ∈ 𝑋)
47		fveq2 6858	. . . . . . . . . . 11 ⊢ (𝑘 = 𝑀 → (𝐹‘𝑘) = (𝐹‘𝑀))
48	47	eleq1d 2813	. . . . . . . . . 10 ⊢ (𝑘 = 𝑀 → ((𝐹‘𝑘) ∈ 𝑋 ↔ (𝐹‘𝑀) ∈ 𝑋))
49	48	rspcv 3584	. . . . . . . . 9 ⊢ (𝑀 ∈ (𝑀...𝑁) → (∀𝑘 ∈ (𝑀...𝑁)(𝐹‘𝑘) ∈ 𝑋 → (𝐹‘𝑀) ∈ 𝑋))
50	44, 46, 49	sylc 65	. . . . . . . 8 ⊢ (𝜑 → (𝐹‘𝑀) ∈ 𝑋)
51		met0 24231	. . . . . . . 8 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐹‘𝑀) ∈ 𝑋) → ((𝐹‘𝑀)𝐷(𝐹‘𝑀)) = 0)
52	42, 50, 51	syl2anc 584	. . . . . . 7 ⊢ (𝜑 → ((𝐹‘𝑀)𝐷(𝐹‘𝑀)) = 0)
53		eluzel2 12798	. . . . . . . . . . . . 13 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ ℤ)
54	1, 53	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑀 ∈ ℤ)
55	54	zred 12638	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑀 ∈ ℝ)
56	55	ltm1d 12115	. . . . . . . . . 10 ⊢ (𝜑 → (𝑀 − 1) < 𝑀)
57		peano2zm 12576	. . . . . . . . . . 11 ⊢ (𝑀 ∈ ℤ → (𝑀 − 1) ∈ ℤ)
58		fzn 13501	. . . . . . . . . . 11 ⊢ ((𝑀 ∈ ℤ ∧ (𝑀 − 1) ∈ ℤ) → ((𝑀 − 1) < 𝑀 ↔ (𝑀...(𝑀 − 1)) = ∅))
59	54, 57, 58	syl2anc2 585	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑀 − 1) < 𝑀 ↔ (𝑀...(𝑀 − 1)) = ∅))
60	56, 59	mpbid 232	. . . . . . . . 9 ⊢ (𝜑 → (𝑀...(𝑀 − 1)) = ∅)
61	60	sumeq1d 15666	. . . . . . . 8 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...(𝑀 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) = Σ𝑘 ∈ ∅ ((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))
62		sum0 15687	. . . . . . . 8 ⊢ Σ𝑘 ∈ ∅ ((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) = 0
63	61, 62	eqtrdi 2780	. . . . . . 7 ⊢ (𝜑 → Σ𝑘 ∈ (𝑀...(𝑀 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) = 0)
64	41, 52, 63	3brtr4d 5139	. . . . . 6 ⊢ (𝜑 → ((𝐹‘𝑀)𝐷(𝐹‘𝑀)) ≤ Σ𝑘 ∈ (𝑀...(𝑀 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))
65	64	a1d 25	. . . . 5 ⊢ (𝜑 → (𝑀 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑀)) ≤ Σ𝑘 ∈ (𝑀...(𝑀 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))))
66	65	a1i 11	. . . 4 ⊢ (𝑀 ∈ ℤ → (𝜑 → (𝑀 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑀)) ≤ Σ𝑘 ∈ (𝑀...(𝑀 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))))
67		peano2fzr 13498	. . . . . . . . . 10 ⊢ ((𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → 𝑛 ∈ (𝑀...𝑁))
68	67	ex 412	. . . . . . . . 9 ⊢ (𝑛 ∈ (ℤ_≥‘𝑀) → ((𝑛 + 1) ∈ (𝑀...𝑁) → 𝑛 ∈ (𝑀...𝑁)))
69	68	adantl 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀)) → ((𝑛 + 1) ∈ (𝑀...𝑁) → 𝑛 ∈ (𝑀...𝑁)))
70	69	imim1d 82	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀)) → ((𝑛 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑛)) ≤ Σ𝑘 ∈ (𝑀...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))) → ((𝑛 + 1) ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑛)) ≤ Σ𝑘 ∈ (𝑀...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))))
71	42	3ad2ant1 1133	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → 𝐷 ∈ (Met‘𝑋))
72	50	3ad2ant1 1133	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → (𝐹‘𝑀) ∈ 𝑋)
73		simp3 1138	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → (𝑛 + 1) ∈ (𝑀...𝑁))
74	46	3ad2ant1 1133	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → ∀𝑘 ∈ (𝑀...𝑁)(𝐹‘𝑘) ∈ 𝑋)
75		fveq2 6858	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = (𝑛 + 1) → (𝐹‘𝑘) = (𝐹‘(𝑛 + 1)))
76	75	eleq1d 2813	. . . . . . . . . . . . . 14 ⊢ (𝑘 = (𝑛 + 1) → ((𝐹‘𝑘) ∈ 𝑋 ↔ (𝐹‘(𝑛 + 1)) ∈ 𝑋))
77	76	rspcv 3584	. . . . . . . . . . . . 13 ⊢ ((𝑛 + 1) ∈ (𝑀...𝑁) → (∀𝑘 ∈ (𝑀...𝑁)(𝐹‘𝑘) ∈ 𝑋 → (𝐹‘(𝑛 + 1)) ∈ 𝑋))
78	73, 74, 77	sylc 65	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → (𝐹‘(𝑛 + 1)) ∈ 𝑋)
79		fveq2 6858	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 = 𝑛 → (𝐹‘𝑘) = (𝐹‘𝑛))
80	79	eleq1d 2813	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑛 → ((𝐹‘𝑘) ∈ 𝑋 ↔ (𝐹‘𝑛) ∈ 𝑋))
81	80	cbvralvw 3215	. . . . . . . . . . . . . 14 ⊢ (∀𝑘 ∈ (𝑀...𝑁)(𝐹‘𝑘) ∈ 𝑋 ↔ ∀𝑛 ∈ (𝑀...𝑁)(𝐹‘𝑛) ∈ 𝑋)
82	74, 81	sylib 218	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → ∀𝑛 ∈ (𝑀...𝑁)(𝐹‘𝑛) ∈ 𝑋)
83	69	3impia 1117	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → 𝑛 ∈ (𝑀...𝑁))
84		rsp 3225	. . . . . . . . . . . . 13 ⊢ (∀𝑛 ∈ (𝑀...𝑁)(𝐹‘𝑛) ∈ 𝑋 → (𝑛 ∈ (𝑀...𝑁) → (𝐹‘𝑛) ∈ 𝑋))
85	82, 83, 84	sylc 65	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → (𝐹‘𝑛) ∈ 𝑋)
86		mettri 24240	. . . . . . . . . . . 12 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ ((𝐹‘𝑀) ∈ 𝑋 ∧ (𝐹‘(𝑛 + 1)) ∈ 𝑋 ∧ (𝐹‘𝑛) ∈ 𝑋)) → ((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ≤ (((𝐹‘𝑀)𝐷(𝐹‘𝑛)) + ((𝐹‘𝑛)𝐷(𝐹‘(𝑛 + 1)))))
87	71, 72, 78, 85, 86	syl13anc 1374	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → ((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ≤ (((𝐹‘𝑀)𝐷(𝐹‘𝑛)) + ((𝐹‘𝑛)𝐷(𝐹‘(𝑛 + 1)))))
88		metcl 24220	. . . . . . . . . . . . 13 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐹‘𝑀) ∈ 𝑋 ∧ (𝐹‘(𝑛 + 1)) ∈ 𝑋) → ((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ∈ ℝ)
89	71, 72, 78, 88	syl3anc 1373	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → ((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ∈ ℝ)
90		metcl 24220	. . . . . . . . . . . . . 14 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐹‘𝑀) ∈ 𝑋 ∧ (𝐹‘𝑛) ∈ 𝑋) → ((𝐹‘𝑀)𝐷(𝐹‘𝑛)) ∈ ℝ)
91	71, 72, 85, 90	syl3anc 1373	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → ((𝐹‘𝑀)𝐷(𝐹‘𝑛)) ∈ ℝ)
92		metcl 24220	. . . . . . . . . . . . . 14 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐹‘𝑛) ∈ 𝑋 ∧ (𝐹‘(𝑛 + 1)) ∈ 𝑋) → ((𝐹‘𝑛)𝐷(𝐹‘(𝑛 + 1))) ∈ ℝ)
93	71, 85, 78, 92	syl3anc 1373	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → ((𝐹‘𝑛)𝐷(𝐹‘(𝑛 + 1))) ∈ ℝ)
94	91, 93	readdcld 11203	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → (((𝐹‘𝑀)𝐷(𝐹‘𝑛)) + ((𝐹‘𝑛)𝐷(𝐹‘(𝑛 + 1)))) ∈ ℝ)
95		fzfid 13938	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → (𝑀...𝑛) ∈ Fin)
96	71	adantr 480	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) ∧ 𝑘 ∈ (𝑀...𝑛)) → 𝐷 ∈ (Met‘𝑋))
97		elfzuz3 13482	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (𝑀...𝑁) → 𝑁 ∈ (ℤ_≥‘𝑛))
98	83, 97	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → 𝑁 ∈ (ℤ_≥‘𝑛))
99		fzss2 13525	. . . . . . . . . . . . . . . . 17 ⊢ (𝑁 ∈ (ℤ_≥‘𝑛) → (𝑀...𝑛) ⊆ (𝑀...𝑁))
100	98, 99	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → (𝑀...𝑛) ⊆ (𝑀...𝑁))
101	100	sselda 3946	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) ∧ 𝑘 ∈ (𝑀...𝑛)) → 𝑘 ∈ (𝑀...𝑁))
102	45	3ad2antl1 1186	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) ∧ 𝑘 ∈ (𝑀...𝑁)) → (𝐹‘𝑘) ∈ 𝑋)
103	101, 102	syldan 591	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐹‘𝑘) ∈ 𝑋)
104		elfzuz 13481	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ (𝑀...𝑛) → 𝑘 ∈ (ℤ_≥‘𝑀))
105	104	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) ∧ 𝑘 ∈ (𝑀...𝑛)) → 𝑘 ∈ (ℤ_≥‘𝑀))
106		peano2uz 12860	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (ℤ_≥‘𝑀) → (𝑘 + 1) ∈ (ℤ_≥‘𝑀))
107	105, 106	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝑘 + 1) ∈ (ℤ_≥‘𝑀))
108		elfzuz3 13482	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑛 + 1) ∈ (𝑀...𝑁) → 𝑁 ∈ (ℤ_≥‘(𝑛 + 1)))
109	73, 108	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → 𝑁 ∈ (ℤ_≥‘(𝑛 + 1)))
110	109	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) ∧ 𝑘 ∈ (𝑀...𝑛)) → 𝑁 ∈ (ℤ_≥‘(𝑛 + 1)))
111		elfzuz3 13482	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ (𝑀...𝑛) → 𝑛 ∈ (ℤ_≥‘𝑘))
112	111	adantl 481	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) ∧ 𝑘 ∈ (𝑀...𝑛)) → 𝑛 ∈ (ℤ_≥‘𝑘))
113		eluzp1p1 12821	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 ∈ (ℤ_≥‘𝑘) → (𝑛 + 1) ∈ (ℤ_≥‘(𝑘 + 1)))
114	112, 113	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝑛 + 1) ∈ (ℤ_≥‘(𝑘 + 1)))
115		uztrn 12811	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁 ∈ (ℤ_≥‘(𝑛 + 1)) ∧ (𝑛 + 1) ∈ (ℤ_≥‘(𝑘 + 1))) → 𝑁 ∈ (ℤ_≥‘(𝑘 + 1)))
116	110, 114, 115	syl2anc 584	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) ∧ 𝑘 ∈ (𝑀...𝑛)) → 𝑁 ∈ (ℤ_≥‘(𝑘 + 1)))
117		elfzuzb 13479	. . . . . . . . . . . . . . . 16 ⊢ ((𝑘 + 1) ∈ (𝑀...𝑁) ↔ ((𝑘 + 1) ∈ (ℤ_≥‘𝑀) ∧ 𝑁 ∈ (ℤ_≥‘(𝑘 + 1))))
118	107, 116, 117	sylanbrc 583	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝑘 + 1) ∈ (𝑀...𝑁))
119		fveq2 6858	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 = (𝑘 + 1) → (𝐹‘𝑛) = (𝐹‘(𝑘 + 1)))
120	119	eleq1d 2813	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 = (𝑘 + 1) → ((𝐹‘𝑛) ∈ 𝑋 ↔ (𝐹‘(𝑘 + 1)) ∈ 𝑋))
121	120	rspccva 3587	. . . . . . . . . . . . . . . 16 ⊢ ((∀𝑛 ∈ (𝑀...𝑁)(𝐹‘𝑛) ∈ 𝑋 ∧ (𝑘 + 1) ∈ (𝑀...𝑁)) → (𝐹‘(𝑘 + 1)) ∈ 𝑋)
122	82, 121	sylan 580	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) ∧ (𝑘 + 1) ∈ (𝑀...𝑁)) → (𝐹‘(𝑘 + 1)) ∈ 𝑋)
123	118, 122	syldan 591	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐹‘(𝑘 + 1)) ∈ 𝑋)
124		metcl 24220	. . . . . . . . . . . . . 14 ⊢ ((𝐷 ∈ (Met‘𝑋) ∧ (𝐹‘𝑘) ∈ 𝑋 ∧ (𝐹‘(𝑘 + 1)) ∈ 𝑋) → ((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ∈ ℝ)
125	96, 103, 123, 124	syl3anc 1373	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) ∧ 𝑘 ∈ (𝑀...𝑛)) → ((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ∈ ℝ)
126	95, 125	fsumrecl 15700	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → Σ𝑘 ∈ (𝑀...𝑛)((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ∈ ℝ)
127		letr 11268	. . . . . . . . . . . 12 ⊢ ((((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ∈ ℝ ∧ (((𝐹‘𝑀)𝐷(𝐹‘𝑛)) + ((𝐹‘𝑛)𝐷(𝐹‘(𝑛 + 1)))) ∈ ℝ ∧ Σ𝑘 ∈ (𝑀...𝑛)((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ∈ ℝ) → ((((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ≤ (((𝐹‘𝑀)𝐷(𝐹‘𝑛)) + ((𝐹‘𝑛)𝐷(𝐹‘(𝑛 + 1)))) ∧ (((𝐹‘𝑀)𝐷(𝐹‘𝑛)) + ((𝐹‘𝑛)𝐷(𝐹‘(𝑛 + 1)))) ≤ Σ𝑘 ∈ (𝑀...𝑛)((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))) → ((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ≤ Σ𝑘 ∈ (𝑀...𝑛)((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))))
128	89, 94, 126, 127	syl3anc 1373	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → ((((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ≤ (((𝐹‘𝑀)𝐷(𝐹‘𝑛)) + ((𝐹‘𝑛)𝐷(𝐹‘(𝑛 + 1)))) ∧ (((𝐹‘𝑀)𝐷(𝐹‘𝑛)) + ((𝐹‘𝑛)𝐷(𝐹‘(𝑛 + 1)))) ≤ Σ𝑘 ∈ (𝑀...𝑛)((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))) → ((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ≤ Σ𝑘 ∈ (𝑀...𝑛)((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))))
129	87, 128	mpand 695	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → ((((𝐹‘𝑀)𝐷(𝐹‘𝑛)) + ((𝐹‘𝑛)𝐷(𝐹‘(𝑛 + 1)))) ≤ Σ𝑘 ∈ (𝑀...𝑛)((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) → ((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ≤ Σ𝑘 ∈ (𝑀...𝑛)((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))))
130		fzfid 13938	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → (𝑀...(𝑛 − 1)) ∈ Fin)
131		fzssp1 13528	. . . . . . . . . . . . . . . 16 ⊢ (𝑀...(𝑛 − 1)) ⊆ (𝑀...((𝑛 − 1) + 1))
132		eluzelz 12803	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 ∈ (ℤ_≥‘𝑀) → 𝑛 ∈ ℤ)
133	132	3ad2ant2 1134	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → 𝑛 ∈ ℤ)
134	133	zcnd 12639	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → 𝑛 ∈ ℂ)
135		ax-1cn 11126	. . . . . . . . . . . . . . . . . 18 ⊢ 1 ∈ ℂ
136		npcan 11430	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑛 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑛 − 1) + 1) = 𝑛)
137	134, 135, 136	sylancl 586	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → ((𝑛 − 1) + 1) = 𝑛)
138	137	oveq2d 7403	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → (𝑀...((𝑛 − 1) + 1)) = (𝑀...𝑛))
139	131, 138	sseqtrid 3989	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → (𝑀...(𝑛 − 1)) ⊆ (𝑀...𝑛))
140	139	sselda 3946	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) ∧ 𝑘 ∈ (𝑀...(𝑛 − 1))) → 𝑘 ∈ (𝑀...𝑛))
141	140, 125	syldan 591	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) ∧ 𝑘 ∈ (𝑀...(𝑛 − 1))) → ((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ∈ ℝ)
142	130, 141	fsumrecl 15700	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → Σ𝑘 ∈ (𝑀...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ∈ ℝ)
143	91, 142, 93	leadd1d 11772	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → (((𝐹‘𝑀)𝐷(𝐹‘𝑛)) ≤ Σ𝑘 ∈ (𝑀...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ↔ (((𝐹‘𝑀)𝐷(𝐹‘𝑛)) + ((𝐹‘𝑛)𝐷(𝐹‘(𝑛 + 1)))) ≤ (Σ𝑘 ∈ (𝑀...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) + ((𝐹‘𝑛)𝐷(𝐹‘(𝑛 + 1))))))
144		simp2 1137	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → 𝑛 ∈ (ℤ_≥‘𝑀))
145	125	recnd 11202	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) ∧ 𝑘 ∈ (𝑀...𝑛)) → ((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ∈ ℂ)
146		fvoveq1 7410	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝑛 → (𝐹‘(𝑘 + 1)) = (𝐹‘(𝑛 + 1)))
147	79, 146	oveq12d 7405	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝑛 → ((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) = ((𝐹‘𝑛)𝐷(𝐹‘(𝑛 + 1))))
148	144, 145, 147	fsumm1 15717	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → Σ𝑘 ∈ (𝑀...𝑛)((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) = (Σ𝑘 ∈ (𝑀...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) + ((𝐹‘𝑛)𝐷(𝐹‘(𝑛 + 1)))))
149	148	breq2d 5119	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → ((((𝐹‘𝑀)𝐷(𝐹‘𝑛)) + ((𝐹‘𝑛)𝐷(𝐹‘(𝑛 + 1)))) ≤ Σ𝑘 ∈ (𝑀...𝑛)((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ↔ (((𝐹‘𝑀)𝐷(𝐹‘𝑛)) + ((𝐹‘𝑛)𝐷(𝐹‘(𝑛 + 1)))) ≤ (Σ𝑘 ∈ (𝑀...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) + ((𝐹‘𝑛)𝐷(𝐹‘(𝑛 + 1))))))
150	143, 149	bitr4d 282	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → (((𝐹‘𝑀)𝐷(𝐹‘𝑛)) ≤ Σ𝑘 ∈ (𝑀...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ↔ (((𝐹‘𝑀)𝐷(𝐹‘𝑛)) + ((𝐹‘𝑛)𝐷(𝐹‘(𝑛 + 1)))) ≤ Σ𝑘 ∈ (𝑀...𝑛)((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))))
151		pncan 11427	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑛 + 1) − 1) = 𝑛)
152	134, 135, 151	sylancl 586	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → ((𝑛 + 1) − 1) = 𝑛)
153	152	oveq2d 7403	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → (𝑀...((𝑛 + 1) − 1)) = (𝑀...𝑛))
154	153	sumeq1d 15666	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → Σ𝑘 ∈ (𝑀...((𝑛 + 1) − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) = Σ𝑘 ∈ (𝑀...𝑛)((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))
155	154	breq2d 5119	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → (((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ≤ Σ𝑘 ∈ (𝑀...((𝑛 + 1) − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) ↔ ((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ≤ Σ𝑘 ∈ (𝑀...𝑛)((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))))
156	129, 150, 155	3imtr4d 294	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀) ∧ (𝑛 + 1) ∈ (𝑀...𝑁)) → (((𝐹‘𝑀)𝐷(𝐹‘𝑛)) ≤ Σ𝑘 ∈ (𝑀...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) → ((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ≤ Σ𝑘 ∈ (𝑀...((𝑛 + 1) − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))))
157	156	3expia 1121	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀)) → ((𝑛 + 1) ∈ (𝑀...𝑁) → (((𝐹‘𝑀)𝐷(𝐹‘𝑛)) ≤ Σ𝑘 ∈ (𝑀...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))) → ((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ≤ Σ𝑘 ∈ (𝑀...((𝑛 + 1) − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))))
158	157	a2d 29	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀)) → (((𝑛 + 1) ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑛)) ≤ Σ𝑘 ∈ (𝑀...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))) → ((𝑛 + 1) ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ≤ Σ𝑘 ∈ (𝑀...((𝑛 + 1) − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))))
159	70, 158	syld 47	. . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑀)) → ((𝑛 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑛)) ≤ Σ𝑘 ∈ (𝑀...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))) → ((𝑛 + 1) ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ≤ Σ𝑘 ∈ (𝑀...((𝑛 + 1) − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))))
160	159	expcom 413	. . . . 5 ⊢ (𝑛 ∈ (ℤ_≥‘𝑀) → (𝜑 → ((𝑛 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑛)) ≤ Σ𝑘 ∈ (𝑀...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))) → ((𝑛 + 1) ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ≤ Σ𝑘 ∈ (𝑀...((𝑛 + 1) − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))))))
161	160	a2d 29	. . . 4 ⊢ (𝑛 ∈ (ℤ_≥‘𝑀) → ((𝜑 → (𝑛 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑛)) ≤ Σ𝑘 ∈ (𝑀...(𝑛 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))) → (𝜑 → ((𝑛 + 1) ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘(𝑛 + 1))) ≤ Σ𝑘 ∈ (𝑀...((𝑛 + 1) − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))))))
162	12, 21, 30, 39, 66, 161	uzind4 12865	. . 3 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (𝜑 → (𝑁 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑁)) ≤ Σ𝑘 ∈ (𝑀...(𝑁 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))))
163	1, 162	mpcom 38	. 2 ⊢ (𝜑 → (𝑁 ∈ (𝑀...𝑁) → ((𝐹‘𝑀)𝐷(𝐹‘𝑁)) ≤ Σ𝑘 ∈ (𝑀...(𝑁 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1)))))
164	3, 163	mpd 15	1 ⊢ (𝜑 → ((𝐹‘𝑀)𝐷(𝐹‘𝑁)) ≤ Σ𝑘 ∈ (𝑀...(𝑁 − 1))((𝐹‘𝑘)𝐷(𝐹‘(𝑘 + 1))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ∀wral 3044 ⊆ wss 3914 ∅c0 4296 class class class wbr 5107 ‘cfv 6511 (class class class)co 7387 ℂcc 11066 ℝcr 11067 0cc0 11068 1c1 11069 + caddc 11071 < clt 11208 ≤ cle 11209 − cmin 11405 ℤcz 12529 ℤ_≥cuz 12793 ...cfz 13468 Σcsu 15652 Metcmet 21250

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-inf2 9594 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 ax-pre-sup 11146

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-int 4911 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-se 5592 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-isom 6520 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-1st 7968 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-1o 8434 df-er 8671 df-map 8801 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 df-sup 9393 df-oi 9463 df-card 9892 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-div 11836 df-nn 12187 df-2 12249 df-3 12250 df-n0 12443 df-z 12530 df-uz 12794 df-rp 12952 df-xadd 13073 df-fz 13469 df-fzo 13616 df-seq 13967 df-exp 14027 df-hash 14296 df-cj 15065 df-re 15066 df-im 15067 df-sqrt 15201 df-abs 15202 df-clim 15454 df-sum 15653 df-xmet 21257 df-met 21258

This theorem is referenced by: geomcau 37753

W3C validator