stoweidlem3 - Mathbox for Glauco Siliprandi

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

Theorem stoweidlem3 46189

Description: Lemma for stoweid 46249: if 𝐴 is positive and all 𝑀 terms of a finite product are larger than 𝐴, then the finite product is larger than 𝐴↑𝑀. (Contributed by Glauco Siliprandi, 20-Apr-2017.)

**Hypotheses**
Ref	Expression
stoweidlem3.1	⊢ Ⅎ𝑖𝐹
stoweidlem3.2	⊢ Ⅎ𝑖𝜑
stoweidlem3.3	⊢ 𝑋 = seq1( · , 𝐹)
stoweidlem3.4	⊢ (𝜑 → 𝑀 ∈ ℕ)
stoweidlem3.5	⊢ (𝜑 → 𝐹:(1...𝑀)⟶ℝ)
stoweidlem3.6	⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝐴 < (𝐹‘𝑖))
stoweidlem3.7	⊢ (𝜑 → 𝐴 ∈ ℝ⁺)

**Assertion**
Ref	Expression
stoweidlem3	⊢ (𝜑 → (𝐴↑𝑀) < (𝑋‘𝑀))

Distinct variable groups: 𝐴,𝑖 𝑖,𝑀 Allowed substitution hints: 𝜑(𝑖) 𝐹(𝑖) 𝑋(𝑖)

