Metamath Proof Explorer


Theorem dya2ub

Description: An upper bound for a dyadic number. (Contributed by Thierry Arnoux, 19-Sep-2017)

Ref Expression
Assertion dya2ub ⊢ R ∈ ℝ + → 1 2 1 − log 2 R < R

Proof

Step Hyp Ref Expression
1 2z ⊢ 2 ∈ ℤ
2 uzid ⊢ 2 ∈ ℤ → 2 ∈ ℤ ≥ 2
3 1 2 ax-mp ⊢ 2 ∈ ℤ ≥ 2
4 relogbzcl ⊢ 2 ∈ ℤ ≥ 2 ∧ R ∈ ℝ + → log 2 R ∈ ℝ
5 3 4 mpan ⊢ R ∈ ℝ + → log 2 R ∈ ℝ
6 5 renegcld ⊢ R ∈ ℝ + → − log 2 R ∈ ℝ
7 flltp1 ⊢ − log 2 R ∈ ℝ → − log 2 R < − log 2 R + 1
8 6 7 syl ⊢ R ∈ ℝ + → − log 2 R < − log 2 R + 1
9 1z ⊢ 1 ∈ ℤ
10 fladdz ⊢ − log 2 R ∈ ℝ ∧ 1 ∈ ℤ → - log 2 R + 1 = − log 2 R + 1
11 6 9 10 sylancl ⊢ R ∈ ℝ + → - log 2 R + 1 = − log 2 R + 1
12 5 recnd ⊢ R ∈ ℝ + → log 2 R ∈ ℂ
13 ax-1cn ⊢ 1 ∈ ℂ
14 negsubdi ⊢ log 2 R ∈ ℂ ∧ 1 ∈ ℂ → − log 2 R − 1 = - log 2 R + 1
15 negsubdi2 ⊢ log 2 R ∈ ℂ ∧ 1 ∈ ℂ → − log 2 R − 1 = 1 − log 2 R
16 14 15 eqtr3d ⊢ log 2 R ∈ ℂ ∧ 1 ∈ ℂ → - log 2 R + 1 = 1 − log 2 R
17 12 13 16 sylancl ⊢ R ∈ ℝ + → - log 2 R + 1 = 1 − log 2 R
18 17 fveq2d ⊢ R ∈ ℝ + → - log 2 R + 1 = 1 − log 2 R
19 11 18 eqtr3d ⊢ R ∈ ℝ + → − log 2 R + 1 = 1 − log 2 R
20 8 19 breqtrd ⊢ R ∈ ℝ + → − log 2 R < 1 − log 2 R
21 3 a1i ⊢ R ∈ ℝ + → 2 ∈ ℤ ≥ 2
22 2rp ⊢ 2 ∈ ℝ +
23 22 a1i ⊢ R ∈ ℝ + → 2 ∈ ℝ +
24 1red ⊢ R ∈ ℝ + → 1 ∈ ℝ
25 24 5 resubcld ⊢ R ∈ ℝ + → 1 − log 2 R ∈ ℝ
26 25 flcld ⊢ R ∈ ℝ + → 1 − log 2 R ∈ ℤ
27 23 26 rpexpcld ⊢ R ∈ ℝ + → 2 1 − log 2 R ∈ ℝ +
28 27 rpreccld ⊢ R ∈ ℝ + → 1 2 1 − log 2 R ∈ ℝ +
29 id ⊢ R ∈ ℝ + → R ∈ ℝ +
30 logblt ⊢ 2 ∈ ℤ ≥ 2 ∧ 1 2 1 − log 2 R ∈ ℝ + ∧ R ∈ ℝ + → 1 2 1 − log 2 R < R ↔ log 2 1 2 1 − log 2 R < log 2 R
31 21 28 29 30 syl3anc ⊢ R ∈ ℝ + → 1 2 1 − log 2 R < R ↔ log 2 1 2 1 − log 2 R < log 2 R
32 logbrec ⊢ 2 ∈ ℤ ≥ 2 ∧ 2 1 − log 2 R ∈ ℝ + → log 2 1 2 1 − log 2 R = − log 2 2 1 − log 2 R
33 21 27 32 syl2anc ⊢ R ∈ ℝ + → log 2 1 2 1 − log 2 R = − log 2 2 1 − log 2 R
34 33 breq1d ⊢ R ∈ ℝ + → log 2 1 2 1 − log 2 R < log 2 R ↔ − log 2 2 1 − log 2 R < log 2 R
35 relogbzcl ⊢ 2 ∈ ℤ ≥ 2 ∧ 2 1 − log 2 R ∈ ℝ + → log 2 2 1 − log 2 R ∈ ℝ
36 21 27 35 syl2anc ⊢ R ∈ ℝ + → log 2 2 1 − log 2 R ∈ ℝ
37 ltnegcon1 ⊢ log 2 2 1 − log 2 R ∈ ℝ ∧ log 2 R ∈ ℝ → − log 2 2 1 − log 2 R < log 2 R ↔ − log 2 R < log 2 2 1 − log 2 R
38 36 5 37 syl2anc ⊢ R ∈ ℝ + → − log 2 2 1 − log 2 R < log 2 R ↔ − log 2 R < log 2 2 1 − log 2 R
39 31 34 38 3bitrd ⊢ R ∈ ℝ + → 1 2 1 − log 2 R < R ↔ − log 2 R < log 2 2 1 − log 2 R
40 nnlogbexp ⊢ 2 ∈ ℤ ≥ 2 ∧ 1 − log 2 R ∈ ℤ → log 2 2 1 − log 2 R = 1 − log 2 R
41 21 26 40 syl2anc ⊢ R ∈ ℝ + → log 2 2 1 − log 2 R = 1 − log 2 R
42 41 breq2d ⊢ R ∈ ℝ + → − log 2 R < log 2 2 1 − log 2 R ↔ − log 2 R < 1 − log 2 R
43 39 42 bitrd ⊢ R ∈ ℝ + → 1 2 1 − log 2 R < R ↔ − log 2 R < 1 − log 2 R
44 20 43 mpbird ⊢ R ∈ ℝ + → 1 2 1 − log 2 R < R