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 46737

Description: Lemma for stoweid 46797: 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 12897	. . . 4 ⊢ (𝑀 ∈ ℕ ↔ 𝑀 ∈ (ℤ_≥‘1))
3	1, 2	sylib 221	. . 3 ⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘1))
4		eluzfz2 13555	. . 3 ⊢ (𝑀 ∈ (ℤ_≥‘1) → 𝑀 ∈ (1...𝑀))
5	3, 4	syl 18	. 2 ⊢ (𝜑 → 𝑀 ∈ (1...𝑀))
6		oveq2 7418	. . . . 5 ⊢ (𝑛 = 1 → (𝐴↑𝑛) = (𝐴↑1))
7		fveq2 6881	. . . . 5 ⊢ (𝑛 = 1 → (𝑋‘𝑛) = (𝑋‘1))
8	6, 7	breq12d 5122	. . . 4 ⊢ (𝑛 = 1 → ((𝐴↑𝑛) < (𝑋‘𝑛) ↔ (𝐴↑1) < (𝑋‘1)))
9	8	imbi2d 343	. . 3 ⊢ (𝑛 = 1 → ((𝜑 → (𝐴↑𝑛) < (𝑋‘𝑛)) ↔ (𝜑 → (𝐴↑1) < (𝑋‘1))))
10		oveq2 7418	. . . . 5 ⊢ (𝑛 = 𝑚 → (𝐴↑𝑛) = (𝐴↑𝑚))
11		fveq2 6881	. . . . 5 ⊢ (𝑛 = 𝑚 → (𝑋‘𝑛) = (𝑋‘𝑚))
12	10, 11	breq12d 5122	. . . 4 ⊢ (𝑛 = 𝑚 → ((𝐴↑𝑛) < (𝑋‘𝑛) ↔ (𝐴↑𝑚) < (𝑋‘𝑚)))
13	12	imbi2d 343	. . 3 ⊢ (𝑛 = 𝑚 → ((𝜑 → (𝐴↑𝑛) < (𝑋‘𝑛)) ↔ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚))))
14		oveq2 7418	. . . . 5 ⊢ (𝑛 = (𝑚 + 1) → (𝐴↑𝑛) = (𝐴↑(𝑚 + 1)))
15		fveq2 6881	. . . . 5 ⊢ (𝑛 = (𝑚 + 1) → (𝑋‘𝑛) = (𝑋‘(𝑚 + 1)))
16	14, 15	breq12d 5122	. . . 4 ⊢ (𝑛 = (𝑚 + 1) → ((𝐴↑𝑛) < (𝑋‘𝑛) ↔ (𝐴↑(𝑚 + 1)) < (𝑋‘(𝑚 + 1))))
17	16	imbi2d 343	. . 3 ⊢ (𝑛 = (𝑚 + 1) → ((𝜑 → (𝐴↑𝑛) < (𝑋‘𝑛)) ↔ (𝜑 → (𝐴↑(𝑚 + 1)) < (𝑋‘(𝑚 + 1)))))
18		oveq2 7418	. . . . 5 ⊢ (𝑛 = 𝑀 → (𝐴↑𝑛) = (𝐴↑𝑀))
19		fveq2 6881	. . . . 5 ⊢ (𝑛 = 𝑀 → (𝑋‘𝑛) = (𝑋‘𝑀))
20	18, 19	breq12d 5122	. . . 4 ⊢ (𝑛 = 𝑀 → ((𝐴↑𝑛) < (𝑋‘𝑛) ↔ (𝐴↑𝑀) < (𝑋‘𝑀)))
21	20	imbi2d 343	. . 3 ⊢ (𝑛 = 𝑀 → ((𝜑 → (𝐴↑𝑛) < (𝑋‘𝑛)) ↔ (𝜑 → (𝐴↑𝑀) < (𝑋‘𝑀))))
22		1zzd 12620	. . . . . . 7 ⊢ (𝜑 → 1 ∈ ℤ)
23	1	nnzd 12612	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ ℤ)
24		1le1 11837	. . . . . . . 8 ⊢ 1 ≤ 1
25	24	a1i 11	. . . . . . 7 ⊢ (𝜑 → 1 ≤ 1)
26	1	nnge1d 12279	. . . . . . 7 ⊢ (𝜑 → 1 ≤ 𝑀)
27	22, 23, 22, 25, 26	elfzd 13538	. . . . . 6 ⊢ (𝜑 → 1 ∈ (1...𝑀))
28	27	ancli 557	. . . . . 6 ⊢ (𝜑 → (𝜑 ∧ 1 ∈ (1...𝑀)))
29		stoweidlem3.2	. . . . . . . . 9 ⊢ Ⅎ𝑖𝜑
30		nfv 1944	. . . . . . . . 9 ⊢ Ⅎ𝑖1 ∈ (1...𝑀)
31	29, 30	nfan 1929	. . . . . . . 8 ⊢ Ⅎ𝑖(𝜑 ∧ 1 ∈ (1...𝑀))
32		nfcv 2925	. . . . . . . . 9 ⊢ Ⅎ𝑖𝐴
33		nfcv 2925	. . . . . . . . 9 ⊢ Ⅎ𝑖 <
34		stoweidlem3.1	. . . . . . . . . 10 ⊢ Ⅎ𝑖𝐹
35		nfcv 2925	. . . . . . . . . 10 ⊢ Ⅎ𝑖1
36	34, 35	nffv 6891	. . . . . . . . 9 ⊢ Ⅎ𝑖(𝐹‘1)
37	32, 33, 36	nfbr 5158	. . . . . . . 8 ⊢ Ⅎ𝑖 𝐴 < (𝐹‘1)
38	31, 37	nfim 1926	. . . . . . 7 ⊢ Ⅎ𝑖((𝜑 ∧ 1 ∈ (1...𝑀)) → 𝐴 < (𝐹‘1))
39		eleq1 2851	. . . . . . . . 9 ⊢ (𝑖 = 1 → (𝑖 ∈ (1...𝑀) ↔ 1 ∈ (1...𝑀)))
40	39	anbi2d 641	. . . . . . . 8 ⊢ (𝑖 = 1 → ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) ↔ (𝜑 ∧ 1 ∈ (1...𝑀))))
41		fveq2 6881	. . . . . . . . 9 ⊢ (𝑖 = 1 → (𝐹‘𝑖) = (𝐹‘1))
42	41	breq2d 5121	. . . . . . . 8 ⊢ (𝑖 = 1 → (𝐴 < (𝐹‘𝑖) ↔ 𝐴 < (𝐹‘1)))
43	40, 42	imbi12d 347	. . . . . . 7 ⊢ (𝑖 = 1 → (((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝐴 < (𝐹‘𝑖)) ↔ ((𝜑 ∧ 1 ∈ (1...𝑀)) → 𝐴 < (𝐹‘1))))
44		stoweidlem3.6	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝐴 < (𝐹‘𝑖))
45	38, 43, 44	vtoclg1f 3535	. . . . . 6 ⊢ (1 ∈ (1...𝑀) → ((𝜑 ∧ 1 ∈ (1...𝑀)) → 𝐴 < (𝐹‘1)))
46	27, 28, 45	sylc 66	. . . . 5 ⊢ (𝜑 → 𝐴 < (𝐹‘1))
47		stoweidlem3.7	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ⁺)
48	47	rpcnd 13057	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℂ)
49	48	exp1d 14173	. . . . 5 ⊢ (𝜑 → (𝐴↑1) = 𝐴)
50		stoweidlem3.3	. . . . . . . 8 ⊢ 𝑋 = seq1( · , 𝐹)
51	50	fveq1i 6882	. . . . . . 7 ⊢ (𝑋‘1) = (seq1( · , 𝐹)‘1)
52		1z 12619	. . . . . . . 8 ⊢ 1 ∈ ℤ
53		seq1 14046	. . . . . . . 8 ⊢ (1 ∈ ℤ → (seq1( · , 𝐹)‘1) = (𝐹‘1))
54	52, 53	ax-mp 5	. . . . . . 7 ⊢ (seq1( · , 𝐹)‘1) = (𝐹‘1)
55	51, 54	eqtri 2786	. . . . . 6 ⊢ (𝑋‘1) = (𝐹‘1)
56	55	a1i 11	. . . . 5 ⊢ (𝜑 → (𝑋‘1) = (𝐹‘1))
57	46, 49, 56	3brtr4d 5143	. . . 4 ⊢ (𝜑 → (𝐴↑1) < (𝑋‘1))
58	57	a1i 11	. . 3 ⊢ (𝑀 ∈ (ℤ_≥‘1) → (𝜑 → (𝐴↑1) < (𝑋‘1)))
59	47	3ad2ant3 1153	. . . . . . . 8 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → 𝐴 ∈ ℝ⁺)
60	59	rpred 13055	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → 𝐴 ∈ ℝ)
61		elfzouz 13688	. . . . . . . . 9 ⊢ (𝑚 ∈ (1..^𝑀) → 𝑚 ∈ (ℤ_≥‘1))
62		elnnuz 12897	. . . . . . . . . 10 ⊢ (𝑚 ∈ ℕ ↔ 𝑚 ∈ (ℤ_≥‘1))
63		nnnn0 12506	. . . . . . . . . 10 ⊢ (𝑚 ∈ ℕ → 𝑚 ∈ ℕ₀)
64	62, 63	sylbir 238	. . . . . . . . 9 ⊢ (𝑚 ∈ (ℤ_≥‘1) → 𝑚 ∈ ℕ₀)
65	61, 64	syl 18	. . . . . . . 8 ⊢ (𝑚 ∈ (1..^𝑀) → 𝑚 ∈ ℕ₀)
66	65	3ad2ant1 1151	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → 𝑚 ∈ ℕ₀)
67	60, 66	reexpcld 14195	. . . . . 6 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝐴↑𝑚) ∈ ℝ)
68	50	fveq1i 6882	. . . . . . . 8 ⊢ (𝑋‘𝑚) = (seq1( · , 𝐹)‘𝑚)
69	61	adantr 485	. . . . . . . . 9 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ 𝜑) → 𝑚 ∈ (ℤ_≥‘1))
70		nfv 1944	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖 𝑚 ∈ (1..^𝑀)
71	70, 29	nfan 1929	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖(𝑚 ∈ (1..^𝑀) ∧ 𝜑)
72		nfv 1944	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖 𝑎 ∈ (1...𝑚)
73	71, 72	nfan 1929	. . . . . . . . . . 11 ⊢ Ⅎ𝑖((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑎 ∈ (1...𝑚))
74		nfcv 2925	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑖𝑎
75	34, 74	nffv 6891	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖(𝐹‘𝑎)
76	75	nfel1 2941	. . . . . . . . . . 11 ⊢ Ⅎ𝑖(𝐹‘𝑎) ∈ ℝ
77	73, 76	nfim 1926	. . . . . . . . . 10 ⊢ Ⅎ𝑖(((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑎 ∈ (1...𝑚)) → (𝐹‘𝑎) ∈ ℝ)
78		eleq1 2851	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝑎 → (𝑖 ∈ (1...𝑚) ↔ 𝑎 ∈ (1...𝑚)))
79	78	anbi2d 641	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑎 → (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) ↔ ((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑎 ∈ (1...𝑚))))
80		fveq2 6881	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝑎 → (𝐹‘𝑖) = (𝐹‘𝑎))
81	80	eleq1d 2848	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑎 → ((𝐹‘𝑖) ∈ ℝ ↔ (𝐹‘𝑎) ∈ ℝ))
82	79, 81	imbi12d 347	. . . . . . . . . 10 ⊢ (𝑖 = 𝑎 → ((((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → (𝐹‘𝑖) ∈ ℝ) ↔ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑎 ∈ (1...𝑚)) → (𝐹‘𝑎) ∈ ℝ)))
83		stoweidlem3.5	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐹:(1...𝑀)⟶ℝ)
84	83	ad2antlr 739	. . . . . . . . . . 11 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 𝐹:(1...𝑀)⟶ℝ)
85		1zzd 12620	. . . . . . . . . . . 12 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 1 ∈ ℤ)
86	23	ad2antlr 739	. . . . . . . . . . . 12 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 𝑀 ∈ ℤ)
87		elfzelz 13547	. . . . . . . . . . . . 13 ⊢ (𝑖 ∈ (1...𝑚) → 𝑖 ∈ ℤ)
88	87	adantl 486	. . . . . . . . . . . 12 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 𝑖 ∈ ℤ)
89		elfzle1 13550	. . . . . . . . . . . . 13 ⊢ (𝑖 ∈ (1...𝑚) → 1 ≤ 𝑖)
90	89	adantl 486	. . . . . . . . . . . 12 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 1 ≤ 𝑖)
91	87	zred 12695	. . . . . . . . . . . . . 14 ⊢ (𝑖 ∈ (1...𝑚) → 𝑖 ∈ ℝ)
92	91	adantl 486	. . . . . . . . . . . . 13 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 𝑖 ∈ ℝ)
93		elfzoelz 13683	. . . . . . . . . . . . . . 15 ⊢ (𝑚 ∈ (1..^𝑀) → 𝑚 ∈ ℤ)
94	93	zred 12695	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ (1..^𝑀) → 𝑚 ∈ ℝ)
95	94	ad2antrr 738	. . . . . . . . . . . . 13 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 𝑚 ∈ ℝ)
96	1	nnred 12243	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑀 ∈ ℝ)
97	96	ad2antlr 739	. . . . . . . . . . . . 13 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 𝑀 ∈ ℝ)
98		elfzle2 13551	. . . . . . . . . . . . . 14 ⊢ (𝑖 ∈ (1...𝑚) → 𝑖 ≤ 𝑚)
99	98	adantl 486	. . . . . . . . . . . . 13 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 𝑖 ≤ 𝑚)
100		elfzoel2 13682	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 ∈ (1..^𝑀) → 𝑀 ∈ ℤ)
101	100	zred 12695	. . . . . . . . . . . . . . 15 ⊢ (𝑚 ∈ (1..^𝑀) → 𝑀 ∈ ℝ)
102		elfzolt2 13693	. . . . . . . . . . . . . . 15 ⊢ (𝑚 ∈ (1..^𝑀) → 𝑚 < 𝑀)
103	94, 101, 102	ltled 11353	. . . . . . . . . . . . . 14 ⊢ (𝑚 ∈ (1..^𝑀) → 𝑚 ≤ 𝑀)
104	103	ad2antrr 738	. . . . . . . . . . . . 13 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 𝑚 ≤ 𝑀)
105	92, 95, 97, 99, 104	letrd 11362	. . . . . . . . . . . 12 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 𝑖 ≤ 𝑀)
106	85, 86, 88, 90, 105	elfzd 13538	. . . . . . . . . . 11 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → 𝑖 ∈ (1...𝑀))
107	84, 106	ffvelcdmd 7080	. . . . . . . . . 10 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑖 ∈ (1...𝑚)) → (𝐹‘𝑖) ∈ ℝ)
108	77, 82, 107	chvarfv 2276	. . . . . . . . 9 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ 𝑎 ∈ (1...𝑚)) → (𝐹‘𝑎) ∈ ℝ)
109		remulcl 11180	. . . . . . . . . 10 ⊢ ((𝑎 ∈ ℝ ∧ 𝑗 ∈ ℝ) → (𝑎 · 𝑗) ∈ ℝ)
110	109	adantl 486	. . . . . . . . 9 ⊢ (((𝑚 ∈ (1..^𝑀) ∧ 𝜑) ∧ (𝑎 ∈ ℝ ∧ 𝑗 ∈ ℝ)) → (𝑎 · 𝑗) ∈ ℝ)
111	69, 108, 110	seqcl 14054	. . . . . . . 8 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ 𝜑) → (seq1( · , 𝐹)‘𝑚) ∈ ℝ)
112	68, 111	eqeltrid 2867	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ 𝜑) → (𝑋‘𝑚) ∈ ℝ)
113	112	3adant2 1149	. . . . . 6 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝑋‘𝑚) ∈ ℝ)
114	83	3ad2ant3 1153	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → 𝐹:(1...𝑀)⟶ℝ)
115		fzofzp1 13789	. . . . . . . 8 ⊢ (𝑚 ∈ (1..^𝑀) → (𝑚 + 1) ∈ (1...𝑀))
116	115	3ad2ant1 1151	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝑚 + 1) ∈ (1...𝑀))
117	114, 116	ffvelcdmd 7080	. . . . . 6 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝐹‘(𝑚 + 1)) ∈ ℝ)
118	47	rpge0d 13059	. . . . . . . 8 ⊢ (𝜑 → 0 ≤ 𝐴)
119	118	3ad2ant3 1153	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → 0 ≤ 𝐴)
120	60, 66, 119	expge0d 14196	. . . . . 6 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → 0 ≤ (𝐴↑𝑚))
121		simp3 1156	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → 𝜑)
122		simp2 1155	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)))
123	121, 122	mpd 16	. . . . . 6 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝐴↑𝑚) < (𝑋‘𝑚))
124	115	adantr 485	. . . . . . . 8 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ 𝜑) → (𝑚 + 1) ∈ (1...𝑀))
125		simpr 489	. . . . . . . . 9 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ 𝜑) → 𝜑)
126	125, 124	jca 520	. . . . . . . 8 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ 𝜑) → (𝜑 ∧ (𝑚 + 1) ∈ (1...𝑀)))
127		nfv 1944	. . . . . . . . . . 11 ⊢ Ⅎ𝑖(𝑚 + 1) ∈ (1...𝑀)
128	29, 127	nfan 1929	. . . . . . . . . 10 ⊢ Ⅎ𝑖(𝜑 ∧ (𝑚 + 1) ∈ (1...𝑀))
129		nfcv 2925	. . . . . . . . . . . 12 ⊢ Ⅎ𝑖(𝑚 + 1)
130	34, 129	nffv 6891	. . . . . . . . . . 11 ⊢ Ⅎ𝑖(𝐹‘(𝑚 + 1))
131	32, 33, 130	nfbr 5158	. . . . . . . . . 10 ⊢ Ⅎ𝑖 𝐴 < (𝐹‘(𝑚 + 1))
132	128, 131	nfim 1926	. . . . . . . . 9 ⊢ Ⅎ𝑖((𝜑 ∧ (𝑚 + 1) ∈ (1...𝑀)) → 𝐴 < (𝐹‘(𝑚 + 1)))
133		eleq1 2851	. . . . . . . . . . 11 ⊢ (𝑖 = (𝑚 + 1) → (𝑖 ∈ (1...𝑀) ↔ (𝑚 + 1) ∈ (1...𝑀)))
134	133	anbi2d 641	. . . . . . . . . 10 ⊢ (𝑖 = (𝑚 + 1) → ((𝜑 ∧ 𝑖 ∈ (1...𝑀)) ↔ (𝜑 ∧ (𝑚 + 1) ∈ (1...𝑀))))
135		fveq2 6881	. . . . . . . . . . 11 ⊢ (𝑖 = (𝑚 + 1) → (𝐹‘𝑖) = (𝐹‘(𝑚 + 1)))
136	135	breq2d 5121	. . . . . . . . . 10 ⊢ (𝑖 = (𝑚 + 1) → (𝐴 < (𝐹‘𝑖) ↔ 𝐴 < (𝐹‘(𝑚 + 1))))
137	134, 136	imbi12d 347	. . . . . . . . 9 ⊢ (𝑖 = (𝑚 + 1) → (((𝜑 ∧ 𝑖 ∈ (1...𝑀)) → 𝐴 < (𝐹‘𝑖)) ↔ ((𝜑 ∧ (𝑚 + 1) ∈ (1...𝑀)) → 𝐴 < (𝐹‘(𝑚 + 1)))))
138	132, 137, 44	vtoclg1f 3535	. . . . . . . 8 ⊢ ((𝑚 + 1) ∈ (1...𝑀) → ((𝜑 ∧ (𝑚 + 1) ∈ (1...𝑀)) → 𝐴 < (𝐹‘(𝑚 + 1))))
139	124, 126, 138	sylc 66	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ 𝜑) → 𝐴 < (𝐹‘(𝑚 + 1)))
140	139	3adant2 1149	. . . . . 6 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → 𝐴 < (𝐹‘(𝑚 + 1)))
141	67, 113, 60, 117, 120, 123, 119, 140	ltmul12ad 12151	. . . . 5 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → ((𝐴↑𝑚) · 𝐴) < ((𝑋‘𝑚) · (𝐹‘(𝑚 + 1))))
142	48	3ad2ant3 1153	. . . . . 6 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → 𝐴 ∈ ℂ)
143	142, 66	expp1d 14179	. . . . 5 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝐴↑(𝑚 + 1)) = ((𝐴↑𝑚) · 𝐴))
144	50	fveq1i 6882	. . . . . . 7 ⊢ (𝑋‘(𝑚 + 1)) = (seq1( · , 𝐹)‘(𝑚 + 1))
145	144	a1i 11	. . . . . 6 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝑋‘(𝑚 + 1)) = (seq1( · , 𝐹)‘(𝑚 + 1)))
146	61	3ad2ant1 1151	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → 𝑚 ∈ (ℤ_≥‘1))
147		seqp1 14048	. . . . . . 7 ⊢ (𝑚 ∈ (ℤ_≥‘1) → (seq1( · , 𝐹)‘(𝑚 + 1)) = ((seq1( · , 𝐹)‘𝑚) · (𝐹‘(𝑚 + 1))))
148	146, 147	syl 18	. . . . . 6 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (seq1( · , 𝐹)‘(𝑚 + 1)) = ((seq1( · , 𝐹)‘𝑚) · (𝐹‘(𝑚 + 1))))
149	68	a1i 11	. . . . . . . 8 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝑋‘𝑚) = (seq1( · , 𝐹)‘𝑚))
150	149	eqcomd 2769	. . . . . . 7 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (seq1( · , 𝐹)‘𝑚) = (𝑋‘𝑚))
151	150	oveq1d 7425	. . . . . 6 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → ((seq1( · , 𝐹)‘𝑚) · (𝐹‘(𝑚 + 1))) = ((𝑋‘𝑚) · (𝐹‘(𝑚 + 1))))
152	145, 148, 151	3eqtrd 2802	. . . . 5 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝑋‘(𝑚 + 1)) = ((𝑋‘𝑚) · (𝐹‘(𝑚 + 1))))
153	141, 143, 152	3brtr4d 5143	. . . 4 ⊢ ((𝑚 ∈ (1..^𝑀) ∧ (𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) ∧ 𝜑) → (𝐴↑(𝑚 + 1)) < (𝑋‘(𝑚 + 1)))
154	153	3exp 1137	. . 3 ⊢ (𝑚 ∈ (1..^𝑀) → ((𝜑 → (𝐴↑𝑚) < (𝑋‘𝑚)) → (𝜑 → (𝐴↑(𝑚 + 1)) < (𝑋‘(𝑚 + 1)))))
155	9, 13, 17, 21, 58, 154	fzind2 13813	. 2 ⊢ (𝑀 ∈ (1...𝑀) → (𝜑 → (𝐴↑𝑀) < (𝑋‘𝑀)))
156	5, 155	mpcom 39	1 ⊢ (𝜑 → (𝐴↑𝑀) < (𝑋‘𝑀))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1103 = wceq 1570 Ⅎwnf 1813 ∈ wcel 2143 Ⅎwnfc 2910 class class class wbr 5109 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 ℂcc 11093 ℝcr 11094 0cc0 11095 1c1 11096 + caddc 11098 · cmul 11100 < clt 11238 ≤ cle 11239 ℕcn 12228 ℕ₀cn0 12499 ℤcz 12586 ℤ_≥cuz 12857 ℝ⁺crp 13011 ...cfz 13530 ..^cfzo 13678 seqcseq 14033 ↑cexp 14093

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-nn 12229 df-n0 12500 df-z 12587 df-uz 12858 df-rp 13012 df-fz 13531 df-fzo 13679 df-seq 14034 df-exp 14094

This theorem is referenced by: stoweidlem42 46776

W3C validator