fmul01lt1lem2 - Mathbox for Glauco Siliprandi

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

Theorem fmul01lt1lem2 43085

Description: Given a finite multiplication of values betweeen 0 and 1, a value 𝐸 larger than any multiplicand, is larger than the whole multiplication. (Contributed by Glauco Siliprandi, 20-Apr-2017.)

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

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

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

Proof of Theorem fmul01lt1lem2 Dummy variables 𝑎 𝑏 𝑐 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fmul01lt1lem2.1	. . 3 ⊢ Ⅎ𝑖𝐵
2		fmul01lt1lem2.2	. . . 4 ⊢ Ⅎ𝑖𝜑
3		nfv 1917	. . . 4 ⊢ Ⅎ𝑖 𝐽 = 𝐿
4	2, 3	nfan 1902	. . 3 ⊢ Ⅎ𝑖(𝜑 ∧ 𝐽 = 𝐿)
5		fmul01lt1lem2.3	. . 3 ⊢ 𝐴 = seq𝐿( · , 𝐵)
6		fmul01lt1lem2.4	. . . 4 ⊢ (𝜑 → 𝐿 ∈ ℤ)
7	6	adantr 481	. . 3 ⊢ ((𝜑 ∧ 𝐽 = 𝐿) → 𝐿 ∈ ℤ)
8		fmul01lt1lem2.5	. . . 4 ⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘𝐿))
9	8	adantr 481	. . 3 ⊢ ((𝜑 ∧ 𝐽 = 𝐿) → 𝑀 ∈ (ℤ_≥‘𝐿))
10		fmul01lt1lem2.6	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ∈ ℝ)
11	10	adantlr 712	. . 3 ⊢ (((𝜑 ∧ 𝐽 = 𝐿) ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ∈ ℝ)
12		fmul01lt1lem2.7	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝑖))
13	12	adantlr 712	. . 3 ⊢ (((𝜑 ∧ 𝐽 = 𝐿) ∧ 𝑖 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝑖))
14		fmul01lt1lem2.8	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ≤ 1)
15	14	adantlr 712	. . 3 ⊢ (((𝜑 ∧ 𝐽 = 𝐿) ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ≤ 1)
16		fmul01lt1lem2.9	. . . 4 ⊢ (𝜑 → 𝐸 ∈ ℝ⁺)
17	16	adantr 481	. . 3 ⊢ ((𝜑 ∧ 𝐽 = 𝐿) → 𝐸 ∈ ℝ⁺)
18		simpr 485	. . . . 5 ⊢ ((𝜑 ∧ 𝐽 = 𝐿) → 𝐽 = 𝐿)
19	18	fveq2d 6771	. . . 4 ⊢ ((𝜑 ∧ 𝐽 = 𝐿) → (𝐵‘𝐽) = (𝐵‘𝐿))
20		fmul01lt1lem2.11	. . . . 5 ⊢ (𝜑 → (𝐵‘𝐽) < 𝐸)
21	20	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝐽 = 𝐿) → (𝐵‘𝐽) < 𝐸)
22	19, 21	eqbrtrrd 5098	. . 3 ⊢ ((𝜑 ∧ 𝐽 = 𝐿) → (𝐵‘𝐿) < 𝐸)
23	1, 4, 5, 7, 9, 11, 13, 15, 17, 22	fmul01lt1lem1 43084	. 2 ⊢ ((𝜑 ∧ 𝐽 = 𝐿) → (𝐴‘𝑀) < 𝐸)
24	5	fveq1i 6768	. . 3 ⊢ (𝐴‘𝑀) = (seq𝐿( · , 𝐵)‘𝑀)
25		nfv 1917	. . . . . . . . 9 ⊢ Ⅎ𝑖 𝑎 ∈ (𝐿...𝑀)
26	2, 25	nfan 1902	. . . . . . . 8 ⊢ Ⅎ𝑖(𝜑 ∧ 𝑎 ∈ (𝐿...𝑀))
27		nfcv 2907	. . . . . . . . . 10 ⊢ Ⅎ𝑖𝑎
28	1, 27	nffv 6777	. . . . . . . . 9 ⊢ Ⅎ𝑖(𝐵‘𝑎)
29	28	nfel1 2923	. . . . . . . 8 ⊢ Ⅎ𝑖(𝐵‘𝑎) ∈ ℝ
30	26, 29	nfim 1899	. . . . . . 7 ⊢ Ⅎ𝑖((𝜑 ∧ 𝑎 ∈ (𝐿...𝑀)) → (𝐵‘𝑎) ∈ ℝ)
31		eleq1w 2821	. . . . . . . . 9 ⊢ (𝑖 = 𝑎 → (𝑖 ∈ (𝐿...𝑀) ↔ 𝑎 ∈ (𝐿...𝑀)))
32	31	anbi2d 629	. . . . . . . 8 ⊢ (𝑖 = 𝑎 → ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) ↔ (𝜑 ∧ 𝑎 ∈ (𝐿...𝑀))))
33		fveq2 6767	. . . . . . . . 9 ⊢ (𝑖 = 𝑎 → (𝐵‘𝑖) = (𝐵‘𝑎))
34	33	eleq1d 2823	. . . . . . . 8 ⊢ (𝑖 = 𝑎 → ((𝐵‘𝑖) ∈ ℝ ↔ (𝐵‘𝑎) ∈ ℝ))
35	32, 34	imbi12d 345	. . . . . . 7 ⊢ (𝑖 = 𝑎 → (((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ∈ ℝ) ↔ ((𝜑 ∧ 𝑎 ∈ (𝐿...𝑀)) → (𝐵‘𝑎) ∈ ℝ)))
36	30, 35, 10	chvarfv 2233	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ (𝐿...𝑀)) → (𝐵‘𝑎) ∈ ℝ)
37		remulcl 10944	. . . . . . 7 ⊢ ((𝑎 ∈ ℝ ∧ 𝑗 ∈ ℝ) → (𝑎 · 𝑗) ∈ ℝ)
38	37	adantl 482	. . . . . 6 ⊢ ((𝜑 ∧ (𝑎 ∈ ℝ ∧ 𝑗 ∈ ℝ)) → (𝑎 · 𝑗) ∈ ℝ)
39	8, 36, 38	seqcl 13731	. . . . 5 ⊢ (𝜑 → (seq𝐿( · , 𝐵)‘𝑀) ∈ ℝ)
40	39	adantr 481	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (seq𝐿( · , 𝐵)‘𝑀) ∈ ℝ)
41		fmul01lt1lem2.10	. . . . . . 7 ⊢ (𝜑 → 𝐽 ∈ (𝐿...𝑀))
42		elfzuz3 13241	. . . . . . 7 ⊢ (𝐽 ∈ (𝐿...𝑀) → 𝑀 ∈ (ℤ_≥‘𝐽))
43	41, 42	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘𝐽))
44		nfv 1917	. . . . . . . . 9 ⊢ Ⅎ𝑖 𝑎 ∈ (𝐽...𝑀)
45	2, 44	nfan 1902	. . . . . . . 8 ⊢ Ⅎ𝑖(𝜑 ∧ 𝑎 ∈ (𝐽...𝑀))
46	45, 29	nfim 1899	. . . . . . 7 ⊢ Ⅎ𝑖((𝜑 ∧ 𝑎 ∈ (𝐽...𝑀)) → (𝐵‘𝑎) ∈ ℝ)
47		eleq1w 2821	. . . . . . . . 9 ⊢ (𝑖 = 𝑎 → (𝑖 ∈ (𝐽...𝑀) ↔ 𝑎 ∈ (𝐽...𝑀)))
48	47	anbi2d 629	. . . . . . . 8 ⊢ (𝑖 = 𝑎 → ((𝜑 ∧ 𝑖 ∈ (𝐽...𝑀)) ↔ (𝜑 ∧ 𝑎 ∈ (𝐽...𝑀))))
49	48, 34	imbi12d 345	. . . . . . 7 ⊢ (𝑖 = 𝑎 → (((𝜑 ∧ 𝑖 ∈ (𝐽...𝑀)) → (𝐵‘𝑖) ∈ ℝ) ↔ ((𝜑 ∧ 𝑎 ∈ (𝐽...𝑀)) → (𝐵‘𝑎) ∈ ℝ)))
50	6	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐽...𝑀)) → 𝐿 ∈ ℤ)
51		eluzelz 12580	. . . . . . . . . . 11 ⊢ (𝑀 ∈ (ℤ_≥‘𝐿) → 𝑀 ∈ ℤ)
52	8, 51	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ ℤ)
53	52	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐽...𝑀)) → 𝑀 ∈ ℤ)
54		elfzelz 13244	. . . . . . . . . 10 ⊢ (𝑖 ∈ (𝐽...𝑀) → 𝑖 ∈ ℤ)
55	54	adantl 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐽...𝑀)) → 𝑖 ∈ ℤ)
56	6	zred 12414	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐿 ∈ ℝ)
57	56	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐽...𝑀)) → 𝐿 ∈ ℝ)
58		elfzelz 13244	. . . . . . . . . . . . 13 ⊢ (𝐽 ∈ (𝐿...𝑀) → 𝐽 ∈ ℤ)
59	41, 58	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐽 ∈ ℤ)
60	59	zred 12414	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐽 ∈ ℝ)
61	60	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐽...𝑀)) → 𝐽 ∈ ℝ)
62	54	zred 12414	. . . . . . . . . . 11 ⊢ (𝑖 ∈ (𝐽...𝑀) → 𝑖 ∈ ℝ)
63	62	adantl 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐽...𝑀)) → 𝑖 ∈ ℝ)
64		elfzle1 13247	. . . . . . . . . . . 12 ⊢ (𝐽 ∈ (𝐿...𝑀) → 𝐿 ≤ 𝐽)
65	41, 64	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐿 ≤ 𝐽)
66	65	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐽...𝑀)) → 𝐿 ≤ 𝐽)
67		elfzle1 13247	. . . . . . . . . . 11 ⊢ (𝑖 ∈ (𝐽...𝑀) → 𝐽 ≤ 𝑖)
68	67	adantl 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐽...𝑀)) → 𝐽 ≤ 𝑖)
69	57, 61, 63, 66, 68	letrd 11120	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐽...𝑀)) → 𝐿 ≤ 𝑖)
70		elfzle2 13248	. . . . . . . . . 10 ⊢ (𝑖 ∈ (𝐽...𝑀) → 𝑖 ≤ 𝑀)
71	70	adantl 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐽...𝑀)) → 𝑖 ≤ 𝑀)
72	50, 53, 55, 69, 71	elfzd 13235	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐽...𝑀)) → 𝑖 ∈ (𝐿...𝑀))
73	72, 10	syldan 591	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐽...𝑀)) → (𝐵‘𝑖) ∈ ℝ)
74	46, 49, 73	chvarfv 2233	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ (𝐽...𝑀)) → (𝐵‘𝑎) ∈ ℝ)
75	43, 74, 38	seqcl 13731	. . . . 5 ⊢ (𝜑 → (seq𝐽( · , 𝐵)‘𝑀) ∈ ℝ)
76	75	adantr 481	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (seq𝐽( · , 𝐵)‘𝑀) ∈ ℝ)
77	16	rpred 12760	. . . . 5 ⊢ (𝜑 → 𝐸 ∈ ℝ)
78	77	adantr 481	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → 𝐸 ∈ ℝ)
79		remulcl 10944	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ) → (𝑎 · 𝑏) ∈ ℝ)
80	79	adantl 482	. . . . . . . 8 ⊢ (((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ (𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ)) → (𝑎 · 𝑏) ∈ ℝ)
81		simp1 1135	. . . . . . . . . . 11 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑐 ∈ ℝ) → 𝑎 ∈ ℝ)
82	81	recnd 10991	. . . . . . . . . 10 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑐 ∈ ℝ) → 𝑎 ∈ ℂ)
83		simp2 1136	. . . . . . . . . . 11 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑐 ∈ ℝ) → 𝑏 ∈ ℝ)
84	83	recnd 10991	. . . . . . . . . 10 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑐 ∈ ℝ) → 𝑏 ∈ ℂ)
85		simp3 1137	. . . . . . . . . . 11 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑐 ∈ ℝ) → 𝑐 ∈ ℝ)
86	85	recnd 10991	. . . . . . . . . 10 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑐 ∈ ℝ) → 𝑐 ∈ ℂ)
87	82, 84, 86	mulassd 10986	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑐 ∈ ℝ) → ((𝑎 · 𝑏) · 𝑐) = (𝑎 · (𝑏 · 𝑐)))
88	87	adantl 482	. . . . . . . 8 ⊢ (((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ (𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ ∧ 𝑐 ∈ ℝ)) → ((𝑎 · 𝑏) · 𝑐) = (𝑎 · (𝑏 · 𝑐)))
89	59	zcnd 12415	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐽 ∈ ℂ)
90		1cnd 10958	. . . . . . . . . . . 12 ⊢ (𝜑 → 1 ∈ ℂ)
91	89, 90	npcand 11324	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝐽 − 1) + 1) = 𝐽)
92	91	fveq2d 6771	. . . . . . . . . 10 ⊢ (𝜑 → (ℤ_≥‘((𝐽 − 1) + 1)) = (ℤ_≥‘𝐽))
93	43, 92	eleqtrrd 2842	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘((𝐽 − 1) + 1)))
94	93	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → 𝑀 ∈ (ℤ_≥‘((𝐽 − 1) + 1)))
95	6	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → 𝐿 ∈ ℤ)
96	59	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → 𝐽 ∈ ℤ)
97		1zzd 12339	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → 1 ∈ ℤ)
98	96, 97	zsubcld 12419	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (𝐽 − 1) ∈ ℤ)
99		simpr 485	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → ¬ 𝐽 = 𝐿)
100		eqcom 2745	. . . . . . . . . . . 12 ⊢ (𝐽 = 𝐿 ↔ 𝐿 = 𝐽)
101	99, 100	sylnib 328	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → ¬ 𝐿 = 𝐽)
102	56, 60	leloed 11106	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝐿 ≤ 𝐽 ↔ (𝐿 < 𝐽 ∨ 𝐿 = 𝐽)))
103	65, 102	mpbid 231	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐿 < 𝐽 ∨ 𝐿 = 𝐽))
104	103	adantr 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (𝐿 < 𝐽 ∨ 𝐿 = 𝐽))
105		orel2 888	. . . . . . . . . . 11 ⊢ (¬ 𝐿 = 𝐽 → ((𝐿 < 𝐽 ∨ 𝐿 = 𝐽) → 𝐿 < 𝐽))
106	101, 104, 105	sylc 65	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → 𝐿 < 𝐽)
107		zltlem1 12361	. . . . . . . . . . . 12 ⊢ ((𝐿 ∈ ℤ ∧ 𝐽 ∈ ℤ) → (𝐿 < 𝐽 ↔ 𝐿 ≤ (𝐽 − 1)))
108	6, 59, 107	syl2anc 584	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐿 < 𝐽 ↔ 𝐿 ≤ (𝐽 − 1)))
109	108	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (𝐿 < 𝐽 ↔ 𝐿 ≤ (𝐽 − 1)))
110	106, 109	mpbid 231	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → 𝐿 ≤ (𝐽 − 1))
111		eluz2 12576	. . . . . . . . 9 ⊢ ((𝐽 − 1) ∈ (ℤ_≥‘𝐿) ↔ (𝐿 ∈ ℤ ∧ (𝐽 − 1) ∈ ℤ ∧ 𝐿 ≤ (𝐽 − 1)))
112	95, 98, 110, 111	syl3anbrc 1342	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (𝐽 − 1) ∈ (ℤ_≥‘𝐿))
113		nfv 1917	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖 ¬ 𝐽 = 𝐿
114	2, 113	nfan 1902	. . . . . . . . . . 11 ⊢ Ⅎ𝑖(𝜑 ∧ ¬ 𝐽 = 𝐿)
115	114, 25	nfan 1902	. . . . . . . . . 10 ⊢ Ⅎ𝑖((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑎 ∈ (𝐿...𝑀))
116	115, 29	nfim 1899	. . . . . . . . 9 ⊢ Ⅎ𝑖(((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑎 ∈ (𝐿...𝑀)) → (𝐵‘𝑎) ∈ ℝ)
117	31	anbi2d 629	. . . . . . . . . 10 ⊢ (𝑖 = 𝑎 → (((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑖 ∈ (𝐿...𝑀)) ↔ ((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑎 ∈ (𝐿...𝑀))))
118	117, 34	imbi12d 345	. . . . . . . . 9 ⊢ (𝑖 = 𝑎 → ((((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ∈ ℝ) ↔ (((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑎 ∈ (𝐿...𝑀)) → (𝐵‘𝑎) ∈ ℝ)))
119	10	adantlr 712	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ∈ ℝ)
120	116, 118, 119	chvarfv 2233	. . . . . . . 8 ⊢ (((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑎 ∈ (𝐿...𝑀)) → (𝐵‘𝑎) ∈ ℝ)
121	80, 88, 94, 112, 120	seqsplit 13744	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (seq𝐿( · , 𝐵)‘𝑀) = ((seq𝐿( · , 𝐵)‘(𝐽 − 1)) · (seq((𝐽 − 1) + 1)( · , 𝐵)‘𝑀)))
122	91	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → ((𝐽 − 1) + 1) = 𝐽)
123	122	seqeq1d 13715	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → seq((𝐽 − 1) + 1)( · , 𝐵) = seq𝐽( · , 𝐵))
124	123	fveq1d 6769	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (seq((𝐽 − 1) + 1)( · , 𝐵)‘𝑀) = (seq𝐽( · , 𝐵)‘𝑀))
125	124	oveq2d 7284	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → ((seq𝐿( · , 𝐵)‘(𝐽 − 1)) · (seq((𝐽 − 1) + 1)( · , 𝐵)‘𝑀)) = ((seq𝐿( · , 𝐵)‘(𝐽 − 1)) · (seq𝐽( · , 𝐵)‘𝑀)))
126	121, 125	eqtrd 2778	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (seq𝐿( · , 𝐵)‘𝑀) = ((seq𝐿( · , 𝐵)‘(𝐽 − 1)) · (seq𝐽( · , 𝐵)‘𝑀)))
127		nfv 1917	. . . . . . . . . . 11 ⊢ Ⅎ𝑖 𝑎 ∈ (𝐿...(𝐽 − 1))
128	114, 127	nfan 1902	. . . . . . . . . 10 ⊢ Ⅎ𝑖((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑎 ∈ (𝐿...(𝐽 − 1)))
129	128, 29	nfim 1899	. . . . . . . . 9 ⊢ Ⅎ𝑖(((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑎 ∈ (𝐿...(𝐽 − 1))) → (𝐵‘𝑎) ∈ ℝ)
130		eleq1w 2821	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑎 → (𝑖 ∈ (𝐿...(𝐽 − 1)) ↔ 𝑎 ∈ (𝐿...(𝐽 − 1))))
131	130	anbi2d 629	. . . . . . . . . 10 ⊢ (𝑖 = 𝑎 → (((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑖 ∈ (𝐿...(𝐽 − 1))) ↔ ((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑎 ∈ (𝐿...(𝐽 − 1)))))
132	131, 34	imbi12d 345	. . . . . . . . 9 ⊢ (𝑖 = 𝑎 → ((((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑖 ∈ (𝐿...(𝐽 − 1))) → (𝐵‘𝑖) ∈ ℝ) ↔ (((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑎 ∈ (𝐿...(𝐽 − 1))) → (𝐵‘𝑎) ∈ ℝ)))
133	6	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...(𝐽 − 1))) → 𝐿 ∈ ℤ)
134	52	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...(𝐽 − 1))) → 𝑀 ∈ ℤ)
135		elfzelz 13244	. . . . . . . . . . . . 13 ⊢ (𝑖 ∈ (𝐿...(𝐽 − 1)) → 𝑖 ∈ ℤ)
136	135	adantl 482	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...(𝐽 − 1))) → 𝑖 ∈ ℤ)
137		elfzle1 13247	. . . . . . . . . . . . 13 ⊢ (𝑖 ∈ (𝐿...(𝐽 − 1)) → 𝐿 ≤ 𝑖)
138	137	adantl 482	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...(𝐽 − 1))) → 𝐿 ≤ 𝑖)
139	135	zred 12414	. . . . . . . . . . . . . 14 ⊢ (𝑖 ∈ (𝐿...(𝐽 − 1)) → 𝑖 ∈ ℝ)
140	139	adantl 482	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...(𝐽 − 1))) → 𝑖 ∈ ℝ)
141	60	adantr 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...(𝐽 − 1))) → 𝐽 ∈ ℝ)
142	52	zred 12414	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑀 ∈ ℝ)
143	142	adantr 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...(𝐽 − 1))) → 𝑀 ∈ ℝ)
144		1red 10964	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 1 ∈ ℝ)
145	60, 144	resubcld 11391	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐽 − 1) ∈ ℝ)
146	145	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...(𝐽 − 1))) → (𝐽 − 1) ∈ ℝ)
147		elfzle2 13248	. . . . . . . . . . . . . . 15 ⊢ (𝑖 ∈ (𝐿...(𝐽 − 1)) → 𝑖 ≤ (𝐽 − 1))
148	147	adantl 482	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...(𝐽 − 1))) → 𝑖 ≤ (𝐽 − 1))
149	60	lem1d 11896	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐽 − 1) ≤ 𝐽)
150	149	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...(𝐽 − 1))) → (𝐽 − 1) ≤ 𝐽)
151	140, 146, 141, 148, 150	letrd 11120	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...(𝐽 − 1))) → 𝑖 ≤ 𝐽)
152		elfzle2 13248	. . . . . . . . . . . . . . 15 ⊢ (𝐽 ∈ (𝐿...𝑀) → 𝐽 ≤ 𝑀)
153	41, 152	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐽 ≤ 𝑀)
154	153	adantr 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...(𝐽 − 1))) → 𝐽 ≤ 𝑀)
155	140, 141, 143, 151, 154	letrd 11120	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...(𝐽 − 1))) → 𝑖 ≤ 𝑀)
156	133, 134, 136, 138, 155	elfzd 13235	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...(𝐽 − 1))) → 𝑖 ∈ (𝐿...𝑀))
157	156, 10	syldan 591	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...(𝐽 − 1))) → (𝐵‘𝑖) ∈ ℝ)
158	157	adantlr 712	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑖 ∈ (𝐿...(𝐽 − 1))) → (𝐵‘𝑖) ∈ ℝ)
159	129, 132, 158	chvarfv 2233	. . . . . . . 8 ⊢ (((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑎 ∈ (𝐿...(𝐽 − 1))) → (𝐵‘𝑎) ∈ ℝ)
160	37	adantl 482	. . . . . . . 8 ⊢ (((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ (𝑎 ∈ ℝ ∧ 𝑗 ∈ ℝ)) → (𝑎 · 𝑗) ∈ ℝ)
161	112, 159, 160	seqcl 13731	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (seq𝐿( · , 𝐵)‘(𝐽 − 1)) ∈ ℝ)
162		1red 10964	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → 1 ∈ ℝ)
163		eqid 2738	. . . . . . . . 9 ⊢ seq𝐽( · , 𝐵) = seq𝐽( · , 𝐵)
164	43	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → 𝑀 ∈ (ℤ_≥‘𝐽))
165		eluzfz2 13252	. . . . . . . . . . 11 ⊢ (𝑀 ∈ (ℤ_≥‘𝐽) → 𝑀 ∈ (𝐽...𝑀))
166	43, 165	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ (𝐽...𝑀))
167	166	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → 𝑀 ∈ (𝐽...𝑀))
168	73	adantlr 712	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑖 ∈ (𝐽...𝑀)) → (𝐵‘𝑖) ∈ ℝ)
169	72, 12	syldan 591	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐽...𝑀)) → 0 ≤ (𝐵‘𝑖))
170	169	adantlr 712	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑖 ∈ (𝐽...𝑀)) → 0 ≤ (𝐵‘𝑖))
171	72, 14	syldan 591	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐽...𝑀)) → (𝐵‘𝑖) ≤ 1)
172	171	adantlr 712	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑖 ∈ (𝐽...𝑀)) → (𝐵‘𝑖) ≤ 1)
173	1, 114, 163, 96, 164, 167, 168, 170, 172	fmul01 43080	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (0 ≤ (seq𝐽( · , 𝐵)‘𝑀) ∧ (seq𝐽( · , 𝐵)‘𝑀) ≤ 1))
174	173	simpld 495	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → 0 ≤ (seq𝐽( · , 𝐵)‘𝑀))
175		eqid 2738	. . . . . . . . 9 ⊢ seq𝐿( · , 𝐵) = seq𝐿( · , 𝐵)
176	8	adantr 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → 𝑀 ∈ (ℤ_≥‘𝐿))
177		1zzd 12339	. . . . . . . . . . . . 13 ⊢ (𝜑 → 1 ∈ ℤ)
178	59, 177	zsubcld 12419	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐽 − 1) ∈ ℤ)
179	6, 52, 178	3jca 1127	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ (𝐽 − 1) ∈ ℤ))
180	179	adantr 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ (𝐽 − 1) ∈ ℤ))
181	145, 60, 142	3jca 1127	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝐽 − 1) ∈ ℝ ∧ 𝐽 ∈ ℝ ∧ 𝑀 ∈ ℝ))
182	181	adantr 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → ((𝐽 − 1) ∈ ℝ ∧ 𝐽 ∈ ℝ ∧ 𝑀 ∈ ℝ))
183	60	adantr 481	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → 𝐽 ∈ ℝ)
184	183	lem1d 11896	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (𝐽 − 1) ≤ 𝐽)
185	153	adantr 481	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → 𝐽 ≤ 𝑀)
186	184, 185	jca 512	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → ((𝐽 − 1) ≤ 𝐽 ∧ 𝐽 ≤ 𝑀))
187		letr 11057	. . . . . . . . . . . 12 ⊢ (((𝐽 − 1) ∈ ℝ ∧ 𝐽 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (((𝐽 − 1) ≤ 𝐽 ∧ 𝐽 ≤ 𝑀) → (𝐽 − 1) ≤ 𝑀))
188	182, 186, 187	sylc 65	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (𝐽 − 1) ≤ 𝑀)
189	110, 188	jca 512	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (𝐿 ≤ (𝐽 − 1) ∧ (𝐽 − 1) ≤ 𝑀))
190		elfz2 13234	. . . . . . . . . 10 ⊢ ((𝐽 − 1) ∈ (𝐿...𝑀) ↔ ((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ (𝐽 − 1) ∈ ℤ) ∧ (𝐿 ≤ (𝐽 − 1) ∧ (𝐽 − 1) ≤ 𝑀)))
191	180, 189, 190	sylanbrc 583	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (𝐽 − 1) ∈ (𝐿...𝑀))
192	12	adantlr 712	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑖 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝑖))
193	14	adantlr 712	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ 𝐽 = 𝐿) ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ≤ 1)
194	1, 114, 175, 95, 176, 191, 119, 192, 193	fmul01 43080	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (0 ≤ (seq𝐿( · , 𝐵)‘(𝐽 − 1)) ∧ (seq𝐿( · , 𝐵)‘(𝐽 − 1)) ≤ 1))
195	194	simprd 496	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (seq𝐿( · , 𝐵)‘(𝐽 − 1)) ≤ 1)
196	161, 162, 76, 174, 195	lemul1ad 11902	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → ((seq𝐿( · , 𝐵)‘(𝐽 − 1)) · (seq𝐽( · , 𝐵)‘𝑀)) ≤ (1 · (seq𝐽( · , 𝐵)‘𝑀)))
197	126, 196	eqbrtrd 5096	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (seq𝐿( · , 𝐵)‘𝑀) ≤ (1 · (seq𝐽( · , 𝐵)‘𝑀)))
198	76	recnd 10991	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (seq𝐽( · , 𝐵)‘𝑀) ∈ ℂ)
199	198	mulid2d 10981	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (1 · (seq𝐽( · , 𝐵)‘𝑀)) = (seq𝐽( · , 𝐵)‘𝑀))
200	197, 199	breqtrd 5100	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (seq𝐿( · , 𝐵)‘𝑀) ≤ (seq𝐽( · , 𝐵)‘𝑀))
201	1, 2, 163, 59, 43, 73, 169, 171, 16, 20	fmul01lt1lem1 43084	. . . . 5 ⊢ (𝜑 → (seq𝐽( · , 𝐵)‘𝑀) < 𝐸)
202	201	adantr 481	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (seq𝐽( · , 𝐵)‘𝑀) < 𝐸)
203	40, 76, 78, 200, 202	lelttrd 11121	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (seq𝐿( · , 𝐵)‘𝑀) < 𝐸)
204	24, 203	eqbrtrid 5109	. 2 ⊢ ((𝜑 ∧ ¬ 𝐽 = 𝐿) → (𝐴‘𝑀) < 𝐸)
205	23, 204	pm2.61dan 810	1 ⊢ (𝜑 → (𝐴‘𝑀) < 𝐸)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∨ wo 844 ∧ w3a 1086 = wceq 1539 Ⅎwnf 1786 ∈ wcel 2106 Ⅎwnfc 2887 class class class wbr 5074 ‘cfv 6427 (class class class)co 7268 ℝcr 10858 0cc0 10859 1c1 10860 + caddc 10862 · cmul 10864 < clt 10997 ≤ cle 10998 − cmin 11193 ℤcz 12307 ℤ_≥cuz 12570 ℝ⁺crp 12718 ...cfz 13227 seqcseq 13709

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 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 2709 ax-sep 5222 ax-nul 5229 ax-pow 5287 ax-pr 5351 ax-un 7579 ax-cnex 10915 ax-resscn 10916 ax-1cn 10917 ax-icn 10918 ax-addcl 10919 ax-addrcl 10920 ax-mulcl 10921 ax-mulrcl 10922 ax-mulcom 10923 ax-addass 10924 ax-mulass 10925 ax-distr 10926 ax-i2m1 10927 ax-1ne0 10928 ax-1rid 10929 ax-rnegex 10930 ax-rrecex 10931 ax-cnre 10932 ax-pre-lttri 10933 ax-pre-lttrn 10934 ax-pre-ltadd 10935 ax-pre-mulgt0 10936

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-reu 3071 df-rab 3073 df-v 3432 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4258 df-if 4461 df-pw 4536 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4841 df-iun 4927 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5485 df-eprel 5491 df-po 5499 df-so 5500 df-fr 5540 df-we 5542 df-xp 5591 df-rel 5592 df-cnv 5593 df-co 5594 df-dm 5595 df-rn 5596 df-res 5597 df-ima 5598 df-pred 6196 df-ord 6263 df-on 6264 df-lim 6265 df-suc 6266 df-iota 6385 df-fun 6429 df-fn 6430 df-f 6431 df-f1 6432 df-fo 6433 df-f1o 6434 df-fv 6435 df-riota 7225 df-ov 7271 df-oprab 7272 df-mpo 7273 df-om 7704 df-1st 7821 df-2nd 7822 df-frecs 8085 df-wrecs 8116 df-recs 8190 df-rdg 8229 df-er 8486 df-en 8722 df-dom 8723 df-sdom 8724 df-pnf 10999 df-mnf 11000 df-xr 11001 df-ltxr 11002 df-le 11003 df-sub 11195 df-neg 11196 df-nn 11962 df-n0 12222 df-z 12308 df-uz 12571 df-rp 12719 df-fz 13228 df-fzo 13371 df-seq 13710

This theorem is referenced by: fmul01lt1 43086

W3C validator