Metamath Proof Explorer


Theorem leexp2a

Description: Weak ordering relationship for exponentiation of a fixed real base greater than or equal to 1 to integer exponents. (Contributed by NM, 14-Dec-2005) (Revised by Mario Carneiro, 5-Jun-2014)

Ref Expression
Assertion leexp2a ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → A M ≤ A N

Proof

Step Hyp Ref Expression
1 simp1 ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → A ∈ ℝ
2 0red ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → 0 ∈ ℝ
3 1red ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → 1 ∈ ℝ
4 0lt1 ⊢ 0 < 1
5 4 a1i ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → 0 < 1
6 simp2 ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → 1 ≤ A
7 2 3 1 5 6 ltletrd ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → 0 < A
8 1 7 elrpd ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → A ∈ ℝ +
9 eluzel2 ⊢ N ∈ ℤ ≥ M → M ∈ ℤ
10 9 3ad2ant3 ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → M ∈ ℤ
11 rpexpcl ⊢ A ∈ ℝ + ∧ M ∈ ℤ → A M ∈ ℝ +
12 8 10 11 syl2anc ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → A M ∈ ℝ +
13 12 rpred ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → A M ∈ ℝ
14 13 recnd ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → A M ∈ ℂ
15 14 mullidd ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → 1 ⁢ A M = A M
16 uznn0sub ⊢ N ∈ ℤ ≥ M → N − M ∈ ℕ 0
17 16 3ad2ant3 ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → N − M ∈ ℕ 0
18 expge1 ⊢ A ∈ ℝ ∧ N − M ∈ ℕ 0 ∧ 1 ≤ A → 1 ≤ A N − M
19 1 17 6 18 syl3anc ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → 1 ≤ A N − M
20 1 recnd ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → A ∈ ℂ
21 7 gt0ne0d ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → A ≠ 0
22 eluzelz ⊢ N ∈ ℤ ≥ M → N ∈ ℤ
23 22 3ad2ant3 ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → N ∈ ℤ
24 expsub ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ N ∈ ℤ ∧ M ∈ ℤ → A N − M = A N A M
25 20 21 23 10 24 syl22anc ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → A N − M = A N A M
26 19 25 breqtrd ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → 1 ≤ A N A M
27 rpexpcl ⊢ A ∈ ℝ + ∧ N ∈ ℤ → A N ∈ ℝ +
28 8 23 27 syl2anc ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → A N ∈ ℝ +
29 28 rpred ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → A N ∈ ℝ
30 3 29 12 lemuldivd ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → 1 ⁢ A M ≤ A N ↔ 1 ≤ A N A M
31 26 30 mpbird ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → 1 ⁢ A M ≤ A N
32 15 31 eqbrtrrd ⊢ A ∈ ℝ ∧ 1 ≤ A ∧ N ∈ ℤ ≥ M → A M ≤ A N