Metamath Proof Explorer


Theorem rpexpmord

Description: Base ordering relationship for exponentiation of positive reals to a fixed positive integer exponent. (Contributed by Stefan O'Rear, 16-Oct-2014)

Ref Expression
Assertion rpexpmord ⊢ N ∈ ℕ ∧ A ∈ ℝ + ∧ B ∈ ℝ + → A < B ↔ A N < B N

Proof

Step Hyp Ref Expression
1 oveq1 ⊢ a = b → a N = b N
2 oveq1 ⊢ a = A → a N = A N
3 oveq1 ⊢ a = B → a N = B N
4 rpssre ⊢ ℝ + ⊆ ℝ
5 rpre ⊢ a ∈ ℝ + → a ∈ ℝ
6 nnnn0 ⊢ N ∈ ℕ → N ∈ ℕ 0
7 reexpcl ⊢ a ∈ ℝ ∧ N ∈ ℕ 0 → a N ∈ ℝ
8 5 6 7 syl2anr ⊢ N ∈ ℕ ∧ a ∈ ℝ + → a N ∈ ℝ
9 simplrl ⊢ N ∈ ℕ ∧ a ∈ ℝ + ∧ b ∈ ℝ + ∧ a < b → a ∈ ℝ +
10 9 rpred ⊢ N ∈ ℕ ∧ a ∈ ℝ + ∧ b ∈ ℝ + ∧ a < b → a ∈ ℝ
11 simplrr ⊢ N ∈ ℕ ∧ a ∈ ℝ + ∧ b ∈ ℝ + ∧ a < b → b ∈ ℝ +
12 11 rpred ⊢ N ∈ ℕ ∧ a ∈ ℝ + ∧ b ∈ ℝ + ∧ a < b → b ∈ ℝ
13 9 rpge0d ⊢ N ∈ ℕ ∧ a ∈ ℝ + ∧ b ∈ ℝ + ∧ a < b → 0 ≤ a
14 simpr ⊢ N ∈ ℕ ∧ a ∈ ℝ + ∧ b ∈ ℝ + ∧ a < b → a < b
15 simpll ⊢ N ∈ ℕ ∧ a ∈ ℝ + ∧ b ∈ ℝ + ∧ a < b → N ∈ ℕ
16 expmordi ⊢ a ∈ ℝ ∧ b ∈ ℝ ∧ 0 ≤ a ∧ a < b ∧ N ∈ ℕ → a N < b N
17 10 12 13 14 15 16 syl221anc ⊢ N ∈ ℕ ∧ a ∈ ℝ + ∧ b ∈ ℝ + ∧ a < b → a N < b N
18 17 ex ⊢ N ∈ ℕ ∧ a ∈ ℝ + ∧ b ∈ ℝ + → a < b → a N < b N
19 1 2 3 4 8 18 ltord1 ⊢ N ∈ ℕ ∧ A ∈ ℝ + ∧ B ∈ ℝ + → A < B ↔ A N < B N
20 19 3impb ⊢ N ∈ ℕ ∧ A ∈ ℝ + ∧ B ∈ ℝ + → A < B ↔ A N < B N