Metamath Proof Explorer


Theorem leexp2r

Description: Weak ordering relationship for exponentiation of a fixed real base in [ 0 , 1 ] to integer exponents. (Contributed by Paul Chapman, 14-Jan-2008) (Revised by Mario Carneiro, 29-Apr-2014)

Ref Expression
Assertion leexp2r ⊢ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ N ∈ ℤ ≥ M ∧ 0 ≤ A ∧ A ≤ 1 → A N ≤ A M

Proof

Step Hyp Ref Expression
1 oveq2 ⊢ j = M → A j = A M
2 1 breq1d ⊢ j = M → A j ≤ A M ↔ A M ≤ A M
3 2 imbi2d ⊢ j = M → A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A j ≤ A M ↔ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A M ≤ A M
4 oveq2 ⊢ j = k → A j = A k
5 4 breq1d ⊢ j = k → A j ≤ A M ↔ A k ≤ A M
6 5 imbi2d ⊢ j = k → A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A j ≤ A M ↔ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A k ≤ A M
7 oveq2 ⊢ j = k + 1 → A j = A k + 1
8 7 breq1d ⊢ j = k + 1 → A j ≤ A M ↔ A k + 1 ≤ A M
9 8 imbi2d ⊢ j = k + 1 → A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A j ≤ A M ↔ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A k + 1 ≤ A M
10 oveq2 ⊢ j = N → A j = A N
11 10 breq1d ⊢ j = N → A j ≤ A M ↔ A N ≤ A M
12 11 imbi2d ⊢ j = N → A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A j ≤ A M ↔ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A N ≤ A M
13 reexpcl ⊢ A ∈ ℝ ∧ M ∈ ℕ 0 → A M ∈ ℝ
14 13 adantr ⊢ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A M ∈ ℝ
15 14 leidd ⊢ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A M ≤ A M
16 simprll ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A ∈ ℝ
17 1red ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → 1 ∈ ℝ
18 simprlr ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → M ∈ ℕ 0
19 simpl ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → k ∈ ℤ ≥ M
20 eluznn0 ⊢ M ∈ ℕ 0 ∧ k ∈ ℤ ≥ M → k ∈ ℕ 0
21 18 19 20 syl2anc ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → k ∈ ℕ 0
22 reexpcl ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 → A k ∈ ℝ
23 16 21 22 syl2anc ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A k ∈ ℝ
24 simprrl ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → 0 ≤ A
25 expge0 ⊢ A ∈ ℝ ∧ k ∈ ℕ 0 ∧ 0 ≤ A → 0 ≤ A k
26 16 21 24 25 syl3anc ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → 0 ≤ A k
27 simprrr ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A ≤ 1
28 16 17 23 26 27 lemul2ad ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A k ⁢ A ≤ A k ⋅ 1
29 16 recnd ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A ∈ ℂ
30 expp1 ⊢ A ∈ ℂ ∧ k ∈ ℕ 0 → A k + 1 = A k ⁢ A
31 29 21 30 syl2anc ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A k + 1 = A k ⁢ A
32 23 recnd ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A k ∈ ℂ
33 32 mulridd ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A k ⋅ 1 = A k
34 33 eqcomd ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A k = A k ⋅ 1
35 28 31 34 3brtr4d ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A k + 1 ≤ A k
36 peano2nn0 ⊢ k ∈ ℕ 0 → k + 1 ∈ ℕ 0
37 21 36 syl ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → k + 1 ∈ ℕ 0
38 reexpcl ⊢ A ∈ ℝ ∧ k + 1 ∈ ℕ 0 → A k + 1 ∈ ℝ
39 16 37 38 syl2anc ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A k + 1 ∈ ℝ
40 13 ad2antrl ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A M ∈ ℝ
41 letr ⊢ A k + 1 ∈ ℝ ∧ A k ∈ ℝ ∧ A M ∈ ℝ → A k + 1 ≤ A k ∧ A k ≤ A M → A k + 1 ≤ A M
42 39 23 40 41 syl3anc ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A k + 1 ≤ A k ∧ A k ≤ A M → A k + 1 ≤ A M
43 35 42 mpand ⊢ k ∈ ℤ ≥ M ∧ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A k ≤ A M → A k + 1 ≤ A M
44 43 ex ⊢ k ∈ ℤ ≥ M → A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A k ≤ A M → A k + 1 ≤ A M
45 44 a2d ⊢ k ∈ ℤ ≥ M → A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A k ≤ A M → A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A k + 1 ≤ A M
46 3 6 9 12 15 45 uzind4i ⊢ N ∈ ℤ ≥ M → A ∈ ℝ ∧ M ∈ ℕ 0 ∧ 0 ≤ A ∧ A ≤ 1 → A N ≤ A M
47 46 expd ⊢ N ∈ ℤ ≥ M → A ∈ ℝ ∧ M ∈ ℕ 0 → 0 ≤ A ∧ A ≤ 1 → A N ≤ A M
48 47 com12 ⊢ A ∈ ℝ ∧ M ∈ ℕ 0 → N ∈ ℤ ≥ M → 0 ≤ A ∧ A ≤ 1 → A N ≤ A M
49 48 3impia ⊢ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ N ∈ ℤ ≥ M → 0 ≤ A ∧ A ≤ 1 → A N ≤ A M
50 49 imp ⊢ A ∈ ℝ ∧ M ∈ ℕ 0 ∧ N ∈ ℤ ≥ M ∧ 0 ≤ A ∧ A ≤ 1 → A N ≤ A M