fmul01lt1lem1 - Mathbox for Glauco Siliprandi

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

Theorem fmul01lt1lem1 46595

Description: Given a finite multiplication of values between 0 and 1, a value larger than its first element is larger the whole multiplication. (Contributed by Glauco Siliprandi, 20-Apr-2017.)

**Hypotheses**
Ref	Expression
fmul01lt1lem1.1	⊢ Ⅎ𝑖𝐵
fmul01lt1lem1.2	⊢ Ⅎ𝑖𝜑
fmul01lt1lem1.3	⊢ 𝐴 = seq𝐿( · , 𝐵)
fmul01lt1lem1.4	⊢ (𝜑 → 𝐿 ∈ ℤ)
fmul01lt1lem1.5	⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘𝐿))
fmul01lt1lem1.6	⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ∈ ℝ)
fmul01lt1lem1.7	⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝑖))
fmul01lt1lem1.8	⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ≤ 1)
fmul01lt1lem1.9	⊢ (𝜑 → 𝐸 ∈ ℝ⁺)
fmul01lt1lem1.10	⊢ (𝜑 → (𝐵‘𝐿) < 𝐸)

**Assertion**
Ref	Expression
fmul01lt1lem1	⊢ (𝜑 → (𝐴‘𝑀) < 𝐸)

Distinct variable groups: 𝑖,𝐿 𝑖,𝑀 Allowed substitution hints: 𝜑(𝑖) 𝐴(𝑖) 𝐵(𝑖) 𝐸(𝑖)

