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 41850

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 6663	. . . . . 6 ⊢ (𝑘 = 𝐿 → (𝐴‘𝑘) = (𝐴‘𝐿))
3	2	breq2d 5069	. . . . 5 ⊢ (𝑘 = 𝐿 → (0 ≤ (𝐴‘𝑘) ↔ 0 ≤ (𝐴‘𝐿)))
4	2	breq1d 5067	. . . . 5 ⊢ (𝑘 = 𝐿 → ((𝐴‘𝑘) ≤ 1 ↔ (𝐴‘𝐿) ≤ 1))
5	3, 4	anbi12d 632	. . . 4 ⊢ (𝑘 = 𝐿 → ((0 ≤ (𝐴‘𝑘) ∧ (𝐴‘𝑘) ≤ 1) ↔ (0 ≤ (𝐴‘𝐿) ∧ (𝐴‘𝐿) ≤ 1)))
6	5	imbi2d 343	. . 3 ⊢ (𝑘 = 𝐿 → ((𝜑 → (0 ≤ (𝐴‘𝑘) ∧ (𝐴‘𝑘) ≤ 1)) ↔ (𝜑 → (0 ≤ (𝐴‘𝐿) ∧ (𝐴‘𝐿) ≤ 1))))
7		fveq2 6663	. . . . . 6 ⊢ (𝑘 = 𝑗 → (𝐴‘𝑘) = (𝐴‘𝑗))
8	7	breq2d 5069	. . . . 5 ⊢ (𝑘 = 𝑗 → (0 ≤ (𝐴‘𝑘) ↔ 0 ≤ (𝐴‘𝑗)))
9	7	breq1d 5067	. . . . 5 ⊢ (𝑘 = 𝑗 → ((𝐴‘𝑘) ≤ 1 ↔ (𝐴‘𝑗) ≤ 1))
10	8, 9	anbi12d 632	. . . 4 ⊢ (𝑘 = 𝑗 → ((0 ≤ (𝐴‘𝑘) ∧ (𝐴‘𝑘) ≤ 1) ↔ (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)))
11	10	imbi2d 343	. . 3 ⊢ (𝑘 = 𝑗 → ((𝜑 → (0 ≤ (𝐴‘𝑘) ∧ (𝐴‘𝑘) ≤ 1)) ↔ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1))))
12		fveq2 6663	. . . . . 6 ⊢ (𝑘 = (𝑗 + 1) → (𝐴‘𝑘) = (𝐴‘(𝑗 + 1)))
13	12	breq2d 5069	. . . . 5 ⊢ (𝑘 = (𝑗 + 1) → (0 ≤ (𝐴‘𝑘) ↔ 0 ≤ (𝐴‘(𝑗 + 1))))
14	12	breq1d 5067	. . . . 5 ⊢ (𝑘 = (𝑗 + 1) → ((𝐴‘𝑘) ≤ 1 ↔ (𝐴‘(𝑗 + 1)) ≤ 1))
15	13, 14	anbi12d 632	. . . 4 ⊢ (𝑘 = (𝑗 + 1) → ((0 ≤ (𝐴‘𝑘) ∧ (𝐴‘𝑘) ≤ 1) ↔ (0 ≤ (𝐴‘(𝑗 + 1)) ∧ (𝐴‘(𝑗 + 1)) ≤ 1)))
16	15	imbi2d 343	. . 3 ⊢ (𝑘 = (𝑗 + 1) → ((𝜑 → (0 ≤ (𝐴‘𝑘) ∧ (𝐴‘𝑘) ≤ 1)) ↔ (𝜑 → (0 ≤ (𝐴‘(𝑗 + 1)) ∧ (𝐴‘(𝑗 + 1)) ≤ 1))))
17		fveq2 6663	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝐴‘𝑘) = (𝐴‘𝐾))
18	17	breq2d 5069	. . . . 5 ⊢ (𝑘 = 𝐾 → (0 ≤ (𝐴‘𝑘) ↔ 0 ≤ (𝐴‘𝐾)))
19	17	breq1d 5067	. . . . 5 ⊢ (𝑘 = 𝐾 → ((𝐴‘𝑘) ≤ 1 ↔ (𝐴‘𝐾) ≤ 1))
20	18, 19	anbi12d 632	. . . 4 ⊢ (𝑘 = 𝐾 → ((0 ≤ (𝐴‘𝑘) ∧ (𝐴‘𝑘) ≤ 1) ↔ (0 ≤ (𝐴‘𝐾) ∧ (𝐴‘𝐾) ≤ 1)))
21	20	imbi2d 343	. . 3 ⊢ (𝑘 = 𝐾 → ((𝜑 → (0 ≤ (𝐴‘𝑘) ∧ (𝐴‘𝑘) ≤ 1)) ↔ (𝜑 → (0 ≤ (𝐴‘𝐾) ∧ (𝐴‘𝐾) ≤ 1))))
22		fmul01.4	. . . . . . . . . 10 ⊢ (𝜑 → 𝐿 ∈ ℤ)
23	22	zred 12079	. . . . . . . . 9 ⊢ (𝜑 → 𝐿 ∈ ℝ)
24	23	leidd 11198	. . . . . . . 8 ⊢ (𝜑 → 𝐿 ≤ 𝐿)
25		fmul01.5	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘𝐿))
26		eluzelz 12245	. . . . . . . . . . 11 ⊢ (𝑀 ∈ (ℤ_≥‘𝐿) → 𝑀 ∈ ℤ)
27	25, 26	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ ℤ)
28		eluz 12249	. . . . . . . . . 10 ⊢ ((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑀 ∈ (ℤ_≥‘𝐿) ↔ 𝐿 ≤ 𝑀))
29	22, 27, 28	syl2anc 586	. . . . . . . . 9 ⊢ (𝜑 → (𝑀 ∈ (ℤ_≥‘𝐿) ↔ 𝐿 ≤ 𝑀))
30	25, 29	mpbid 234	. . . . . . . 8 ⊢ (𝜑 → 𝐿 ≤ 𝑀)
31		elfz 12890	. . . . . . . . 9 ⊢ ((𝐿 ∈ ℤ ∧ 𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐿 ∈ (𝐿...𝑀) ↔ (𝐿 ≤ 𝐿 ∧ 𝐿 ≤ 𝑀)))
32	22, 22, 27, 31	syl3anc 1366	. . . . . . . 8 ⊢ (𝜑 → (𝐿 ∈ (𝐿...𝑀) ↔ (𝐿 ≤ 𝐿 ∧ 𝐿 ≤ 𝑀)))
33	24, 30, 32	mpbir2and 711	. . . . . . 7 ⊢ (𝜑 → 𝐿 ∈ (𝐿...𝑀))
34	33	ancli 551	. . . . . . 7 ⊢ (𝜑 → (𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)))
35		fmul01.2	. . . . . . . . . 10 ⊢ Ⅎ𝑖𝜑
36		nfv 1909	. . . . . . . . . 10 ⊢ Ⅎ𝑖 𝐿 ∈ (𝐿...𝑀)
37	35, 36	nfan 1894	. . . . . . . . 9 ⊢ Ⅎ𝑖(𝜑 ∧ 𝐿 ∈ (𝐿...𝑀))
38		nfcv 2975	. . . . . . . . . 10 ⊢ Ⅎ𝑖0
39		nfcv 2975	. . . . . . . . . 10 ⊢ Ⅎ𝑖 ≤
40		fmul01.1	. . . . . . . . . . 11 ⊢ Ⅎ𝑖𝐵
41		nfcv 2975	. . . . . . . . . . 11 ⊢ Ⅎ𝑖𝐿
42	40, 41	nffv 6673	. . . . . . . . . 10 ⊢ Ⅎ𝑖(𝐵‘𝐿)
43	38, 39, 42	nfbr 5104	. . . . . . . . 9 ⊢ Ⅎ𝑖0 ≤ (𝐵‘𝐿)
44	37, 43	nfim 1891	. . . . . . . 8 ⊢ Ⅎ𝑖((𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝐿))
45		eleq1 2898	. . . . . . . . . 10 ⊢ (𝑖 = 𝐿 → (𝑖 ∈ (𝐿...𝑀) ↔ 𝐿 ∈ (𝐿...𝑀)))
46	45	anbi2d 630	. . . . . . . . 9 ⊢ (𝑖 = 𝐿 → ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) ↔ (𝜑 ∧ 𝐿 ∈ (𝐿...𝑀))))
47		fveq2 6663	. . . . . . . . . 10 ⊢ (𝑖 = 𝐿 → (𝐵‘𝑖) = (𝐵‘𝐿))
48	47	breq2d 5069	. . . . . . . . 9 ⊢ (𝑖 = 𝐿 → (0 ≤ (𝐵‘𝑖) ↔ 0 ≤ (𝐵‘𝐿)))
49	46, 48	imbi12d 347	. . . . . . . 8 ⊢ (𝑖 = 𝐿 → (((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝑖)) ↔ ((𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝐿))))
50		fmul01.8	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝑖))
51	44, 49, 50	vtoclg1f 3565	. . . . . . 7 ⊢ (𝐿 ∈ (𝐿...𝑀) → ((𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝐿)))
52	33, 34, 51	sylc 65	. . . . . 6 ⊢ (𝜑 → 0 ≤ (𝐵‘𝐿))
53		fmul01.3	. . . . . . . 8 ⊢ 𝐴 = seq𝐿( · , 𝐵)
54	53	fveq1i 6664	. . . . . . 7 ⊢ (𝐴‘𝐿) = (seq𝐿( · , 𝐵)‘𝐿)
55		seq1 13374	. . . . . . . 8 ⊢ (𝐿 ∈ ℤ → (seq𝐿( · , 𝐵)‘𝐿) = (𝐵‘𝐿))
56	22, 55	syl 17	. . . . . . 7 ⊢ (𝜑 → (seq𝐿( · , 𝐵)‘𝐿) = (𝐵‘𝐿))
57	54, 56	syl5eq 2866	. . . . . 6 ⊢ (𝜑 → (𝐴‘𝐿) = (𝐵‘𝐿))
58	52, 57	breqtrrd 5085	. . . . 5 ⊢ (𝜑 → 0 ≤ (𝐴‘𝐿))
59		nfcv 2975	. . . . . . . . . 10 ⊢ Ⅎ𝑖1
60	42, 39, 59	nfbr 5104	. . . . . . . . 9 ⊢ Ⅎ𝑖(𝐵‘𝐿) ≤ 1
61	37, 60	nfim 1891	. . . . . . . 8 ⊢ Ⅎ𝑖((𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)) → (𝐵‘𝐿) ≤ 1)
62	47	breq1d 5067	. . . . . . . . 9 ⊢ (𝑖 = 𝐿 → ((𝐵‘𝑖) ≤ 1 ↔ (𝐵‘𝐿) ≤ 1))
63	46, 62	imbi12d 347	. . . . . . . 8 ⊢ (𝑖 = 𝐿 → (((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ≤ 1) ↔ ((𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)) → (𝐵‘𝐿) ≤ 1)))
64		fmul01.9	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ≤ 1)
65	61, 63, 64	vtoclg1f 3565	. . . . . . 7 ⊢ (𝐿 ∈ (𝐿...𝑀) → ((𝜑 ∧ 𝐿 ∈ (𝐿...𝑀)) → (𝐵‘𝐿) ≤ 1))
66	33, 34, 65	sylc 65	. . . . . 6 ⊢ (𝜑 → (𝐵‘𝐿) ≤ 1)
67	57, 66	eqbrtrd 5079	. . . . 5 ⊢ (𝜑 → (𝐴‘𝐿) ≤ 1)
68	58, 67	jca 514	. . . 4 ⊢ (𝜑 → (0 ≤ (𝐴‘𝐿) ∧ (𝐴‘𝐿) ≤ 1))
69	68	a1i 11	. . 3 ⊢ (𝑀 ∈ (ℤ_≥‘𝐿) → (𝜑 → (0 ≤ (𝐴‘𝐿) ∧ (𝐴‘𝐿) ≤ 1)))
70		elfzouz 13034	. . . . . . . . . 10 ⊢ (𝑗 ∈ (𝐿..^𝑀) → 𝑗 ∈ (ℤ_≥‘𝐿))
71	70	3ad2ant1 1128	. . . . . . . . 9 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 𝑗 ∈ (ℤ_≥‘𝐿))
72		simpl3 1188	. . . . . . . . . 10 ⊢ (((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) ∧ 𝑘 ∈ (𝐿...𝑗)) → 𝜑)
73		elfzouz2 13044	. . . . . . . . . . . . 13 ⊢ (𝑗 ∈ (𝐿..^𝑀) → 𝑀 ∈ (ℤ_≥‘𝑗))
74		fzss2 12939	. . . . . . . . . . . . 13 ⊢ (𝑀 ∈ (ℤ_≥‘𝑗) → (𝐿...𝑗) ⊆ (𝐿...𝑀))
75	73, 74	syl 17	. . . . . . . . . . . 12 ⊢ (𝑗 ∈ (𝐿..^𝑀) → (𝐿...𝑗) ⊆ (𝐿...𝑀))
76	75	3ad2ant1 1128	. . . . . . . . . . 11 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (𝐿...𝑗) ⊆ (𝐿...𝑀))
77	76	sselda 3965	. . . . . . . . . 10 ⊢ (((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) ∧ 𝑘 ∈ (𝐿...𝑗)) → 𝑘 ∈ (𝐿...𝑀))
78		nfv 1909	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖 𝑘 ∈ (𝐿...𝑀)
79	35, 78	nfan 1894	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖(𝜑 ∧ 𝑘 ∈ (𝐿...𝑀))
80		nfcv 2975	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑖𝑘
81	40, 80	nffv 6673	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖(𝐵‘𝑘)
82	81	nfel1 2992	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖(𝐵‘𝑘) ∈ ℝ
83	79, 82	nfim 1891	. . . . . . . . . . 11 ⊢ Ⅎ𝑖((𝜑 ∧ 𝑘 ∈ (𝐿...𝑀)) → (𝐵‘𝑘) ∈ ℝ)
84		eleq1 2898	. . . . . . . . . . . . 13 ⊢ (𝑖 = 𝑘 → (𝑖 ∈ (𝐿...𝑀) ↔ 𝑘 ∈ (𝐿...𝑀)))
85	84	anbi2d 630	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝑘 → ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) ↔ (𝜑 ∧ 𝑘 ∈ (𝐿...𝑀))))
86		fveq2 6663	. . . . . . . . . . . . 13 ⊢ (𝑖 = 𝑘 → (𝐵‘𝑖) = (𝐵‘𝑘))
87	86	eleq1d 2895	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝑘 → ((𝐵‘𝑖) ∈ ℝ ↔ (𝐵‘𝑘) ∈ ℝ))
88	85, 87	imbi12d 347	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑘 → (((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ∈ ℝ) ↔ ((𝜑 ∧ 𝑘 ∈ (𝐿...𝑀)) → (𝐵‘𝑘) ∈ ℝ)))
89		fmul01.7	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ∈ ℝ)
90	83, 88, 89	chvarfv 2235	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐿...𝑀)) → (𝐵‘𝑘) ∈ ℝ)
91	72, 77, 90	syl2anc 586	. . . . . . . . 9 ⊢ (((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) ∧ 𝑘 ∈ (𝐿...𝑗)) → (𝐵‘𝑘) ∈ ℝ)
92		remulcl 10614	. . . . . . . . . 10 ⊢ ((𝑘 ∈ ℝ ∧ 𝑙 ∈ ℝ) → (𝑘 · 𝑙) ∈ ℝ)
93	92	adantl 484	. . . . . . . . 9 ⊢ (((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) ∧ (𝑘 ∈ ℝ ∧ 𝑙 ∈ ℝ)) → (𝑘 · 𝑙) ∈ ℝ)
94	71, 91, 93	seqcl 13382	. . . . . . . 8 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (seq𝐿( · , 𝐵)‘𝑗) ∈ ℝ)
95		simp3 1133	. . . . . . . . 9 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 𝜑)
96		fzofzp1 13126	. . . . . . . . . 10 ⊢ (𝑗 ∈ (𝐿..^𝑀) → (𝑗 + 1) ∈ (𝐿...𝑀))
97	96	3ad2ant1 1128	. . . . . . . . 9 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (𝑗 + 1) ∈ (𝐿...𝑀))
98		nfv 1909	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖(𝑗 + 1) ∈ (𝐿...𝑀)
99	35, 98	nfan 1894	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖(𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀))
100		nfcv 2975	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑖(𝑗 + 1)
101	40, 100	nffv 6673	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖(𝐵‘(𝑗 + 1))
102	101	nfel1 2992	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖(𝐵‘(𝑗 + 1)) ∈ ℝ
103	99, 102	nfim 1891	. . . . . . . . . . 11 ⊢ Ⅎ𝑖((𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)) → (𝐵‘(𝑗 + 1)) ∈ ℝ)
104		eleq1 2898	. . . . . . . . . . . . 13 ⊢ (𝑖 = (𝑗 + 1) → (𝑖 ∈ (𝐿...𝑀) ↔ (𝑗 + 1) ∈ (𝐿...𝑀)))
105	104	anbi2d 630	. . . . . . . . . . . 12 ⊢ (𝑖 = (𝑗 + 1) → ((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) ↔ (𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀))))
106		fveq2 6663	. . . . . . . . . . . . 13 ⊢ (𝑖 = (𝑗 + 1) → (𝐵‘𝑖) = (𝐵‘(𝑗 + 1)))
107	106	eleq1d 2895	. . . . . . . . . . . 12 ⊢ (𝑖 = (𝑗 + 1) → ((𝐵‘𝑖) ∈ ℝ ↔ (𝐵‘(𝑗 + 1)) ∈ ℝ))
108	105, 107	imbi12d 347	. . . . . . . . . . 11 ⊢ (𝑖 = (𝑗 + 1) → (((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ∈ ℝ) ↔ ((𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)) → (𝐵‘(𝑗 + 1)) ∈ ℝ)))
109	103, 108, 89	vtoclg1f 3565	. . . . . . . . . 10 ⊢ ((𝑗 + 1) ∈ (𝐿...𝑀) → ((𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)) → (𝐵‘(𝑗 + 1)) ∈ ℝ))
110	109	anabsi7 669	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)) → (𝐵‘(𝑗 + 1)) ∈ ℝ)
111	95, 97, 110	syl2anc 586	. . . . . . . 8 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (𝐵‘(𝑗 + 1)) ∈ ℝ)
112		pm3.35 801	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1))) → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1))
113	112	ancoms 461	. . . . . . . . . . 11 ⊢ (((𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1))
114		simpl 485	. . . . . . . . . . 11 ⊢ ((0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1) → 0 ≤ (𝐴‘𝑗))
115	113, 114	syl 17	. . . . . . . . . 10 ⊢ (((𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 0 ≤ (𝐴‘𝑗))
116	115	3adant1 1125	. . . . . . . . 9 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 0 ≤ (𝐴‘𝑗))
117	53	fveq1i 6664	. . . . . . . . 9 ⊢ (𝐴‘𝑗) = (seq𝐿( · , 𝐵)‘𝑗)
118	116, 117	breqtrdi 5098	. . . . . . . 8 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 0 ≤ (seq𝐿( · , 𝐵)‘𝑗))
119		simp1 1131	. . . . . . . . 9 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 𝑗 ∈ (𝐿..^𝑀))
120	96	adantl 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝐿..^𝑀)) → (𝑗 + 1) ∈ (𝐿...𝑀))
121		simpl 485	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝐿..^𝑀)) → 𝜑)
122	121, 120	jca 514	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝐿..^𝑀)) → (𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)))
123	38, 39, 101	nfbr 5104	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖0 ≤ (𝐵‘(𝑗 + 1))
124	99, 123	nfim 1891	. . . . . . . . . . 11 ⊢ Ⅎ𝑖((𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘(𝑗 + 1)))
125	106	breq2d 5069	. . . . . . . . . . . 12 ⊢ (𝑖 = (𝑗 + 1) → (0 ≤ (𝐵‘𝑖) ↔ 0 ≤ (𝐵‘(𝑗 + 1))))
126	105, 125	imbi12d 347	. . . . . . . . . . 11 ⊢ (𝑖 = (𝑗 + 1) → (((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘𝑖)) ↔ ((𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘(𝑗 + 1)))))
127	124, 126, 50	vtoclg1f 3565	. . . . . . . . . 10 ⊢ ((𝑗 + 1) ∈ (𝐿...𝑀) → ((𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)) → 0 ≤ (𝐵‘(𝑗 + 1))))
128	120, 122, 127	sylc 65	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝐿..^𝑀)) → 0 ≤ (𝐵‘(𝑗 + 1)))
129	95, 119, 128	syl2anc 586	. . . . . . . 8 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 0 ≤ (𝐵‘(𝑗 + 1)))
130	94, 111, 118, 129	mulge0d 11209	. . . . . . 7 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 0 ≤ ((seq𝐿( · , 𝐵)‘𝑗) · (𝐵‘(𝑗 + 1))))
131		seqp1 13376	. . . . . . . 8 ⊢ (𝑗 ∈ (ℤ_≥‘𝐿) → (seq𝐿( · , 𝐵)‘(𝑗 + 1)) = ((seq𝐿( · , 𝐵)‘𝑗) · (𝐵‘(𝑗 + 1))))
132	71, 131	syl 17	. . . . . . 7 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (seq𝐿( · , 𝐵)‘(𝑗 + 1)) = ((seq𝐿( · , 𝐵)‘𝑗) · (𝐵‘(𝑗 + 1))))
133	130, 132	breqtrrd 5085	. . . . . 6 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 0 ≤ (seq𝐿( · , 𝐵)‘(𝑗 + 1)))
134	53	fveq1i 6664	. . . . . 6 ⊢ (𝐴‘(𝑗 + 1)) = (seq𝐿( · , 𝐵)‘(𝑗 + 1))
135	133, 134	breqtrrdi 5099	. . . . 5 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 0 ≤ (𝐴‘(𝑗 + 1)))
136	94, 111	remulcld 10663	. . . . . . . 8 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → ((seq𝐿( · , 𝐵)‘𝑗) · (𝐵‘(𝑗 + 1))) ∈ ℝ)
137		1red 10634	. . . . . . . 8 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → 1 ∈ ℝ)
138	95, 97	jca 514	. . . . . . . . . . 11 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)))
139	101, 39, 59	nfbr 5104	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖(𝐵‘(𝑗 + 1)) ≤ 1
140	99, 139	nfim 1891	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖((𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)) → (𝐵‘(𝑗 + 1)) ≤ 1)
141	106	breq1d 5067	. . . . . . . . . . . . 13 ⊢ (𝑖 = (𝑗 + 1) → ((𝐵‘𝑖) ≤ 1 ↔ (𝐵‘(𝑗 + 1)) ≤ 1))
142	105, 141	imbi12d 347	. . . . . . . . . . . 12 ⊢ (𝑖 = (𝑗 + 1) → (((𝜑 ∧ 𝑖 ∈ (𝐿...𝑀)) → (𝐵‘𝑖) ≤ 1) ↔ ((𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)) → (𝐵‘(𝑗 + 1)) ≤ 1)))
143	140, 142, 64	vtoclg1f 3565	. . . . . . . . . . 11 ⊢ ((𝑗 + 1) ∈ (𝐿...𝑀) → ((𝜑 ∧ (𝑗 + 1) ∈ (𝐿...𝑀)) → (𝐵‘(𝑗 + 1)) ≤ 1))
144	97, 138, 143	sylc 65	. . . . . . . . . 10 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (𝐵‘(𝑗 + 1)) ≤ 1)
145	111, 137, 94, 118, 144	lemul2ad 11572	. . . . . . . . 9 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → ((seq𝐿( · , 𝐵)‘𝑗) · (𝐵‘(𝑗 + 1))) ≤ ((seq𝐿( · , 𝐵)‘𝑗) · 1))
146	94	recnd 10661	. . . . . . . . . 10 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (seq𝐿( · , 𝐵)‘𝑗) ∈ ℂ)
147	146	mulid1d 10650	. . . . . . . . 9 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → ((seq𝐿( · , 𝐵)‘𝑗) · 1) = (seq𝐿( · , 𝐵)‘𝑗))
148	145, 147	breqtrd 5083	. . . . . . . 8 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → ((seq𝐿( · , 𝐵)‘𝑗) · (𝐵‘(𝑗 + 1))) ≤ (seq𝐿( · , 𝐵)‘𝑗))
149		simp2 1132	. . . . . . . . . 10 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)))
150	112	simprd 498	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1))) → (𝐴‘𝑗) ≤ 1)
151	95, 149, 150	syl2anc 586	. . . . . . . . 9 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (𝐴‘𝑗) ≤ 1)
152	117, 151	eqbrtrrid 5093	. . . . . . . 8 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (seq𝐿( · , 𝐵)‘𝑗) ≤ 1)
153	136, 94, 137, 148, 152	letrd 10789	. . . . . . 7 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → ((seq𝐿( · , 𝐵)‘𝑗) · (𝐵‘(𝑗 + 1))) ≤ 1)
154	132, 153	eqbrtrd 5079	. . . . . 6 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (seq𝐿( · , 𝐵)‘(𝑗 + 1)) ≤ 1)
155	134, 154	eqbrtrid 5092	. . . . 5 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (𝐴‘(𝑗 + 1)) ≤ 1)
156	135, 155	jca 514	. . . 4 ⊢ ((𝑗 ∈ (𝐿..^𝑀) ∧ (𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) ∧ 𝜑) → (0 ≤ (𝐴‘(𝑗 + 1)) ∧ (𝐴‘(𝑗 + 1)) ≤ 1))
157	156	3exp 1114	. . 3 ⊢ (𝑗 ∈ (𝐿..^𝑀) → ((𝜑 → (0 ≤ (𝐴‘𝑗) ∧ (𝐴‘𝑗) ≤ 1)) → (𝜑 → (0 ≤ (𝐴‘(𝑗 + 1)) ∧ (𝐴‘(𝑗 + 1)) ≤ 1))))
158	6, 11, 16, 21, 69, 157	fzind2 13147	. 2 ⊢ (𝐾 ∈ (𝐿...𝑀) → (𝜑 → (0 ≤ (𝐴‘𝐾) ∧ (𝐴‘𝐾) ≤ 1)))
159	1, 158	mpcom 38	1 ⊢ (𝜑 → (0 ≤ (𝐴‘𝐾) ∧ (𝐴‘𝐾) ≤ 1))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1082 = wceq 1531 Ⅎwnf 1778 ∈ wcel 2108 Ⅎwnfc 2959 ⊆ wss 3934 class class class wbr 5057 ‘cfv 6348 (class class class)co 7148 ℝcr 10528 0cc0 10529 1c1 10530 + caddc 10532 · cmul 10534 ≤ cle 10668 ℤcz 11973 ℤ_≥cuz 12235 ...cfz 12884 ..^cfzo 13025 seqcseq 13361

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1905 ax-6 1964 ax-7 2009 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2154 ax-12 2170 ax-ext 2791 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7453 ax-cnex 10585 ax-resscn 10586 ax-1cn 10587 ax-icn 10588 ax-addcl 10589 ax-addrcl 10590 ax-mulcl 10591 ax-mulrcl 10592 ax-mulcom 10593 ax-addass 10594 ax-mulass 10595 ax-distr 10596 ax-i2m1 10597 ax-1ne0 10598 ax-1rid 10599 ax-rnegex 10600 ax-rrecex 10601 ax-cnre 10602 ax-pre-lttri 10603 ax-pre-lttrn 10604 ax-pre-ltadd 10605 ax-pre-mulgt0 10606

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1083 df-3an 1084 df-tru 1534 df-ex 1775 df-nf 1779 df-sb 2064 df-mo 2616 df-eu 2648 df-clab 2798 df-cleq 2812 df-clel 2891 df-nfc 2961 df-ne 3015 df-nel 3122 df-ral 3141 df-rex 3142 df-reu 3143 df-rab 3145 df-v 3495 df-sbc 3771 df-csb 3882 df-dif 3937 df-un 3939 df-in 3941 df-ss 3950 df-pss 3952 df-nul 4290 df-if 4466 df-pw 4539 df-sn 4560 df-pr 4562 df-tp 4564 df-op 4566 df-uni 4831 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7106 df-ov 7151 df-oprab 7152 df-mpo 7153 df-om 7573 df-1st 7681 df-2nd 7682 df-wrecs 7939 df-recs 8000 df-rdg 8038 df-er 8281 df-en 8502 df-dom 8503 df-sdom 8504 df-pnf 10669 df-mnf 10670 df-xr 10671 df-ltxr 10672 df-le 10673 df-sub 10864 df-neg 10865 df-nn 11631 df-n0 11890 df-z 11974 df-uz 12236 df-fz 12885 df-fzo 13026 df-seq 13362

This theorem is referenced by: fmul01lt1lem1 41854 fmul01lt1lem2 41855

W3C validator