fmul01 - Mathbox for Glauco Siliprandi

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

Theorem fmul01 44997

Description: Multiplying a finite number of values in [ 0 , 1 ] , gives the final product itself a number in [ 0 , 1 ]. (Contributed by Glauco Siliprandi, 20-Apr-2017.)

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

**Assertion**
Ref	Expression
fmul01	⊢ (𝜑 → (0 ≤ (𝐴‘𝐾) ∧ (𝐴‘𝐾) ≤ 1))

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

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

Step	Hyp	Ref	Expression
1		fmul01.6	. 2 ⊢ (𝜑 → 𝐾 ∈ (𝐿...𝑀))
2		fveq2 6902	. . . . . 6 ⊢ (𝑘 = 𝐿 → (𝐴‘𝑘) = (𝐴‘𝐿))
3	2	breq2d 5164	. . . . 5 ⊢ (𝑘 = 𝐿 → (0 ≤ (𝐴‘𝑘) ↔ 0 ≤ (𝐴‘𝐿)))
4	2	breq1d 5162	. . . . 5 ⊢ (𝑘 = 𝐿 → ((𝐴‘𝑘) ≤ 1 ↔ (𝐴‘𝐿) ≤ 1))
5	3, 4	anbi12d 630	. . . 4 ⊢ (𝑘 = 𝐿 → ((0 ≤ (𝐴‘𝑘) ∧ (𝐴‘𝑘) ≤ 1) ↔ (0 ≤ (𝐴‘𝐿) ∧ (𝐴‘𝐿) ≤ 1)))
6	5	imbi2d 339	. . 3 ⊢ (𝑘 = 𝐿 → ((𝜑 → (0 ≤ (𝐴‘𝑘) ∧ (𝐴‘𝑘) ≤ 1)) ↔ (𝜑 → (0 ≤ (𝐴‘𝐿) ∧ (𝐴‘𝐿) ≤ 1))))
7		fveq2 6902	. . . . . 6 ⊢ (𝑘 = 𝑗 → (𝐴‘𝑘) = (𝐴‘𝑗))
8	7	breq2d 5164	. . . . 5 ⊢ (𝑘 = 𝑗 → (0 ≤ (𝐴‘𝑘) ↔ 0 ≤ (𝐴‘𝑗)))
9	7	breq1d 5162	. . . . 5 ⊢ (𝑘 = 𝑗 → ((𝐴‘𝑘) ≤ 1 ↔ (𝐴‘𝑗) ≤ 1))
10	8, 9	anbi12d 630	. . . 4 ⊢ (𝑘 = 𝑗 → ((0 ≤ (𝐴‘𝑘) ∧ (𝐴‘𝑘) ≤ 1) ↔ (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)))
11	10	imbi2d 339	. . 3 ⊢ (𝑘 = 𝑗 → ((𝜑 → (0 ≤ (𝐴‘𝑘) ∧ (𝐴‘𝑘) ≤ 1)) ↔ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1))))
12		fveq2 6902	. . . . . 6 ⊢ (𝑘 = (𝑗 + 1) → (𝐴‘𝑘) = (𝐴‘(𝑗 + 1)))
13	12	breq2d 5164	. . . . 5 ⊢ (𝑘 = (𝑗 + 1) → (0 ≤ (𝐴‘𝑘) ↔ 0 ≤ (𝐴‘(𝑗 + 1))))
14	12	breq1d 5162	. . . . 5 ⊢ (𝑘 = (𝑗 + 1) → ((𝐴‘𝑘) ≤ 1 ↔ (𝐴‘(𝑗 + 1)) ≤ 1))
15	13, 14	anbi12d 630	. . . 4 ⊢ (𝑘 = (𝑗 + 1) → ((0 ≤ (𝐴‘𝑘) ∧ (𝐴‘𝑘) ≤ 1) ↔ (0 ≤ (𝐴‘(𝑗 + 1)) ∧ (𝐴‘(𝑗 + 1)) ≤ 1)))
16	15	imbi2d 339	. . 3 ⊢ (𝑘 = (𝑗 + 1) → ((𝜑 → (0 ≤ (𝐴‘𝑘) ∧ (𝐴‘𝑘) ≤ 1)) ↔ (𝜑 → (0 ≤ (𝐴‘(𝑗 + 1)) ∧ (𝐴‘(𝑗 + 1)) ≤ 1))))
17		fveq2 6902	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝐴‘𝑘) = (𝐴‘𝐾))
18	17	breq2d 5164	. . . . 5 ⊢ (𝑘 = 𝐾 → (0 ≤ (𝐴‘𝑘) ↔ 0 ≤ (𝐴‘𝐾)))
19	17	breq1d 5162	. . . . 5 ⊢ (𝑘 = 𝐾 → ((𝐴‘𝑘) ≤ 1 ↔ (𝐴‘𝐾) ≤ 1))
20	18, 19	anbi12d 630	. . . 4 ⊢ (𝑘 = 𝐾 → ((0 ≤ (𝐴‘𝑘) ∧ (𝐴‘𝑘) ≤ 1) ↔ (0 ≤ (𝐴‘𝐾) ∧ (𝐴‘𝐾) ≤ 1)))
21	20	imbi2d 339	. . 3 ⊢ (𝑘 = 𝐾 → ((𝜑 → (0 ≤ (𝐴‘𝑘) ∧ (𝐴‘𝑘) ≤ 1)) ↔ (𝜑 → (0 ≤ (𝐴‘𝐾) ∧ (𝐴‘𝐾) ≤ 1))))
22		fmul01.4	. . . . . . . 8 ⊢ (𝜑 → 𝐿 ∈ ℤ)
23		fmul01.5	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘𝐿))
24		eluzelz 12870	. . . . . . . . 9 ⊢ (𝑀 ∈ (ℤ_≥‘𝐿) → 𝑀 ∈ ℤ)
25	23, 24	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑀 ∈ ℤ)
26	22	zred 12704	. . . . . . . . 9 ⊢ (𝜑 → 𝐿 ∈ ℝ)
27	26	leidd 11818	. . . . . . . 8 ⊢ (𝜑 → 𝐿 ≤ 𝐿)
28		eluz 12874	. . . . . . . . . 10 ⊢ ((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑀 ∈ (ℤ_≥‘𝐿) ↔ 𝐿 ≤ 𝑀))
29	22, 25, 28	syl2anc 582	. . . . . . . . 9 ⊢ (𝜑 → (𝑀 ∈ (ℤ_≥‘𝐿) ↔ 𝐿 ≤ 𝑀))
30	23, 29	mpbid 231	. . . . . . . 8 ⊢ (𝜑 → 𝐿 ≤ 𝑀)
31	22, 25, 22, 27, 30	elfzd 13532	. . . . . . 7 ⊢ (𝜑 → 𝐿 ∈ (𝐿...𝑀))
32	31	ancli 547	. . . . . . 7 ⊢ (𝜑 → (𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)))
33		fmul01.2	. . . . . . . . . 10 ⊢ Ⅎ𝑖𝜑
34		nfv 1909	. . . . . . . . . 10 ⊢ Ⅎ𝑖 𝐿 ∈ (𝐿...𝑀)
35	33, 34	nfan 1894	. . . . . . . . 9 ⊢ Ⅎ𝑖(𝜑 ∧ 𝐿 ∈ (𝐿...𝑀))
36		nfcv 2899	. . . . . . . . . 10 ⊢ Ⅎ𝑖0
37		nfcv 2899	. . . . . . . . . 10 ⊢ Ⅎ𝑖 ≤
38		fmul01.1	. . . . . . . . . . 11 ⊢ Ⅎ𝑖𝐵
39		nfcv 2899	. . . . . . . . . . 11 ⊢ Ⅎ𝑖𝐿
40	38, 39	nffv 6912	. . . . . . . . . 10 ⊢ Ⅎ𝑖(𝐵‘𝐿)
41	36, 37, 40	nfbr 5199	. . . . . . . . 9 ⊢ Ⅎ𝑖0 ≤ (𝐵‘𝐿)
42	35, 41	nfim 1891	. . . . . . . 8 ⊢ Ⅎ𝑖((𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝐿))
43		eleq1 2817	. . . . . . . . . 10 ⊢ (𝑖 = 𝐿 → (𝑖 ∈ (𝐿...𝑀) ↔ 𝐿 ∈ (𝐿...𝑀)))
44	43	anbi2d 628	. . . . . . . . 9 ⊢ (𝑖 = 𝐿 → ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) ↔ (𝜑 ∧ 𝐿 ∈ (𝐿...𝑀))))
45		fveq2 6902	. . . . . . . . . 10 ⊢ (𝑖 = 𝐿 → (𝐵‘𝑖) = (𝐵‘𝐿))
46	45	breq2d 5164	. . . . . . . . 9 ⊢ (𝑖 = 𝐿 → (0 ≤ (𝐵‘𝑖) ↔ 0 ≤ (𝐵‘𝐿)))
47	44, 46	imbi12d 343	. . . . . . . 8 ⊢ (𝑖 = 𝐿 → (((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝑖)) ↔ ((𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝐿))))
48		fmul01.8	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝑖))
49	42, 47, 48	vtoclg1f 3558	. . . . . . 7 ⊢ (𝐿 ∈ (𝐿...𝑀) → ((𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝐿)))
50	31, 32, 49	sylc 65	. . . . . 6 ⊢ (𝜑 → 0 ≤ (𝐵‘𝐿))
51		fmul01.3	. . . . . . . 8 ⊢ 𝐴 = seq𝐿( · , 𝐵)
52	51	fveq1i 6903	. . . . . . 7 ⊢ (𝐴‘𝐿) = (seq𝐿( · , 𝐵)‘𝐿)
53		seq1 14019	. . . . . . . 8 ⊢ (𝐿 ∈ ℤ → (seq𝐿( · , 𝐵)‘𝐿) = (𝐵‘𝐿))
54	22, 53	syl 17	. . . . . . 7 ⊢ (𝜑 → (seq𝐿( · , 𝐵)‘𝐿) = (𝐵‘𝐿))
55	52, 54	eqtrid 2780	. . . . . 6 ⊢ (𝜑 → (𝐴‘𝐿) = (𝐵‘𝐿))
56	50, 55	breqtrrd 5180	. . . . 5 ⊢ (𝜑 → 0 ≤ (𝐴‘𝐿))
57		nfcv 2899	. . . . . . . . . 10 ⊢ Ⅎ𝑖1
58	40, 37, 57	nfbr 5199	. . . . . . . . 9 ⊢ Ⅎ𝑖(𝐵‘𝐿) ≤ 1
59	35, 58	nfim 1891	. . . . . . . 8 ⊢ Ⅎ𝑖((𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)) → (𝐵‘𝐿) ≤ 1)
60	45	breq1d 5162	. . . . . . . . 9 ⊢ (𝑖 = 𝐿 → ((𝐵‘𝑖) ≤ 1 ↔ (𝐵‘𝐿) ≤ 1))
61	44, 60	imbi12d 343	. . . . . . . 8 ⊢ (𝑖 = 𝐿 → (((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ≤ 1) ↔ ((𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)) → (𝐵‘𝐿) ≤ 1)))
62		fmul01.9	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ≤ 1)
63	59, 61, 62	vtoclg1f 3558	. . . . . . 7 ⊢ (𝐿 ∈ (𝐿...𝑀) → ((𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)) → (𝐵‘𝐿) ≤ 1))
64	31, 32, 63	sylc 65	. . . . . 6 ⊢ (𝜑 → (𝐵‘𝐿) ≤ 1)
65	55, 64	eqbrtrd 5174	. . . . 5 ⊢ (𝜑 → (𝐴‘𝐿) ≤ 1)
66	56, 65	jca 510	. . . 4 ⊢ (𝜑 → (0 ≤ (𝐴‘𝐿) ∧ (𝐴‘𝐿) ≤ 1))
67	66	a1i 11	. . 3 ⊢ (𝑀 ∈ (ℤ_≥‘𝐿) → (𝜑 → (0 ≤ (𝐴‘𝐿) ∧ (𝐴‘𝐿) ≤ 1)))
68		elfzouz 13676	. . . . . . . . . 10 ⊢ (𝑗 ∈ (𝐿..^𝑀) → 𝑗 ∈ (ℤ_≥‘𝐿))
69	68	3ad2ant1 1130	. . . . . . . . 9 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 𝑗 ∈ (ℤ_≥‘𝐿))
70		simpl3 1190	. . . . . . . . . 10 ⊢ (((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) ∧ 𝑘 ∈ (𝐿...𝑗)) → 𝜑)
71		elfzouz2 13687	. . . . . . . . . . . . 13 ⊢ (𝑗 ∈ (𝐿..^𝑀) → 𝑀 ∈ (ℤ_≥‘𝑗))
72		fzss2 13581	. . . . . . . . . . . . 13 ⊢ (𝑀 ∈ (ℤ_≥‘𝑗) → (𝐿...𝑗) ⊆ (𝐿...𝑀))
73	71, 72	syl 17	. . . . . . . . . . . 12 ⊢ (𝑗 ∈ (𝐿..^𝑀) → (𝐿...𝑗) ⊆ (𝐿...𝑀))
74	73	3ad2ant1 1130	. . . . . . . . . . 11 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (𝐿...𝑗) ⊆ (𝐿...𝑀))
75	74	sselda 3982	. . . . . . . . . 10 ⊢ (((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) ∧ 𝑘 ∈ (𝐿...𝑗)) → 𝑘 ∈ (𝐿...𝑀))
76		nfv 1909	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖 𝑘 ∈ (𝐿...𝑀)
77	33, 76	nfan 1894	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖(𝜑 ∧ 𝑘 ∈ (𝐿...𝑀))
78		nfcv 2899	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑖𝑘
79	38, 78	nffv 6912	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖(𝐵‘𝑘)
80	79	nfel1 2916	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖(𝐵‘𝑘) ∈ ℝ
81	77, 80	nfim 1891	. . . . . . . . . . 11 ⊢ Ⅎ𝑖((𝜑 ∧ 𝑘 ∈ (𝐿...𝑀)) → (𝐵‘𝑘) ∈ ℝ)
82		eleq1 2817	. . . . . . . . . . . . 13 ⊢ (𝑖 = 𝑘 → (𝑖 ∈ (𝐿...𝑀) ↔ 𝑘 ∈ (𝐿...𝑀)))
83	82	anbi2d 628	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝑘 → ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) ↔ (𝜑 ∧ 𝑘 ∈ (𝐿...𝑀))))
84		fveq2 6902	. . . . . . . . . . . . 13 ⊢ (𝑖 = 𝑘 → (𝐵‘𝑖) = (𝐵‘𝑘))
85	84	eleq1d 2814	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝑘 → ((𝐵‘𝑖) ∈ ℝ ↔ (𝐵‘𝑘) ∈ ℝ))
86	83, 85	imbi12d 343	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑘 → (((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ∈ ℝ) ↔ ((𝜑 ∧ 𝑘 ∈ (𝐿...𝑀)) → (𝐵‘𝑘) ∈ ℝ)))
87		fmul01.7	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ∈ ℝ)
88	81, 86, 87	chvarfv 2228	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐿...𝑀)) → (𝐵‘𝑘) ∈ ℝ)
89	70, 75, 88	syl2anc 582	. . . . . . . . 9 ⊢ (((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) ∧ 𝑘 ∈ (𝐿...𝑗)) → (𝐵‘𝑘) ∈ ℝ)
90		remulcl 11231	. . . . . . . . . 10 ⊢ ((𝑘 ∈ ℝ ∧ 𝑙 ∈ ℝ) → (𝑘 · 𝑙) ∈ ℝ)
91	90	adantl 480	. . . . . . . . 9 ⊢ (((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) ∧ (𝑘 ∈ ℝ ∧ 𝑙 ∈ ℝ)) → (𝑘 · 𝑙) ∈ ℝ)
92	69, 89, 91	seqcl 14027	. . . . . . . 8 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (seq𝐿( · , 𝐵)‘𝑗) ∈ ℝ)
93		simp3 1135	. . . . . . . . 9 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 𝜑)
94		fzofzp1 13769	. . . . . . . . . 10 ⊢ (𝑗 ∈ (𝐿..^𝑀) → (𝑗 + 1) ∈ (𝐿...𝑀))
95	94	3ad2ant1 1130	. . . . . . . . 9 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (𝑗 + 1) ∈ (𝐿...𝑀))
96		nfv 1909	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖(𝑗 + 1) ∈ (𝐿...𝑀)
97	33, 96	nfan 1894	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖(𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀))
98		nfcv 2899	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑖(𝑗 + 1)
99	38, 98	nffv 6912	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖(𝐵‘(𝑗 + 1))
100	99	nfel1 2916	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖(𝐵‘(𝑗 + 1)) ∈ ℝ
101	97, 100	nfim 1891	. . . . . . . . . . 11 ⊢ Ⅎ𝑖((𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)) → (𝐵‘(𝑗 + 1)) ∈ ℝ)
102		eleq1 2817	. . . . . . . . . . . . 13 ⊢ (𝑖 = (𝑗 + 1) → (𝑖 ∈ (𝐿...𝑀) ↔ (𝑗 + 1) ∈ (𝐿...𝑀)))
103	102	anbi2d 628	. . . . . . . . . . . 12 ⊢ (𝑖 = (𝑗 + 1) → ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) ↔ (𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀))))
104		fveq2 6902	. . . . . . . . . . . . 13 ⊢ (𝑖 = (𝑗 + 1) → (𝐵‘𝑖) = (𝐵‘(𝑗 + 1)))
105	104	eleq1d 2814	. . . . . . . . . . . 12 ⊢ (𝑖 = (𝑗 + 1) → ((𝐵‘𝑖) ∈ ℝ ↔ (𝐵‘(𝑗 + 1)) ∈ ℝ))
106	103, 105	imbi12d 343	. . . . . . . . . . 11 ⊢ (𝑖 = (𝑗 + 1) → (((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ∈ ℝ) ↔ ((𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)) → (𝐵‘(𝑗 + 1)) ∈ ℝ)))
107	101, 106, 87	vtoclg1f 3558	. . . . . . . . . 10 ⊢ ((𝑗 + 1) ∈ (𝐿...𝑀) → ((𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)) → (𝐵‘(𝑗 + 1)) ∈ ℝ))
108	107	anabsi7 669	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)) → (𝐵‘(𝑗 + 1)) ∈ ℝ)
109	93, 95, 108	syl2anc 582	. . . . . . . 8 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (𝐵‘(𝑗 + 1)) ∈ ℝ)
110		pm3.35 801	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1))) → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1))
111	110	ancoms 457	. . . . . . . . . . 11 ⊢ (((𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1))
112		simpl 481	. . . . . . . . . . 11 ⊢ ((0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1) → 0 ≤ (𝐴‘𝑗))
113	111, 112	syl 17	. . . . . . . . . 10 ⊢ (((𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 0 ≤ (𝐴‘𝑗))
114	113	3adant1 1127	. . . . . . . . 9 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 0 ≤ (𝐴‘𝑗))
115	51	fveq1i 6903	. . . . . . . . 9 ⊢ (𝐴‘𝑗) = (seq𝐿( · , 𝐵)‘𝑗)
116	114, 115	breqtrdi 5193	. . . . . . . 8 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 0 ≤ (seq𝐿( · , 𝐵)‘𝑗))
117		simp1 1133	. . . . . . . . 9 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 𝑗 ∈ (𝐿..^𝑀))
118	94	adantl 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝐿..^𝑀)) → (𝑗 + 1) ∈ (𝐿...𝑀))
119		simpl 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝐿..^𝑀)) → 𝜑)
120	119, 118	jca 510	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝐿..^𝑀)) → (𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)))
121	36, 37, 99	nfbr 5199	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖0 ≤ (𝐵‘(𝑗 + 1))
122	97, 121	nfim 1891	. . . . . . . . . . 11 ⊢ Ⅎ𝑖((𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘(𝑗 + 1)))
123	104	breq2d 5164	. . . . . . . . . . . 12 ⊢ (𝑖 = (𝑗 + 1) → (0 ≤ (𝐵‘𝑖) ↔ 0 ≤ (𝐵‘(𝑗 + 1))))
124	103, 123	imbi12d 343	. . . . . . . . . . 11 ⊢ (𝑖 = (𝑗 + 1) → (((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝑖)) ↔ ((𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘(𝑗 + 1)))))
125	122, 124, 48	vtoclg1f 3558	. . . . . . . . . 10 ⊢ ((𝑗 + 1) ∈ (𝐿...𝑀) → ((𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘(𝑗 + 1))))
126	118, 120, 125	sylc 65	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝐿..^𝑀)) → 0 ≤ (𝐵‘(𝑗 + 1)))
127	93, 117, 126	syl2anc 582	. . . . . . . 8 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 0 ≤ (𝐵‘(𝑗 + 1)))
128	92, 109, 116, 127	mulge0d 11829	. . . . . . 7 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 0 ≤ ((seq𝐿( · , 𝐵)‘𝑗) · (𝐵‘(𝑗 + 1))))
129		seqp1 14021	. . . . . . . 8 ⊢ (𝑗 ∈ (ℤ_≥‘𝐿) → (seq𝐿( · , 𝐵)‘(𝑗 + 1)) = ((seq𝐿( · , 𝐵)‘𝑗) · (𝐵‘(𝑗 + 1))))
130	69, 129	syl 17	. . . . . . 7 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (seq𝐿( · , 𝐵)‘(𝑗 + 1)) = ((seq𝐿( · , 𝐵)‘𝑗) · (𝐵‘(𝑗 + 1))))
131	128, 130	breqtrrd 5180	. . . . . 6 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 0 ≤ (seq𝐿( · , 𝐵)‘(𝑗 + 1)))
132	51	fveq1i 6903	. . . . . 6 ⊢ (𝐴‘(𝑗 + 1)) = (seq𝐿( · , 𝐵)‘(𝑗 + 1))
133	131, 132	breqtrrdi 5194	. . . . 5 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 0 ≤ (𝐴‘(𝑗 + 1)))
134	92, 109	remulcld 11282	. . . . . . . 8 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → ((seq𝐿( · , 𝐵)‘𝑗) · (𝐵‘(𝑗 + 1))) ∈ ℝ)
135		1red 11253	. . . . . . . 8 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 1 ∈ ℝ)
136	93, 95	jca 510	. . . . . . . . . . 11 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)))
137	99, 37, 57	nfbr 5199	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖(𝐵‘(𝑗 + 1)) ≤ 1
138	97, 137	nfim 1891	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖((𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)) → (𝐵‘(𝑗 + 1)) ≤ 1)
139	104	breq1d 5162	. . . . . . . . . . . . 13 ⊢ (𝑖 = (𝑗 + 1) → ((𝐵‘𝑖) ≤ 1 ↔ (𝐵‘(𝑗 + 1)) ≤ 1))
140	103, 139	imbi12d 343	. . . . . . . . . . . 12 ⊢ (𝑖 = (𝑗 + 1) → (((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ≤ 1) ↔ ((𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)) → (𝐵‘(𝑗 + 1)) ≤ 1)))
141	138, 140, 62	vtoclg1f 3558	. . . . . . . . . . 11 ⊢ ((𝑗 + 1) ∈ (𝐿...𝑀) → ((𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)) → (𝐵‘(𝑗 + 1)) ≤ 1))
142	95, 136, 141	sylc 65	. . . . . . . . . 10 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (𝐵‘(𝑗 + 1)) ≤ 1)
143	109, 135, 92, 116, 142	lemul2ad 12192	. . . . . . . . 9 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → ((seq𝐿( · , 𝐵)‘𝑗) · (𝐵‘(𝑗 + 1))) ≤ ((seq𝐿( · , 𝐵)‘𝑗) · 1))
144	92	recnd 11280	. . . . . . . . . 10 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (seq𝐿( · , 𝐵)‘𝑗) ∈ ℂ)
145	144	mulridd 11269	. . . . . . . . 9 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → ((seq𝐿( · , 𝐵)‘𝑗) · 1) = (seq𝐿( · , 𝐵)‘𝑗))
146	143, 145	breqtrd 5178	. . . . . . . 8 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → ((seq𝐿( · , 𝐵)‘𝑗) · (𝐵‘(𝑗 + 1))) ≤ (seq𝐿( · , 𝐵)‘𝑗))
147		simp2 1134	. . . . . . . . . 10 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)))
148	110	simprd 494	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1))) → (𝐴‘𝑗) ≤ 1)
149	93, 147, 148	syl2anc 582	. . . . . . . . 9 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (𝐴‘𝑗) ≤ 1)
150	115, 149	eqbrtrrid 5188	. . . . . . . 8 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (seq𝐿( · , 𝐵)‘𝑗) ≤ 1)
151	134, 92, 135, 146, 150	letrd 11409	. . . . . . 7 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → ((seq𝐿( · , 𝐵)‘𝑗) · (𝐵‘(𝑗 + 1))) ≤ 1)
152	130, 151	eqbrtrd 5174	. . . . . 6 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (seq𝐿( · , 𝐵)‘(𝑗 + 1)) ≤ 1)
153	132, 152	eqbrtrid 5187	. . . . 5 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (𝐴‘(𝑗 + 1)) ≤ 1)
154	133, 153	jca 510	. . . 4 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (0 ≤ (𝐴‘(𝑗 + 1)) ∧ (𝐴‘(𝑗 + 1)) ≤ 1))
155	154	3exp 1116	. . 3 ⊢ (𝑗 ∈ (𝐿..^𝑀) → ((𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) → (𝜑 → (0 ≤ (𝐴‘(𝑗 + 1)) ∧ (𝐴‘(𝑗 + 1)) ≤ 1))))
156	6, 11, 16, 21, 67, 155	fzind2 13790	. 2 ⊢ (𝐾 ∈ (𝐿...𝑀) → (𝜑 → (0 ≤ (𝐴‘𝐾) ∧ (𝐴‘𝐾) ≤ 1)))
157	1, 156	mpcom 38	1 ⊢ (𝜑 → (0 ≤ (𝐴‘𝐾) ∧ (𝐴‘𝐾) ≤ 1))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 ∧ w3a 1084 = wceq 1533 Ⅎwnf 1777 ∈ wcel 2098 Ⅎwnfc 2879 ⊆ wss 3949 class class class wbr 5152 ‘cfv 6553 (class class class)co 7426 ℝcr 11145 0cc0 11146 1c1 11147 + caddc 11149 · cmul 11151 ≤ cle 11287 ℤcz 12596 ℤ_≥cuz 12860 ...cfz 13524 ..^cfzo 13667 seqcseq 14006

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2699 ax-sep 5303 ax-nul 5310 ax-pow 5369 ax-pr 5433 ax-un 7746 ax-cnex 11202 ax-resscn 11203 ax-1cn 11204 ax-icn 11205 ax-addcl 11206 ax-addrcl 11207 ax-mulcl 11208 ax-mulrcl 11209 ax-mulcom 11210 ax-addass 11211 ax-mulass 11212 ax-distr 11213 ax-i2m1 11214 ax-1ne0 11215 ax-1rid 11216 ax-rnegex 11217 ax-rrecex 11218 ax-cnre 11219 ax-pre-lttri 11220 ax-pre-lttrn 11221 ax-pre-ltadd 11222 ax-pre-mulgt0 11223

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-reu 3375 df-rab 3431 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4327 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-op 4639 df-uni 4913 df-iun 5002 df-br 5153 df-opab 5215 df-mpt 5236 df-tr 5270 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6310 df-ord 6377 df-on 6378 df-lim 6379 df-suc 6380 df-iota 6505 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 df-fv 6561 df-riota 7382 df-ov 7429 df-oprab 7430 df-mpo 7431 df-om 7877 df-1st 7999 df-2nd 8000 df-frecs 8293 df-wrecs 8324 df-recs 8398 df-rdg 8437 df-er 8731 df-en 8971 df-dom 8972 df-sdom 8973 df-pnf 11288 df-mnf 11289 df-xr 11290 df-ltxr 11291 df-le 11292 df-sub 11484 df-neg 11485 df-nn 12251 df-n0 12511 df-z 12597 df-uz 12861 df-fz 13525 df-fzo 13668 df-seq 14007

This theorem is referenced by: fmul01lt1lem1 45001 fmul01lt1lem2 45002

W3C validator