Metamath Proof Explorer


Theorem cxplt

Description: Ordering property for complex exponentiation. (Contributed by Mario Carneiro, 2-Aug-2014)

Ref Expression
Assertion cxplt ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → B < C ↔ A B < A C

Proof

Step Hyp Ref Expression
1 simprl ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → B ∈ ℝ
2 rplogcl ⊢ A ∈ ℝ ∧ 1 < A → log ⁡ A ∈ ℝ +
3 2 adantr ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → log ⁡ A ∈ ℝ +
4 3 rpred ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → log ⁡ A ∈ ℝ
5 1 4 remulcld ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → B ⁢ log ⁡ A ∈ ℝ
6 simprr ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → C ∈ ℝ
7 6 4 remulcld ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → C ⁢ log ⁡ A ∈ ℝ
8 eflt ⊢ B ⁢ log ⁡ A ∈ ℝ ∧ C ⁢ log ⁡ A ∈ ℝ → B ⁢ log ⁡ A < C ⁢ log ⁡ A ↔ e B ⁢ log ⁡ A < e C ⁢ log ⁡ A
9 5 7 8 syl2anc ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → B ⁢ log ⁡ A < C ⁢ log ⁡ A ↔ e B ⁢ log ⁡ A < e C ⁢ log ⁡ A
10 1 6 3 ltmul1d ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → B < C ↔ B ⁢ log ⁡ A < C ⁢ log ⁡ A
11 simpll ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → A ∈ ℝ
12 11 recnd ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → A ∈ ℂ
13 0red ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → 0 ∈ ℝ
14 1red ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → 1 ∈ ℝ
15 0lt1 ⊢ 0 < 1
16 15 a1i ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → 0 < 1
17 simplr ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → 1 < A
18 13 14 11 16 17 lttrd ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → 0 < A
19 18 gt0ne0d ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → A ≠ 0
20 1 recnd ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → B ∈ ℂ
21 cxpef ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ B ∈ ℂ → A B = e B ⁢ log ⁡ A
22 12 19 20 21 syl3anc ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → A B = e B ⁢ log ⁡ A
23 6 recnd ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → C ∈ ℂ
24 cxpef ⊢ A ∈ ℂ ∧ A ≠ 0 ∧ C ∈ ℂ → A C = e C ⁢ log ⁡ A
25 12 19 23 24 syl3anc ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → A C = e C ⁢ log ⁡ A
26 22 25 breq12d ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → A B < A C ↔ e B ⁢ log ⁡ A < e C ⁢ log ⁡ A
27 9 10 26 3bitr4d ⊢ A ∈ ℝ ∧ 1 < A ∧ B ∈ ℝ ∧ C ∈ ℝ → B < C ↔ A B < A C