Proof of Theorem fmul01lt1lem1 Dummy variables 𝑗 𝑘 𝑙 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 490	. . . . 5 ⊢ ((𝜑 ∧ 𝑀 = 𝐿) → 𝑀 = 𝐿)
2	1	fveq2d 6889	. . . 4 ⊢ ((𝜑 ∧ 𝑀 = 𝐿) → (𝐴‘𝑀) = (𝐴‘𝐿))
3		fmul01lt1lem1.3	. . . . . 6 ⊢ 𝐴 = seq𝐿( · , 𝐵)
4	3	a1i 11	. . . . 5 ⊢ ((𝜑 ∧ 𝑀 = 𝐿) → 𝐴 = seq𝐿( · , 𝐵))
5	4	fveq1d 6887	. . . 4 ⊢ ((𝜑 ∧ 𝑀 = 𝐿) → (𝐴‘𝐿) = (seq𝐿( · , 𝐵)‘𝐿))
6		fmul01lt1lem1.4	. . . . . 6 ⊢ (𝜑 → 𝐿 ∈ ℤ)
7		seq1 14157	. . . . . 6 ⊢ (𝐿 ∈ ℤ → (seq𝐿( · , 𝐵)‘𝐿) = (𝐵‘𝐿))
8	6, 7	syl 18	. . . . 5 ⊢ (𝜑 → (seq𝐿( · , 𝐵)‘𝐿) = (𝐵‘𝐿))
9	8	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑀 = 𝐿) → (seq𝐿( · , 𝐵)‘𝐿) = (𝐵‘𝐿))
10	2, 5, 9	3eqtrd 2800	. . 3 ⊢ ((𝜑 ∧ 𝑀 = 𝐿) → (𝐴‘𝑀) = (𝐵‘𝐿))
11		fmul01lt1lem1.10	. . . 4 ⊢ (𝜑 → (𝐵‘𝐿) < 𝐸)
12	11	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝑀 = 𝐿) → (𝐵‘𝐿) < 𝐸)
13	10, 12	eqbrtrd 5127	. 2 ⊢ ((𝜑 ∧ 𝑀 = 𝐿) → (𝐴‘𝑀) < 𝐸)
14		simpr 490	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝑀 = 𝐿) → ¬ 𝑀 = 𝐿)
15	14	neqned 2963	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑀 = 𝐿) → 𝑀 ≠ 𝐿)
16	6	zred 12803	. . . . . . 7 ⊢ (𝜑 → 𝐿 ∈ ℝ)
17		fmul01lt1lem1.5	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘𝐿))
18		eluzelz 12975	. . . . . . . . 9 ⊢ (𝑀 ∈ (ℤ_≥‘𝐿) → 𝑀 ∈ ℤ)
19	17, 18	syl 18	. . . . . . . 8 ⊢ (𝜑 → 𝑀 ∈ ℤ)
20	19	zred 12803	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℝ)
21		eluzle 12978	. . . . . . . 8 ⊢ (𝑀 ∈ (ℤ_≥‘𝐿) → 𝐿 ≤ 𝑀)
22	17, 21	syl 18	. . . . . . 7 ⊢ (𝜑 → 𝐿 ≤ 𝑀)
23	16, 20, 22	3jca 1146	. . . . . 6 ⊢ (𝜑 → (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ ∧ 𝐿 ≤ 𝑀))
24	23	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝑀 = 𝐿) → (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ ∧ 𝐿 ≤ 𝑀))
25		leltne 11399	. . . . 5 ⊢ ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ ∧ 𝐿 ≤ 𝑀) → (𝐿 < 𝑀 ↔ 𝑀 ≠ 𝐿))
26	24, 25	syl 18	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑀 = 𝐿) → (𝐿 < 𝑀 ↔ 𝑀 ≠ 𝐿))
27	15, 26	mpbird 260	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑀 = 𝐿) → 𝐿 < 𝑀)
28	3	fveq1i 6886	. . . 4 ⊢ (𝐴‘𝑀) = (seq𝐿( · , 𝐵)‘𝑀)
29		remulcl 11285	. . . . . . 7 ⊢ ((𝑗 ∈ ℝ ∧ 𝑘 ∈ ℝ) → (𝑗 · 𝑘) ∈ ℝ)
30	29	adantl 487	. . . . . 6 ⊢ (((𝜑 ∧ 𝐿 < 𝑀) ∧ (𝑗 ∈ ℝ ∧ 𝑘 ∈ ℝ)) → (𝑗 · 𝑘) ∈ ℝ)
31		recn 11290	. . . . . . . . 9 ⊢ (𝑗 ∈ ℝ → 𝑗 ∈ ℂ)
32	31	3ad2ant1 1151	. . . . . . . 8 ⊢ ((𝑗 ∈ ℝ ∧ 𝑘 ∈ ℝ ∧ 𝑙 ∈ ℝ) → 𝑗 ∈ ℂ)
33		recn 11290	. . . . . . . . 9 ⊢ (𝑘 ∈ ℝ → 𝑘 ∈ ℂ)
34	33	3ad2ant2 1152	. . . . . . . 8 ⊢ ((𝑗 ∈ ℝ ∧ 𝑘 ∈ ℝ ∧ 𝑙 ∈ ℝ) → 𝑘 ∈ ℂ)
35		recn 11290	. . . . . . . . 9 ⊢ (𝑙 ∈ ℝ → 𝑙 ∈ ℂ)
36	35	3ad2ant3 1153	. . . . . . . 8 ⊢ ((𝑗 ∈ ℝ ∧ 𝑘 ∈ ℝ ∧ 𝑙 ∈ ℝ) → 𝑙 ∈ ℂ)
37	32, 34, 36	mulassd 11332	. . . . . . 7 ⊢ ((𝑗 ∈ ℝ ∧ 𝑘 ∈ ℝ ∧ 𝑙 ∈ ℝ) → ((𝑗 · 𝑘) · 𝑙) = (𝑗 · (𝑘 · 𝑙)))
38	37	adantl 487	. . . . . 6 ⊢ (((𝜑 ∧ 𝐿 < 𝑀) ∧ (𝑗 ∈ ℝ ∧ 𝑘 ∈ ℝ ∧ 𝑙 ∈ ℝ)) → ((𝑗 · 𝑘) · 𝑙) = (𝑗 · (𝑘 · 𝑙)))
39		simpr 490	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → 𝐿 < 𝑀)
40	39	olcd 888	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → (𝑀 < 𝐿 ∨ 𝐿 < 𝑀))
41	20, 16	jca 521	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑀 ∈ ℝ ∧ 𝐿 ∈ ℝ))
42	41	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → (𝑀 ∈ ℝ ∧ 𝐿 ∈ ℝ))
43		lttri2 11392	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℝ ∧ 𝐿 ∈ ℝ) → (𝑀 ≠ 𝐿 ↔ (𝑀 < 𝐿 ∨ 𝐿 < 𝑀)))
44	42, 43	syl 18	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → (𝑀 ≠ 𝐿 ↔ (𝑀 < 𝐿 ∨ 𝐿 < 𝑀)))
45	40, 44	mpbird 260	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → 𝑀 ≠ 𝐿)
46	45	neneqd 2961	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → ¬ 𝑀 = 𝐿)
47		uzp1 13002	. . . . . . . . . 10 ⊢ (𝑀 ∈ (ℤ_≥‘𝐿) → (𝑀 = 𝐿 ∨ 𝑀 ∈ (ℤ_≥‘(𝐿 + 1))))
48	17, 47	syl 18	. . . . . . . . 9 ⊢ (𝜑 → (𝑀 = 𝐿 ∨ 𝑀 ∈ (ℤ_≥‘(𝐿 + 1))))
49	48	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → (𝑀 = 𝐿 ∨ 𝑀 ∈ (ℤ_≥‘(𝐿 + 1))))
50	49	ord 878	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → (¬ 𝑀 = 𝐿 → 𝑀 ∈ (ℤ_≥‘(𝐿 + 1))))
51	46, 50	mpd 16	. . . . . 6 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → 𝑀 ∈ (ℤ_≥‘(𝐿 + 1)))
52	6	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → 𝐿 ∈ ℤ)
53		uzid 12980	. . . . . . 7 ⊢ (𝐿 ∈ ℤ → 𝐿 ∈ (ℤ_≥‘𝐿))
54	52, 53	syl 18	. . . . . 6 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → 𝐿 ∈ (ℤ_≥‘𝐿))
55		fmul01lt1lem1.2	. . . . . . . . . 10 ⊢ Ⅎ𝑖𝜑
56		nfv 1947	. . . . . . . . . 10 ⊢ Ⅎ𝑖 𝑗 ∈ (𝐿...𝑀)
57	55, 56	nfan 1932	. . . . . . . . 9 ⊢ Ⅎ𝑖(𝜑 ∧ 𝑗 ∈ (𝐿...𝑀))
58		fmul01lt1lem1.1	. . . . . . . . . . 11 ⊢ Ⅎ𝑖𝐵
59		nfcv 2923	. . . . . . . . . . 11 ⊢ Ⅎ𝑖𝑗
60	58, 59	nffv 6895	. . . . . . . . . 10 ⊢ Ⅎ𝑖(𝐵‘𝑗)
61	60	nfel1 2939	. . . . . . . . 9 ⊢ Ⅎ𝑖(𝐵‘𝑗) ∈ ℝ
62	57, 61	nfim 1929	. . . . . . . 8 ⊢ Ⅎ𝑖((𝜑 ∧ 𝑗 ∈ (𝐿...𝑀)) → (𝐵‘𝑗) ∈ ℝ)
63		eleq1 2849	. . . . . . . . . 10 ⊢ (𝑖 = 𝑗 → (𝑖 ∈ (𝐿...𝑀) ↔ 𝑗 ∈ (𝐿...𝑀)))
64	63	anbi2d 642	. . . . . . . . 9 ⊢ (𝑖 = 𝑗 → ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) ↔ (𝜑 ∧ 𝑗 ∈ (𝐿...𝑀))))
65		fveq2 6885	. . . . . . . . . 10 ⊢ (𝑖 = 𝑗 → (𝐵‘𝑖) = (𝐵‘𝑗))
66	65	eleq1d 2846	. . . . . . . . 9 ⊢ (𝑖 = 𝑗 → ((𝐵‘𝑖) ∈ ℝ ↔ (𝐵‘𝑗) ∈ ℝ))
67	64, 66	imbi12d 347	. . . . . . . 8 ⊢ (𝑖 = 𝑗 → (((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ∈ ℝ) ↔ ((𝜑 ∧ 𝑗 ∈ (𝐿...𝑀)) → (𝐵‘𝑗) ∈ ℝ)))
68		fmul01lt1lem1.6	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ∈ ℝ)
69	62, 67, 68	chvarfv 2277	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝐿...𝑀)) → (𝐵‘𝑗) ∈ ℝ)
70	69	adantlr 728	. . . . . 6 ⊢ (((𝜑 ∧ 𝐿 < 𝑀) ∧ 𝑗 ∈ (𝐿...𝑀)) → (𝐵‘𝑗) ∈ ℝ)
71	30, 38, 51, 54, 70	seqsplit 14178	. . . . 5 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → (seq𝐿( · , 𝐵)‘𝑀) = ((seq𝐿( · , 𝐵)‘𝐿) · (seq(𝐿 + 1)( · , 𝐵)‘𝑀)))
72		eluzfz1 13664	. . . . . . . . . . 11 ⊢ (𝑀 ∈ (ℤ_≥‘𝐿) → 𝐿 ∈ (𝐿...𝑀))
73	17, 72	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → 𝐿 ∈ (𝐿...𝑀))
74	73	ancli 558	. . . . . . . . . 10 ⊢ (𝜑 → (𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)))
75		nfv 1947	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖 𝐿 ∈ (𝐿...𝑀)
76	55, 75	nfan 1932	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖(𝜑 ∧ 𝐿 ∈ (𝐿...𝑀))
77		nfcv 2923	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑖𝐿
78	58, 77	nffv 6895	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖(𝐵‘𝐿)
79	78	nfel1 2939	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖(𝐵‘𝐿) ∈ ℝ
80	76, 79	nfim 1929	. . . . . . . . . . 11 ⊢ Ⅎ𝑖((𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)) → (𝐵‘𝐿) ∈ ℝ)
81		eleq1 2849	. . . . . . . . . . . . 13 ⊢ (𝑖 = 𝐿 → (𝑖 ∈ (𝐿...𝑀) ↔ 𝐿 ∈ (𝐿...𝑀)))
82	81	anbi2d 642	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝐿 → ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) ↔ (𝜑 ∧ 𝐿 ∈ (𝐿...𝑀))))
83		fveq2 6885	. . . . . . . . . . . . 13 ⊢ (𝑖 = 𝐿 → (𝐵‘𝑖) = (𝐵‘𝐿))
84	83	eleq1d 2846	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝐿 → ((𝐵‘𝑖) ∈ ℝ ↔ (𝐵‘𝐿) ∈ ℝ))
85	82, 84	imbi12d 347	. . . . . . . . . . 11 ⊢ (𝑖 = 𝐿 → (((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ∈ ℝ) ↔ ((𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)) → (𝐵‘𝐿) ∈ ℝ)))
86	80, 85, 68	vtoclg1f 3531	. . . . . . . . . 10 ⊢ (𝐿 ∈ (𝐿...𝑀) → ((𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)) → (𝐵‘𝐿) ∈ ℝ))
87	73, 74, 86	sylc 66	. . . . . . . . 9 ⊢ (𝜑 → (𝐵‘𝐿) ∈ ℝ)
88	8, 87	eqeltrd 2861	. . . . . . . 8 ⊢ (𝜑 → (seq𝐿( · , 𝐵)‘𝐿) ∈ ℝ)
89	88	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → (seq𝐿( · , 𝐵)‘𝐿) ∈ ℝ)
90	6	adantr 486	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ ((𝐿 + 1)...𝑀)) → 𝐿 ∈ ℤ)
91	19	adantr 486	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ ((𝐿 + 1)...𝑀)) → 𝑀 ∈ ℤ)
92		elfzelz 13656	. . . . . . . . . . . 12 ⊢ (𝑗 ∈ ((𝐿 + 1)...𝑀) → 𝑗 ∈ ℤ)
93	92	adantl 487	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ ((𝐿 + 1)...𝑀)) → 𝑗 ∈ ℤ)
94	16	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ ((𝐿 + 1)...𝑀)) → 𝐿 ∈ ℝ)
95		peano2re 11483	. . . . . . . . . . . . . 14 ⊢ (𝐿 ∈ ℝ → (𝐿 + 1) ∈ ℝ)
96	16, 95	syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐿 + 1) ∈ ℝ)
97	96	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ ((𝐿 + 1)...𝑀)) → (𝐿 + 1) ∈ ℝ)
98	92	zred 12803	. . . . . . . . . . . . 13 ⊢ (𝑗 ∈ ((𝐿 + 1)...𝑀) → 𝑗 ∈ ℝ)
99	98	adantl 487	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ ((𝐿 + 1)...𝑀)) → 𝑗 ∈ ℝ)
100	16	lep1d 12248	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐿 ≤ (𝐿 + 1))
101	100	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ ((𝐿 + 1)...𝑀)) → 𝐿 ≤ (𝐿 + 1))
102		elfzle1 13660	. . . . . . . . . . . . 13 ⊢ (𝑗 ∈ ((𝐿 + 1)...𝑀) → (𝐿 + 1) ≤ 𝑗)
103	102	adantl 487	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑗 ∈ ((𝐿 + 1)...𝑀)) → (𝐿 + 1) ≤ 𝑗)
104	94, 97, 99, 101, 103	letrd 11467	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ ((𝐿 + 1)...𝑀)) → 𝐿 ≤ 𝑗)
105		elfzle2 13661	. . . . . . . . . . . 12 ⊢ (𝑗 ∈ ((𝐿 + 1)...𝑀) → 𝑗 ≤ 𝑀)
106	105	adantl 487	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ ((𝐿 + 1)...𝑀)) → 𝑗 ≤ 𝑀)
107	90, 91, 93, 104, 106	elfzd 13647	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ ((𝐿 + 1)...𝑀)) → 𝑗 ∈ (𝐿...𝑀))
108	107, 69	syldan 603	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ ((𝐿 + 1)...𝑀)) → (𝐵‘𝑗) ∈ ℝ)
109	108	adantlr 728	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐿 < 𝑀) ∧ 𝑗 ∈ ((𝐿 + 1)...𝑀)) → (𝐵‘𝑗) ∈ ℝ)
110	51, 109, 30	seqcl 14165	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → (seq(𝐿 + 1)( · , 𝐵)‘𝑀) ∈ ℝ)
111	89, 110	remulcld 11339	. . . . . 6 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → ((seq𝐿( · , 𝐵)‘𝐿) · (seq(𝐿 + 1)( · , 𝐵)‘𝑀)) ∈ ℝ)
112		fmul01lt1lem1.9	. . . . . . . 8 ⊢ (𝜑 → 𝐸 ∈ ℝ⁺)
113	112	rpred 13164	. . . . . . 7 ⊢ (𝜑 → 𝐸 ∈ ℝ)
114	113	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → 𝐸 ∈ ℝ)
115		1red 11309	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → 1 ∈ ℝ)
116		nfcv 2923	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑖0
117		nfcv 2923	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑖 ≤
118	116, 117, 78	nfbr 5152	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖0 ≤ (𝐵‘𝐿)
119	76, 118	nfim 1929	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖((𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝐿))
120	83	breq2d 5115	. . . . . . . . . . . . 13 ⊢ (𝑖 = 𝐿 → (0 ≤ (𝐵‘𝑖) ↔ 0 ≤ (𝐵‘𝐿)))
121	82, 120	imbi12d 347	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝐿 → (((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝑖)) ↔ ((𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝐿))))
122		fmul01lt1lem1.7	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝑖))
123	119, 121, 122	vtoclg1f 3531	. . . . . . . . . . 11 ⊢ (𝐿 ∈ (𝐿...𝑀) → ((𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝐿)))
124	73, 74, 123	sylc 66	. . . . . . . . . 10 ⊢ (𝜑 → 0 ≤ (𝐵‘𝐿))
125	124, 8	breqtrrd 5133	. . . . . . . . 9 ⊢ (𝜑 → 0 ≤ (seq𝐿( · , 𝐵)‘𝐿))
126	125	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → 0 ≤ (seq𝐿( · , 𝐵)‘𝐿))
127		nfv 1947	. . . . . . . . . . 11 ⊢ Ⅎ𝑖 𝐿 < 𝑀
128	55, 127	nfan 1932	. . . . . . . . . 10 ⊢ Ⅎ𝑖(𝜑 ∧ 𝐿 < 𝑀)
129		eqid 2761	. . . . . . . . . 10 ⊢ seq(𝐿 + 1)( · , 𝐵) = seq(𝐿 + 1)( · , 𝐵)
130	6	peano2zd 12806	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐿 + 1) ∈ ℤ)
131	130	adantr 486	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → (𝐿 + 1) ∈ ℤ)
132	16	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → 𝐿 ∈ ℝ)
133	132, 39	gtned 11445	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → 𝑀 ≠ 𝐿)
134	133	neneqd 2961	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → ¬ 𝑀 = 𝐿)
135	17	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → 𝑀 ∈ (ℤ_≥‘𝐿))
136	135, 47	syl 18	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → (𝑀 = 𝐿 ∨ 𝑀 ∈ (ℤ_≥‘(𝐿 + 1))))
137		orel1 902	. . . . . . . . . . 11 ⊢ (¬ 𝑀 = 𝐿 → ((𝑀 = 𝐿 ∨ 𝑀 ∈ (ℤ_≥‘(𝐿 + 1))) → 𝑀 ∈ (ℤ_≥‘(𝐿 + 1))))
138	134, 136, 137	sylc 66	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → 𝑀 ∈ (ℤ_≥‘(𝐿 + 1)))
139	19	adantr 486	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → 𝑀 ∈ ℤ)
140		zltp1le 12746	. . . . . . . . . . . . 13 ⊢ ((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐿 < 𝑀 ↔ (𝐿 + 1) ≤ 𝑀))
141	52, 139, 140	syl2anc 596	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → (𝐿 < 𝑀 ↔ (𝐿 + 1) ≤ 𝑀))
142	39, 141	mpbid 235	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → (𝐿 + 1) ≤ 𝑀)
143	20	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → 𝑀 ∈ ℝ)
144	143	leidd 11882	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → 𝑀 ≤ 𝑀)
145	131, 139, 139, 142, 144	elfzd 13647	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → 𝑀 ∈ ((𝐿 + 1)...𝑀))
146	6	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → 𝐿 ∈ ℤ)
147	19	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → 𝑀 ∈ ℤ)
148		elfzelz 13656	. . . . . . . . . . . . . 14 ⊢ (𝑖 ∈ ((𝐿 + 1)...𝑀) → 𝑖 ∈ ℤ)
149	148	adantl 487	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → 𝑖 ∈ ℤ)
150	16	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → 𝐿 ∈ ℝ)
151	150, 95	syl 18	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → (𝐿 + 1) ∈ ℝ)
152	148	zred 12803	. . . . . . . . . . . . . . 15 ⊢ (𝑖 ∈ ((𝐿 + 1)...𝑀) → 𝑖 ∈ ℝ)
153	152	adantl 487	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → 𝑖 ∈ ℝ)
154	100	adantr 486	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → 𝐿 ≤ (𝐿 + 1))
155		elfzle1 13660	. . . . . . . . . . . . . . 15 ⊢ (𝑖 ∈ ((𝐿 + 1)...𝑀) → (𝐿 + 1) ≤ 𝑖)
156	155	adantl 487	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → (𝐿 + 1) ≤ 𝑖)
157	150, 151, 153, 154, 156	letrd 11467	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → 𝐿 ≤ 𝑖)
158		elfzle2 13661	. . . . . . . . . . . . . 14 ⊢ (𝑖 ∈ ((𝐿 + 1)...𝑀) → 𝑖 ≤ 𝑀)
159	158	adantl 487	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → 𝑖 ≤ 𝑀)
160	146, 147, 149, 157, 159	elfzd 13647	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → 𝑖 ∈ (𝐿...𝑀))
161	160, 68	syldan 603	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → (𝐵‘𝑖) ∈ ℝ)
162	161	adantlr 728	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐿 < 𝑀) ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → (𝐵‘𝑖) ∈ ℝ)
163		simpll 779	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐿 < 𝑀) ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → 𝜑)
164	6	ad2antrr 739	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐿 < 𝑀) ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → 𝐿 ∈ ℤ)
165	19	ad2antrr 739	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐿 < 𝑀) ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → 𝑀 ∈ ℤ)
166	148	adantl 487	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐿 < 𝑀) ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → 𝑖 ∈ ℤ)
167	16	ad2antrr 739	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐿 < 𝑀) ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → 𝐿 ∈ ℝ)
168	96	ad2antrr 739	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐿 < 𝑀) ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → (𝐿 + 1) ∈ ℝ)
169	152	adantl 487	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐿 < 𝑀) ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → 𝑖 ∈ ℝ)
170	100	ad2antrr 739	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐿 < 𝑀) ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → 𝐿 ≤ (𝐿 + 1))
171	155	adantl 487	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐿 < 𝑀) ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → (𝐿 + 1) ≤ 𝑖)
172	167, 168, 169, 170, 171	letrd 11467	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐿 < 𝑀) ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → 𝐿 ≤ 𝑖)
173	158	adantl 487	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐿 < 𝑀) ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → 𝑖 ≤ 𝑀)
174	164, 165, 166, 172, 173	elfzd 13647	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐿 < 𝑀) ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → 𝑖 ∈ (𝐿...𝑀))
175	163, 174, 122	syl2anc 596	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐿 < 𝑀) ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → 0 ≤ (𝐵‘𝑖))
176		fmul01lt1lem1.8	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ≤ 1)
177	163, 174, 176	syl2anc 596	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐿 < 𝑀) ∧ 𝑖 ∈ ((𝐿 + 1)...𝑀)) → (𝐵‘𝑖) ≤ 1)
178	58, 128, 129, 131, 138, 145, 162, 175, 177	fmul01 46591	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → (0 ≤ (seq(𝐿 + 1)( · , 𝐵)‘𝑀) ∧ (seq(𝐿 + 1)( · , 𝐵)‘𝑀) ≤ 1))
179	178	simprd 501	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → (seq(𝐿 + 1)( · , 𝐵)‘𝑀) ≤ 1)
180	110, 115, 89, 126, 179	lemul2ad 12257	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → ((seq𝐿( · , 𝐵)‘𝐿) · (seq(𝐿 + 1)( · , 𝐵)‘𝑀)) ≤ ((seq𝐿( · , 𝐵)‘𝐿) · 1))
181	88	recnd 11337	. . . . . . . . 9 ⊢ (𝜑 → (seq𝐿( · , 𝐵)‘𝐿) ∈ ℂ)
182	181	mulridd 11326	. . . . . . . 8 ⊢ (𝜑 → ((seq𝐿( · , 𝐵)‘𝐿) · 1) = (seq𝐿( · , 𝐵)‘𝐿))
183	182	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → ((seq𝐿( · , 𝐵)‘𝐿) · 1) = (seq𝐿( · , 𝐵)‘𝐿))
184	180, 183	breqtrd 5131	. . . . . 6 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → ((seq𝐿( · , 𝐵)‘𝐿) · (seq(𝐿 + 1)( · , 𝐵)‘𝑀)) ≤ (seq𝐿( · , 𝐵)‘𝐿))
185	8, 11	eqbrtrd 5127	. . . . . . 7 ⊢ (𝜑 → (seq𝐿( · , 𝐵)‘𝐿) < 𝐸)
186	185	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → (seq𝐿( · , 𝐵)‘𝐿) < 𝐸)
187	111, 89, 114, 184, 186	lelttrd 11468	. . . . 5 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → ((seq𝐿( · , 𝐵)‘𝐿) · (seq(𝐿 + 1)( · , 𝐵)‘𝑀)) < 𝐸)
188	71, 187	eqbrtrd 5127	. . . 4 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → (seq𝐿( · , 𝐵)‘𝑀) < 𝐸)
189	28, 188	eqbrtrid 5140	. . 3 ⊢ ((𝜑 ∧ 𝐿 < 𝑀) → (𝐴‘𝑀) < 𝐸)
190	27, 189	syldan 603	. 2 ⊢ ((𝜑 ∧ ¬ 𝑀 = 𝐿) → (𝐴‘𝑀) < 𝐸)
191	13, 190	pm2.61dan 825	1 ⊢ (𝜑 → (𝐴‘𝑀) < 𝐸)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 Ⅎwnf 1816 ∈ wcel 2145 Ⅎwnfc 2908 ≠ wne 2956 class class class wbr 5103 ‘cfv 6538 (class class class)co 7420 ℂcc 11198 ℝcr 11199 0cc0 11200 1c1 11201 + caddc 11203 · cmul 11205 < clt 11343 ≤ cle 11344 ℤcz 12693 ℤ_≥cuz 12965 ℝ⁺crp 13120 ...cfz 13639 seqcseq 14144

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-n0 12607 df-z 12694 df-uz 12966 df-rp 13121 df-fz 13640 df-fzo 13789 df-seq 14145

This theorem is used by: fmul01lt1lem2 46596

W3C validator