Metamath Proof Explorer


Theorem reglogleb

Description: General logarithm preserves <_ . (Contributed by Stefan O'Rear, 19-Oct-2014) (New usage is discouraged.) Use logbleb instead.

Ref Expression
Assertion reglogleb ⊢ A ∈ ℝ + ∧ B ∈ ℝ + ∧ C ∈ ℝ + ∧ 1 < C → A ≤ B ↔ log ⁡ A log ⁡ C ≤ log ⁡ B log ⁡ C

Proof

Step Hyp Ref Expression
1 logleb ⊢ A ∈ ℝ + ∧ B ∈ ℝ + → A ≤ B ↔ log ⁡ A ≤ log ⁡ B
2 1 adantr ⊢ A ∈ ℝ + ∧ B ∈ ℝ + ∧ C ∈ ℝ + ∧ 1 < C → A ≤ B ↔ log ⁡ A ≤ log ⁡ B
3 relogcl ⊢ A ∈ ℝ + → log ⁡ A ∈ ℝ
4 3 ad2antrr ⊢ A ∈ ℝ + ∧ B ∈ ℝ + ∧ C ∈ ℝ + ∧ 1 < C → log ⁡ A ∈ ℝ
5 relogcl ⊢ B ∈ ℝ + → log ⁡ B ∈ ℝ
6 5 ad2antlr ⊢ A ∈ ℝ + ∧ B ∈ ℝ + ∧ C ∈ ℝ + ∧ 1 < C → log ⁡ B ∈ ℝ
7 relogcl ⊢ C ∈ ℝ + → log ⁡ C ∈ ℝ
8 7 ad2antrl ⊢ A ∈ ℝ + ∧ B ∈ ℝ + ∧ C ∈ ℝ + ∧ 1 < C → log ⁡ C ∈ ℝ
9 log1 ⊢ log ⁡ 1 = 0
10 1rp ⊢ 1 ∈ ℝ +
11 logltb ⊢ 1 ∈ ℝ + ∧ C ∈ ℝ + → 1 < C ↔ log ⁡ 1 < log ⁡ C
12 10 11 mpan ⊢ C ∈ ℝ + → 1 < C ↔ log ⁡ 1 < log ⁡ C
13 12 biimpa ⊢ C ∈ ℝ + ∧ 1 < C → log ⁡ 1 < log ⁡ C
14 9 13 eqbrtrrid ⊢ C ∈ ℝ + ∧ 1 < C → 0 < log ⁡ C
15 14 adantl ⊢ A ∈ ℝ + ∧ B ∈ ℝ + ∧ C ∈ ℝ + ∧ 1 < C → 0 < log ⁡ C
16 lediv1 ⊢ log ⁡ A ∈ ℝ ∧ log ⁡ B ∈ ℝ ∧ log ⁡ C ∈ ℝ ∧ 0 < log ⁡ C → log ⁡ A ≤ log ⁡ B ↔ log ⁡ A log ⁡ C ≤ log ⁡ B log ⁡ C
17 4 6 8 15 16 syl112anc ⊢ A ∈ ℝ + ∧ B ∈ ℝ + ∧ C ∈ ℝ + ∧ 1 < C → log ⁡ A ≤ log ⁡ B ↔ log ⁡ A log ⁡ C ≤ log ⁡ B log ⁡ C
18 2 17 bitrd ⊢ A ∈ ℝ + ∧ B ∈ ℝ + ∧ C ∈ ℝ + ∧ 1 < C → A ≤ B ↔ log ⁡ A log ⁡ C ≤ log ⁡ B log ⁡ C