Metamath Proof Explorer


Theorem dignn0ldlem

Description: Lemma for dignnld . (Contributed by AV, 25-May-2020)

Ref Expression
Assertion dignn0ldlem ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ ∧ K ∈ ℤ ≥ log B N + 1 → N < B K

Proof

Step Hyp Ref Expression
1 nnre ⊢ N ∈ ℕ → N ∈ ℝ
2 1 3ad2ant2 ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ ∧ K ∈ ℤ ≥ log B N + 1 → N ∈ ℝ
3 eluzelre ⊢ B ∈ ℤ ≥ 2 → B ∈ ℝ
4 3 3ad2ant1 ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ ∧ K ∈ ℤ ≥ log B N + 1 → B ∈ ℝ
5 eluz2nn ⊢ B ∈ ℤ ≥ 2 → B ∈ ℕ
6 nnnn0 ⊢ B ∈ ℕ → B ∈ ℕ 0
7 6 nn0ge0d ⊢ B ∈ ℕ → 0 ≤ B
8 5 7 syl ⊢ B ∈ ℤ ≥ 2 → 0 ≤ B
9 8 3ad2ant1 ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ ∧ K ∈ ℤ ≥ log B N + 1 → 0 ≤ B
10 nnrp ⊢ N ∈ ℕ → N ∈ ℝ +
11 relogbzcl ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℝ + → log B N ∈ ℝ
12 10 11 sylan2 ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ → log B N ∈ ℝ
13 12 3adant3 ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ ∧ K ∈ ℤ ≥ log B N + 1 → log B N ∈ ℝ
14 4 9 13 recxpcld ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ ∧ K ∈ ℤ ≥ log B N + 1 → B log B N ∈ ℝ
15 eluzelre ⊢ K ∈ ℤ ≥ log B N + 1 → K ∈ ℝ
16 15 3ad2ant3 ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ ∧ K ∈ ℤ ≥ log B N + 1 → K ∈ ℝ
17 4 9 16 recxpcld ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ ∧ K ∈ ℤ ≥ log B N + 1 → B K ∈ ℝ
18 1 leidd ⊢ N ∈ ℕ → N ≤ N
19 18 adantl ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ → N ≤ N
20 eluz2cnn0n1 ⊢ B ∈ ℤ ≥ 2 → B ∈ ℂ ∖ 0 1
21 nncn ⊢ N ∈ ℕ → N ∈ ℂ
22 nnne0 ⊢ N ∈ ℕ → N ≠ 0
23 eldifsn ⊢ N ∈ ℂ ∖ 0 ↔ N ∈ ℂ ∧ N ≠ 0
24 21 22 23 sylanbrc ⊢ N ∈ ℕ → N ∈ ℂ ∖ 0
25 cxplogb ⊢ B ∈ ℂ ∖ 0 1 ∧ N ∈ ℂ ∖ 0 → B log B N = N
26 20 24 25 syl2an ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ → B log B N = N
27 19 26 breqtrrd ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ → N ≤ B log B N
28 27 3adant3 ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ ∧ K ∈ ℤ ≥ log B N + 1 → N ≤ B log B N
29 eluz2 ⊢ K ∈ ℤ ≥ log B N + 1 ↔ log B N + 1 ∈ ℤ ∧ K ∈ ℤ ∧ log B N + 1 ≤ K
30 12 adantl ⊢ log B N + 1 ∈ ℤ ∧ K ∈ ℤ ∧ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ → log B N ∈ ℝ
31 flltp1 ⊢ log B N ∈ ℝ → log B N < log B N + 1
32 30 31 syl ⊢ log B N + 1 ∈ ℤ ∧ K ∈ ℤ ∧ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ → log B N < log B N + 1
33 zre ⊢ log B N + 1 ∈ ℤ → log B N + 1 ∈ ℝ
34 33 adantr ⊢ log B N + 1 ∈ ℤ ∧ K ∈ ℤ → log B N + 1 ∈ ℝ
35 34 adantr ⊢ log B N + 1 ∈ ℤ ∧ K ∈ ℤ ∧ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ → log B N + 1 ∈ ℝ
36 zre ⊢ K ∈ ℤ → K ∈ ℝ
37 36 adantl ⊢ log B N + 1 ∈ ℤ ∧ K ∈ ℤ → K ∈ ℝ
38 37 adantr ⊢ log B N + 1 ∈ ℤ ∧ K ∈ ℤ ∧ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ → K ∈ ℝ
39 ltletr ⊢ log B N ∈ ℝ ∧ log B N + 1 ∈ ℝ ∧ K ∈ ℝ → log B N < log B N + 1 ∧ log B N + 1 ≤ K → log B N < K
40 30 35 38 39 syl3anc ⊢ log B N + 1 ∈ ℤ ∧ K ∈ ℤ ∧ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ → log B N < log B N + 1 ∧ log B N + 1 ≤ K → log B N < K
41 32 40 mpand ⊢ log B N + 1 ∈ ℤ ∧ K ∈ ℤ ∧ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ → log B N + 1 ≤ K → log B N < K
42 41 ex ⊢ log B N + 1 ∈ ℤ ∧ K ∈ ℤ → B ∈ ℤ ≥ 2 ∧ N ∈ ℕ → log B N + 1 ≤ K → log B N < K
43 42 com23 ⊢ log B N + 1 ∈ ℤ ∧ K ∈ ℤ → log B N + 1 ≤ K → B ∈ ℤ ≥ 2 ∧ N ∈ ℕ → log B N < K
44 43 3impia ⊢ log B N + 1 ∈ ℤ ∧ K ∈ ℤ ∧ log B N + 1 ≤ K → B ∈ ℤ ≥ 2 ∧ N ∈ ℕ → log B N < K
45 44 com12 ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ → log B N + 1 ∈ ℤ ∧ K ∈ ℤ ∧ log B N + 1 ≤ K → log B N < K
46 29 45 biimtrid ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ → K ∈ ℤ ≥ log B N + 1 → log B N < K
47 46 3impia ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ ∧ K ∈ ℤ ≥ log B N + 1 → log B N < K
48 eluz2gt1 ⊢ B ∈ ℤ ≥ 2 → 1 < B
49 3 48 jca ⊢ B ∈ ℤ ≥ 2 → B ∈ ℝ ∧ 1 < B
50 49 3ad2ant1 ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ ∧ K ∈ ℤ ≥ log B N + 1 → B ∈ ℝ ∧ 1 < B
51 cxplt ⊢ B ∈ ℝ ∧ 1 < B ∧ log B N ∈ ℝ ∧ K ∈ ℝ → log B N < K ↔ B log B N < B K
52 50 13 16 51 syl12anc ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ ∧ K ∈ ℤ ≥ log B N + 1 → log B N < K ↔ B log B N < B K
53 47 52 mpbid ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ ∧ K ∈ ℤ ≥ log B N + 1 → B log B N < B K
54 2 14 17 28 53 lelttrd ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ ∧ K ∈ ℤ ≥ log B N + 1 → N < B K
55 eluzelcn ⊢ B ∈ ℤ ≥ 2 → B ∈ ℂ
56 55 3ad2ant1 ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ ∧ K ∈ ℤ ≥ log B N + 1 → B ∈ ℂ
57 eluz2n0 ⊢ B ∈ ℤ ≥ 2 → B ≠ 0
58 57 3ad2ant1 ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ ∧ K ∈ ℤ ≥ log B N + 1 → B ≠ 0
59 eluzelz ⊢ K ∈ ℤ ≥ log B N + 1 → K ∈ ℤ
60 59 3ad2ant3 ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ ∧ K ∈ ℤ ≥ log B N + 1 → K ∈ ℤ
61 cxpexpz ⊢ B ∈ ℂ ∧ B ≠ 0 ∧ K ∈ ℤ → B K = B K
62 61 breq2d ⊢ B ∈ ℂ ∧ B ≠ 0 ∧ K ∈ ℤ → N < B K ↔ N < B K
63 56 58 60 62 syl3anc ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ ∧ K ∈ ℤ ≥ log B N + 1 → N < B K ↔ N < B K
64 54 63 mpbid ⊢ B ∈ ℤ ≥ 2 ∧ N ∈ ℕ ∧ K ∈ ℤ ≥ log B N + 1 → N < B K