Metamath Proof Explorer


Theorem leexp2d

Description: Ordering law for exponentiation. (Contributed by Mario Carneiro, 28-May-2016)

Ref Expression
Hypotheses sqgt0d.1 ⊢ φ → A ∈ ℝ
ltexp2d.2 ⊢ φ → M ∈ ℤ
ltexp2d.3 ⊢ φ → N ∈ ℤ
ltexp2d.4 ⊢ φ → 1 < A
Assertion leexp2d ⊢ φ → M ≤ N ↔ A M ≤ A N

Proof

Step Hyp Ref Expression
1 sqgt0d.1 ⊢ φ → A ∈ ℝ
2 ltexp2d.2 ⊢ φ → M ∈ ℤ
3 ltexp2d.3 ⊢ φ → N ∈ ℤ
4 ltexp2d.4 ⊢ φ → 1 < A
5 leexp2 ⊢ A ∈ ℝ ∧ M ∈ ℤ ∧ N ∈ ℤ ∧ 1 < A → M ≤ N ↔ A M ≤ A N
6 1 2 3 4 5 syl31anc ⊢ φ → M ≤ N ↔ A M ≤ A N