Proof of Theorem stoweidlem3 Dummy variables 𝑎 𝑚 𝑗 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		stoweidlem3.4	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℕ)
2		elnnuz 12789	. . . 4 ⊢ (𝑀 ∈ ℕ ↔ 𝑀 ∈ (ℤ_≥‘1))
3	1, 2	sylib 218	. . 3 ⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘1))
4		eluzfz2 13446	. . 3 ⊢ (𝑀 ∈ (ℤ_≥‘1) → 𝑀 ∈ (1...𝑀))
5	3, 4	syl 17	. 2 ⊢ (𝜑 → 𝑀 ∈ (1...𝑀))
6		oveq2 7364	. . . . 5 ⊢ (𝑛 = 1 → (𝐴↑𝑛) = (𝐴↑1))
7		fveq2 6832	. . . . 5 ⊢ (𝑛 = 1 → (𝑋‘𝑛) = (𝑋‘1))
8	6, 7	breq12d 5109	. . . 4 ⊢ (𝑛 = 1 → ((𝐴↑𝑛) < (𝑋‘𝑛) ↔ (𝐴↑1) < (𝑋‘1)))
9	8	imbi2d 340	. . 3 ⊢ (𝑛 = 1 → ((𝜑 → (𝐴↑𝑛) < (𝑋‘𝑛)) ↔ (𝜑 → (𝐴↑1) < (𝑋‘1))))
10		oveq2 7364	. . . . 5 ⊢ (𝑛 = 𝑚 → (𝐴↑𝑛) = (𝐴↑𝑚))
11		fveq2 6832	. . . . 5 ⊢ (𝑛 = 𝑚 → (𝑋‘𝑛) = (𝑋‘𝑚))
12	10, 11	breq12d 5109	. . . 4 ⊢ (𝑛 = 𝑚 → ((𝐴↑𝑛) < (𝑋‘𝑛) ↔ (𝐴↑𝑚) < (𝑋‘𝑚)))
13	12	imbi2d 340	. . 3 ⊢ (𝑛 = 𝑚 → ((𝜑 → (𝐴↑𝑛) < (𝑋‘𝑛)) ↔ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚))))
14		oveq2 7364	. . . . 5 ⊢ (𝑛 = (𝑚 + 1) → (𝐴↑𝑛) = (𝐴↑(𝑚 + 1)))
15		fveq2 6832	. . . . 5 ⊢ (𝑛 = (𝑚 + 1) → (𝑋‘𝑛) = (𝑋‘(𝑚 + 1)))
16	14, 15	breq12d 5109	. . . 4 ⊢ (𝑛 = (𝑚 + 1) → ((𝐴↑𝑛) < (𝑋‘𝑛) ↔ (𝐴↑(𝑚 + 1)) < (𝑋‘(𝑚 + 1))))
17	16	imbi2d 340	. . 3 ⊢ (𝑛 = (𝑚 + 1) → ((𝜑 → (𝐴↑𝑛) < (𝑋‘𝑛)) ↔ (𝜑 → (𝐴↑(𝑚 + 1)) < (𝑋‘(𝑚 + 1)))))
18		oveq2 7364	. . . . 5 ⊢ (𝑛 = 𝑀 → (𝐴↑𝑛) = (𝐴↑𝑀))
19		fveq2 6832	. . . . 5 ⊢ (𝑛 = 𝑀 → (𝑋‘𝑛) = (𝑋‘𝑀))
20	18, 19	breq12d 5109	. . . 4 ⊢ (𝑛 = 𝑀 → ((𝐴↑𝑛) < (𝑋‘𝑛) ↔ (𝐴↑𝑀) < (𝑋‘𝑀)))
21	20	imbi2d 340	. . 3 ⊢ (𝑛 = 𝑀 → ((𝜑 → (𝐴↑𝑛) < (𝑋‘𝑛)) ↔ (𝜑 → (𝐴↑𝑀) < (𝑋‘𝑀))))
22		1zzd 12520	. . . . . . 7 ⊢ (𝜑 → 1 ∈ ℤ)
23	1	nnzd 12512	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℤ)
24		1le1 11763	. . . . . . . 8 ⊢ 1 ≤ 1
25	24	a1i 11	. . . . . . 7 ⊢ (𝜑 → 1 ≤ 1)
26	1	nnge1d 12191	. . . . . . 7 ⊢ (𝜑 → 1 ≤ 𝑀)
27	22, 23, 22, 25, 26	elfzd 13429	. . . . . 6 ⊢ (𝜑 → 1 ∈ (1...𝑀))
28	27	ancli 548	. . . . . 6 ⊢ (𝜑 → (𝜑 ∧ 1 ∈ (1...𝑀)))
29		stoweidlem3.2	. . . . . . . . 9 ⊢ Ⅎ𝑖𝜑
30		nfv 1915	. . . . . . . . 9 ⊢ Ⅎ𝑖1 ∈ (1...𝑀)
31	29, 30	nfan 1900	. . . . . . . 8 ⊢ Ⅎ𝑖(𝜑 ∧ 1 ∈ (1...𝑀))
32		nfcv 2896	. . . . . . . . 9 ⊢ Ⅎ𝑖𝐴
33		nfcv 2896	. . . . . . . . 9 ⊢ Ⅎ𝑖 <
34		stoweidlem3.1	. . . . . . . . . 10 ⊢ Ⅎ𝑖𝐹
35		nfcv 2896	. . . . . . . . . 10 ⊢ Ⅎ𝑖1
36	34, 35	nffv 6842	. . . . . . . . 9 ⊢ Ⅎ𝑖(𝐹‘1)
37	32, 33, 36	nfbr 5143	. . . . . . . 8 ⊢ Ⅎ𝑖 𝐴 < (𝐹‘1)
38	31, 37	nfim 1897	. . . . . . 7 ⊢ Ⅎ𝑖((𝜑 ∧ 1 ∈ (1...𝑀)) → 𝐴 < (𝐹‘1))
39		eleq1 2822	. . . . . . . . 9 ⊢ (𝑖 = 1 → (𝑖 ∈ (1...𝑀) ↔ 1 ∈ (1...𝑀)))
40	39	anbi2d 630	. . . . . . . 8 ⊢ (𝑖 = 1 → ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) ↔ (𝜑 ∧ 1 ∈ (1...𝑀))))
41		fveq2 6832	. . . . . . . . 9 ⊢ (𝑖 = 1 → (𝐹‘𝑖) = (𝐹‘1))
42	41	breq2d 5108	. . . . . . . 8 ⊢ (𝑖 = 1 → (𝐴 < (𝐹‘𝑖) ↔ 𝐴 < (𝐹‘1)))
43	40, 42	imbi12d 344	. . . . . . 7 ⊢ (𝑖 = 1 → (((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝐴 < (𝐹‘𝑖)) ↔ ((𝜑 ∧ 1 ∈ (1...𝑀)) → 𝐴 < (𝐹‘1))))
44		stoweidlem3.6	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝐴 < (𝐹‘𝑖))
45	38, 43, 44	vtoclg1f 3524	. . . . . 6 ⊢ (1 ∈ (1...𝑀) → ((𝜑 ∧ 1 ∈ (1...𝑀)) → 𝐴 < (𝐹‘1)))
46	27, 28, 45	sylc 65	. . . . 5 ⊢ (𝜑 → 𝐴 < (𝐹‘1))
47		stoweidlem3.7	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ⁺)
48	47	rpcnd 12949	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℂ)
49	48	exp1d 14062	. . . . 5 ⊢ (𝜑 → (𝐴↑1) = 𝐴)
50		stoweidlem3.3	. . . . . . . 8 ⊢ 𝑋 = seq1( · , 𝐹)
51	50	fveq1i 6833	. . . . . . 7 ⊢ (𝑋‘1) = (seq1( · , 𝐹)‘1)
52		1z 12519	. . . . . . . 8 ⊢ 1 ∈ ℤ
53		seq1 13935	. . . . . . . 8 ⊢ (1 ∈ ℤ → (seq1( · , 𝐹)‘1) = (𝐹‘1))
54	52, 53	ax-mp 5	. . . . . . 7 ⊢ (seq1( · , 𝐹)‘1) = (𝐹‘1)
55	51, 54	eqtri 2757	. . . . . 6 ⊢ (𝑋‘1) = (𝐹‘1)
56	55	a1i 11	. . . . 5 ⊢ (𝜑 → (𝑋‘1) = (𝐹‘1))
57	46, 49, 56	3brtr4d 5128	. . . 4 ⊢ (𝜑 → (𝐴↑1) < (𝑋‘1))
58	57	a1i 11	. . 3 ⊢ (𝑀 ∈ (ℤ_≥‘1) → (𝜑 → (𝐴↑1) < (𝑋‘1)))
59	47	3ad2ant3 1135	. . . . . . . 8 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → 𝐴 ∈ ℝ⁺)
60	59	rpred 12947	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → 𝐴 ∈ ℝ)
61		elfzouz 13577	. . . . . . . . 9 ⊢ (𝑚 ∈ (1..^𝑀) → 𝑚 ∈ (ℤ_≥‘1))
62		elnnuz 12789	. . . . . . . . . 10 ⊢ (𝑚 ∈ ℕ ↔ 𝑚 ∈ (ℤ_≥‘1))
63		nnnn0 12406	. . . . . . . . . 10 ⊢ (𝑚 ∈ ℕ → 𝑚 ∈ ℕ₀)
64	62, 63	sylbir 235	. . . . . . . . 9 ⊢ (𝑚 ∈ (ℤ_≥‘1) → 𝑚 ∈ ℕ₀)
65	61, 64	syl 17	. . . . . . . 8 ⊢ (𝑚 ∈ (1..^𝑀) → 𝑚 ∈ ℕ₀)
66	65	3ad2ant1 1133	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → 𝑚 ∈ ℕ₀)
67	60, 66	reexpcld 14084	. . . . . 6 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝐴↑𝑚) ∈ ℝ)
68	50	fveq1i 6833	. . . . . . . 8 ⊢ (𝑋‘𝑚) = (seq1( · , 𝐹)‘𝑚)
69	61	adantr 480	. . . . . . . . 9 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ 𝜑) → 𝑚 ∈ (ℤ_≥‘1))
70		nfv 1915	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖 𝑚 ∈ (1..^𝑀)
71	70, 29	nfan 1900	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖(𝑚 ∈ (1..^𝑀) ∧ 𝜑)
72		nfv 1915	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖 𝑎 ∈ (1...𝑚)
73	71, 72	nfan 1900	. . . . . . . . . . 11 ⊢ Ⅎ𝑖((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑎 ∈ (1...𝑚))
74		nfcv 2896	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖𝑎
75	34, 74	nffv 6842	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖(𝐹‘𝑎)
76	75	nfel1 2913	. . . . . . . . . . 11 ⊢ Ⅎ𝑖(𝐹‘𝑎) ∈ ℝ
77	73, 76	nfim 1897	. . . . . . . . . 10 ⊢ Ⅎ𝑖(((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑎 ∈ (1...𝑚)) → (𝐹‘𝑎) ∈ ℝ)
78		eleq1 2822	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝑎 → (𝑖 ∈ (1...𝑚) ↔ 𝑎 ∈ (1...𝑚)))
79	78	anbi2d 630	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑎 → (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) ↔ ((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑎 ∈ (1...𝑚))))
80		fveq2 6832	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝑎 → (𝐹‘𝑖) = (𝐹‘𝑎))
81	80	eleq1d 2819	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑎 → ((𝐹‘𝑖) ∈ ℝ ↔ (𝐹‘𝑎) ∈ ℝ))
82	79, 81	imbi12d 344	. . . . . . . . . 10 ⊢ (𝑖 = 𝑎 → ((((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → (𝐹‘𝑖) ∈ ℝ) ↔ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑎 ∈ (1...𝑚)) → (𝐹‘𝑎) ∈ ℝ)))
83		stoweidlem3.5	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹:(1...𝑀)⟶ℝ)
84	83	ad2antlr 727	. . . . . . . . . . 11 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 𝐹:(1...𝑀)⟶ℝ)
85		1zzd 12520	. . . . . . . . . . . 12 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 1 ∈ ℤ)
86	23	ad2antlr 727	. . . . . . . . . . . 12 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 𝑀 ∈ ℤ)
87		elfzelz 13438	. . . . . . . . . . . . 13 ⊢ (𝑖 ∈ (1...𝑚) → 𝑖 ∈ ℤ)
88	87	adantl 481	. . . . . . . . . . . 12 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 𝑖 ∈ ℤ)
89		elfzle1 13441	. . . . . . . . . . . . 13 ⊢ (𝑖 ∈ (1...𝑚) → 1 ≤ 𝑖)
90	89	adantl 481	. . . . . . . . . . . 12 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 1 ≤ 𝑖)
91	87	zred 12594	. . . . . . . . . . . . . 14 ⊢ (𝑖 ∈ (1...𝑚) → 𝑖 ∈ ℝ)
92	91	adantl 481	. . . . . . . . . . . . 13 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 𝑖 ∈ ℝ)
93		elfzoelz 13573	. . . . . . . . . . . . . . 15 ⊢ (𝑚 ∈ (1..^𝑀) → 𝑚 ∈ ℤ)
94	93	zred 12594	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ (1..^𝑀) → 𝑚 ∈ ℝ)
95	94	ad2antrr 726	. . . . . . . . . . . . 13 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 𝑚 ∈ ℝ)
96	1	nnred 12158	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑀 ∈ ℝ)
97	96	ad2antlr 727	. . . . . . . . . . . . 13 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 𝑀 ∈ ℝ)
98		elfzle2 13442	. . . . . . . . . . . . . 14 ⊢ (𝑖 ∈ (1...𝑚) → 𝑖 ≤ 𝑚)
99	98	adantl 481	. . . . . . . . . . . . 13 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 𝑖 ≤ 𝑚)
100		elfzoel2 13572	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 ∈ (1..^𝑀) → 𝑀 ∈ ℤ)
101	100	zred 12594	. . . . . . . . . . . . . . 15 ⊢ (𝑚 ∈ (1..^𝑀) → 𝑀 ∈ ℝ)
102		elfzolt2 13582	. . . . . . . . . . . . . . 15 ⊢ (𝑚 ∈ (1..^𝑀) → 𝑚 < 𝑀)
103	94, 101, 102	ltled 11279	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ (1..^𝑀) → 𝑚 ≤ 𝑀)
104	103	ad2antrr 726	. . . . . . . . . . . . 13 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 𝑚 ≤ 𝑀)
105	92, 95, 97, 99, 104	letrd 11288	. . . . . . . . . . . 12 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 𝑖 ≤ 𝑀)
106	85, 86, 88, 90, 105	elfzd 13429	. . . . . . . . . . 11 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 𝑖 ∈ (1...𝑀))
107	84, 106	ffvelcdmd 7028	. . . . . . . . . 10 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → (𝐹‘𝑖) ∈ ℝ)
108	77, 82, 107	chvarfv 2245	. . . . . . . . 9 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑎 ∈ (1...𝑚)) → (𝐹‘𝑎) ∈ ℝ)
109		remulcl 11109	. . . . . . . . . 10 ⊢ ((𝑎 ∈ ℝ ∧ 𝑗 ∈ ℝ) → (𝑎 · 𝑗) ∈ ℝ)
110	109	adantl 481	. . . . . . . . 9 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ (𝑎 ∈ ℝ ∧ 𝑗 ∈ ℝ)) → (𝑎 · 𝑗) ∈ ℝ)
111	69, 108, 110	seqcl 13943	. . . . . . . 8 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ 𝜑) → (seq1( · , 𝐹)‘𝑚) ∈ ℝ)
112	68, 111	eqeltrid 2838	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ 𝜑) → (𝑋‘𝑚) ∈ ℝ)
113	112	3adant2 1131	. . . . . 6 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝑋‘𝑚) ∈ ℝ)
114	83	3ad2ant3 1135	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → 𝐹:(1...𝑀)⟶ℝ)
115		fzofzp1 13678	. . . . . . . 8 ⊢ (𝑚 ∈ (1..^𝑀) → (𝑚 + 1) ∈ (1...𝑀))
116	115	3ad2ant1 1133	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝑚 + 1) ∈ (1...𝑀))
117	114, 116	ffvelcdmd 7028	. . . . . 6 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝐹‘(𝑚 + 1)) ∈ ℝ)
118	47	rpge0d 12951	. . . . . . . 8 ⊢ (𝜑 → 0 ≤ 𝐴)
119	118	3ad2ant3 1135	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → 0 ≤ 𝐴)
120	60, 66, 119	expge0d 14085	. . . . . 6 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → 0 ≤ (𝐴↑𝑚))
121		simp3 1138	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → 𝜑)
122		simp2 1137	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)))
123	121, 122	mpd 15	. . . . . 6 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝐴↑𝑚) < (𝑋‘𝑚))
124	115	adantr 480	. . . . . . . 8 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ 𝜑) → (𝑚 + 1) ∈ (1...𝑀))
125		simpr 484	. . . . . . . . 9 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ 𝜑) → 𝜑)
126	125, 124	jca 511	. . . . . . . 8 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ 𝜑) → (𝜑 ∧ (𝑚 + 1) ∈ (1...𝑀)))
127		nfv 1915	. . . . . . . . . . 11 ⊢ Ⅎ𝑖(𝑚 + 1) ∈ (1...𝑀)
128	29, 127	nfan 1900	. . . . . . . . . 10 ⊢ Ⅎ𝑖(𝜑 ∧ (𝑚 + 1) ∈ (1...𝑀))
129		nfcv 2896	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖(𝑚 + 1)
130	34, 129	nffv 6842	. . . . . . . . . . 11 ⊢ Ⅎ𝑖(𝐹‘(𝑚 + 1))
131	32, 33, 130	nfbr 5143	. . . . . . . . . 10 ⊢ Ⅎ𝑖 𝐴 < (𝐹‘(𝑚 + 1))
132	128, 131	nfim 1897	. . . . . . . . 9 ⊢ Ⅎ𝑖((𝜑 ∧ (𝑚 + 1) ∈ (1...𝑀)) → 𝐴 < (𝐹‘(𝑚 + 1)))
133		eleq1 2822	. . . . . . . . . . 11 ⊢ (𝑖 = (𝑚 + 1) → (𝑖 ∈ (1...𝑀) ↔ (𝑚 + 1) ∈ (1...𝑀)))
134	133	anbi2d 630	. . . . . . . . . 10 ⊢ (𝑖 = (𝑚 + 1) → ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) ↔ (𝜑 ∧ (𝑚 + 1) ∈ (1...𝑀))))
135		fveq2 6832	. . . . . . . . . . 11 ⊢ (𝑖 = (𝑚 + 1) → (𝐹‘𝑖) = (𝐹‘(𝑚 + 1)))
136	135	breq2d 5108	. . . . . . . . . 10 ⊢ (𝑖 = (𝑚 + 1) → (𝐴 < (𝐹‘𝑖) ↔ 𝐴 < (𝐹‘(𝑚 + 1))))
137	134, 136	imbi12d 344	. . . . . . . . 9 ⊢ (𝑖 = (𝑚 + 1) → (((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝐴 < (𝐹‘𝑖)) ↔ ((𝜑 ∧ (𝑚 + 1) ∈ (1...𝑀)) → 𝐴 < (𝐹‘(𝑚 + 1)))))
138	132, 137, 44	vtoclg1f 3524	. . . . . . . 8 ⊢ ((𝑚 + 1) ∈ (1...𝑀) → ((𝜑 ∧ (𝑚 + 1) ∈ (1...𝑀)) → 𝐴 < (𝐹‘(𝑚 + 1))))
139	124, 126, 138	sylc 65	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ 𝜑) → 𝐴 < (𝐹‘(𝑚 + 1)))
140	139	3adant2 1131	. . . . . 6 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → 𝐴 < (𝐹‘(𝑚 + 1)))
141	67, 113, 60, 117, 120, 123, 119, 140	ltmul12ad 12081	. . . . 5 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → ((𝐴↑𝑚) · 𝐴) < ((𝑋‘𝑚) · (𝐹‘(𝑚 + 1))))
142	48	3ad2ant3 1135	. . . . . 6 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → 𝐴 ∈ ℂ)
143	142, 66	expp1d 14068	. . . . 5 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝐴↑(𝑚 + 1)) = ((𝐴↑𝑚) · 𝐴))
144	50	fveq1i 6833	. . . . . . 7 ⊢ (𝑋‘(𝑚 + 1)) = (seq1( · , 𝐹)‘(𝑚 + 1))
145	144	a1i 11	. . . . . 6 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝑋‘(𝑚 + 1)) = (seq1( · , 𝐹)‘(𝑚 + 1)))
146	61	3ad2ant1 1133	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → 𝑚 ∈ (ℤ_≥‘1))
147		seqp1 13937	. . . . . . 7 ⊢ (𝑚 ∈ (ℤ_≥‘1) → (seq1( · , 𝐹)‘(𝑚 + 1)) = ((seq1( · , 𝐹)‘𝑚) · (𝐹‘(𝑚 + 1))))
148	146, 147	syl 17	. . . . . 6 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (seq1( · , 𝐹)‘(𝑚 + 1)) = ((seq1( · , 𝐹)‘𝑚) · (𝐹‘(𝑚 + 1))))
149	68	a1i 11	. . . . . . . 8 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝑋‘𝑚) = (seq1( · , 𝐹)‘𝑚))
150	149	eqcomd 2740	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (seq1( · , 𝐹)‘𝑚) = (𝑋‘𝑚))
151	150	oveq1d 7371	. . . . . 6 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → ((seq1( · , 𝐹)‘𝑚) · (𝐹‘(𝑚 + 1))) = ((𝑋‘𝑚) · (𝐹‘(𝑚 + 1))))
152	145, 148, 151	3eqtrd 2773	. . . . 5 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝑋‘(𝑚 + 1)) = ((𝑋‘𝑚) · (𝐹‘(𝑚 + 1))))
153	141, 143, 152	3brtr4d 5128	. . . 4 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝐴↑(𝑚 + 1)) < (𝑋‘(𝑚 + 1)))
154	153	3exp 1119	. . 3 ⊢ (𝑚 ∈ (1..^𝑀) → ((𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) → (𝜑 → (𝐴↑(𝑚 + 1)) < (𝑋‘(𝑚 + 1)))))
155	9, 13, 17, 21, 58, 154	fzind2 13702	. 2 ⊢ (𝑀 ∈ (1...𝑀) → (𝜑 → (𝐴↑𝑀) < (𝑋‘𝑀)))
156	5, 155	mpcom 38	1 ⊢ (𝜑 → (𝐴↑𝑀) < (𝑋‘𝑀))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 Ⅎwnf 1784 ∈ wcel 2113 Ⅎwnfc 2881 class class class wbr 5096 ⟶wf 6486 ‘cfv 6490 (class class class)co 7356 ℂcc 11022 ℝcr 11023 0cc0 11024 1c1 11025 + caddc 11027 · cmul 11029 < clt 11164 ≤ cle 11165 ℕcn 12143 ℕ₀cn0 12399 ℤcz 12486 ℤ_≥cuz 12749 ℝ⁺crp 12903 ...cfz 13421 ..^cfzo 13568 seqcseq 13922 ↑cexp 13982

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8633 df-en 8882 df-dom 8883 df-sdom 8884 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-nn 12144 df-n0 12400 df-z 12487 df-uz 12750 df-rp 12904 df-fz 13422 df-fzo 13569 df-seq 13923 df-exp 13983

This theorem is referenced by: stoweidlem42 46228

W3C validator