Metamath Proof Explorer


Theorem cxplt3

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

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

Proof

Step Hyp Ref Expression
1 simpll ⊢ A ∈ ℝ + ∧ A < 1 ∧ B ∈ ℝ ∧ C ∈ ℝ → A ∈ ℝ +
2 simprl ⊢ A ∈ ℝ + ∧ A < 1 ∧ B ∈ ℝ ∧ C ∈ ℝ → B ∈ ℝ
3 2 recnd ⊢ A ∈ ℝ + ∧ A < 1 ∧ B ∈ ℝ ∧ C ∈ ℝ → B ∈ ℂ
4 cxprec ⊢ A ∈ ℝ + ∧ B ∈ ℂ → 1 A B = 1 A B
5 1 3 4 syl2anc ⊢ A ∈ ℝ + ∧ A < 1 ∧ B ∈ ℝ ∧ C ∈ ℝ → 1 A B = 1 A B
6 simprr ⊢ A ∈ ℝ + ∧ A < 1 ∧ B ∈ ℝ ∧ C ∈ ℝ → C ∈ ℝ
7 6 recnd ⊢ A ∈ ℝ + ∧ A < 1 ∧ B ∈ ℝ ∧ C ∈ ℝ → C ∈ ℂ
8 cxprec ⊢ A ∈ ℝ + ∧ C ∈ ℂ → 1 A C = 1 A C
9 1 7 8 syl2anc ⊢ A ∈ ℝ + ∧ A < 1 ∧ B ∈ ℝ ∧ C ∈ ℝ → 1 A C = 1 A C
10 5 9 breq12d ⊢ A ∈ ℝ + ∧ A < 1 ∧ B ∈ ℝ ∧ C ∈ ℝ → 1 A B < 1 A C ↔ 1 A B < 1 A C
11 1 rprecred ⊢ A ∈ ℝ + ∧ A < 1 ∧ B ∈ ℝ ∧ C ∈ ℝ → 1 A ∈ ℝ
12 simplr ⊢ A ∈ ℝ + ∧ A < 1 ∧ B ∈ ℝ ∧ C ∈ ℝ → A < 1
13 1 reclt1d ⊢ A ∈ ℝ + ∧ A < 1 ∧ B ∈ ℝ ∧ C ∈ ℝ → A < 1 ↔ 1 < 1 A
14 12 13 mpbid ⊢ A ∈ ℝ + ∧ A < 1 ∧ B ∈ ℝ ∧ C ∈ ℝ → 1 < 1 A
15 cxplt ⊢ 1 A ∈ ℝ ∧ 1 < 1 A ∧ B ∈ ℝ ∧ C ∈ ℝ → B < C ↔ 1 A B < 1 A C
16 11 14 2 6 15 syl22anc ⊢ A ∈ ℝ + ∧ A < 1 ∧ B ∈ ℝ ∧ C ∈ ℝ → B < C ↔ 1 A B < 1 A C
17 rpcxpcl ⊢ A ∈ ℝ + ∧ C ∈ ℝ → A C ∈ ℝ +
18 17 ad2ant2rl ⊢ A ∈ ℝ + ∧ A < 1 ∧ B ∈ ℝ ∧ C ∈ ℝ → A C ∈ ℝ +
19 rpcxpcl ⊢ A ∈ ℝ + ∧ B ∈ ℝ → A B ∈ ℝ +
20 19 ad2ant2r ⊢ A ∈ ℝ + ∧ A < 1 ∧ B ∈ ℝ ∧ C ∈ ℝ → A B ∈ ℝ +
21 18 20 ltrecd ⊢ A ∈ ℝ + ∧ A < 1 ∧ B ∈ ℝ ∧ C ∈ ℝ → A C < A B ↔ 1 A B < 1 A C
22 10 16 21 3bitr4d ⊢ A ∈ ℝ + ∧ A < 1 ∧ B ∈ ℝ ∧ C ∈ ℝ → B < C ↔ A C < A B