Mathbox for Thierry Arnoux < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  nexple Structured version   Visualization version   GIF version

Theorem nexple 30411
 Description: A lower bound for an exponentiation. (Contributed by Thierry Arnoux, 19-Aug-2017.)
Assertion
Ref Expression
nexple ((𝐴 ∈ ℕ0𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 𝐴 ≤ (𝐵𝐴))

Proof of Theorem nexple
Dummy variables 𝑘 𝑛 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 471 . . 3 (((𝐴 ∈ ℕ0𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝐴 ∈ ℕ) → 𝐴 ∈ ℕ)
2 simpl2 1229 . . 3 (((𝐴 ∈ ℕ0𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝐴 ∈ ℕ) → 𝐵 ∈ ℝ)
3 simpl3 1231 . . 3 (((𝐴 ∈ ℕ0𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝐴 ∈ ℕ) → 2 ≤ 𝐵)
4 id 22 . . . . . . 7 (𝑘 = 1 → 𝑘 = 1)
5 oveq2 6801 . . . . . . 7 (𝑘 = 1 → (𝐵𝑘) = (𝐵↑1))
64, 5breq12d 4799 . . . . . 6 (𝑘 = 1 → (𝑘 ≤ (𝐵𝑘) ↔ 1 ≤ (𝐵↑1)))
76imbi2d 329 . . . . 5 (𝑘 = 1 → (((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 𝑘 ≤ (𝐵𝑘)) ↔ ((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 1 ≤ (𝐵↑1))))
8 id 22 . . . . . . 7 (𝑘 = 𝑛𝑘 = 𝑛)
9 oveq2 6801 . . . . . . 7 (𝑘 = 𝑛 → (𝐵𝑘) = (𝐵𝑛))
108, 9breq12d 4799 . . . . . 6 (𝑘 = 𝑛 → (𝑘 ≤ (𝐵𝑘) ↔ 𝑛 ≤ (𝐵𝑛)))
1110imbi2d 329 . . . . 5 (𝑘 = 𝑛 → (((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 𝑘 ≤ (𝐵𝑘)) ↔ ((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 𝑛 ≤ (𝐵𝑛))))
12 id 22 . . . . . . 7 (𝑘 = (𝑛 + 1) → 𝑘 = (𝑛 + 1))
13 oveq2 6801 . . . . . . 7 (𝑘 = (𝑛 + 1) → (𝐵𝑘) = (𝐵↑(𝑛 + 1)))
1412, 13breq12d 4799 . . . . . 6 (𝑘 = (𝑛 + 1) → (𝑘 ≤ (𝐵𝑘) ↔ (𝑛 + 1) ≤ (𝐵↑(𝑛 + 1))))
1514imbi2d 329 . . . . 5 (𝑘 = (𝑛 + 1) → (((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 𝑘 ≤ (𝐵𝑘)) ↔ ((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → (𝑛 + 1) ≤ (𝐵↑(𝑛 + 1)))))
16 id 22 . . . . . . 7 (𝑘 = 𝐴𝑘 = 𝐴)
17 oveq2 6801 . . . . . . 7 (𝑘 = 𝐴 → (𝐵𝑘) = (𝐵𝐴))
1816, 17breq12d 4799 . . . . . 6 (𝑘 = 𝐴 → (𝑘 ≤ (𝐵𝑘) ↔ 𝐴 ≤ (𝐵𝐴)))
1918imbi2d 329 . . . . 5 (𝑘 = 𝐴 → (((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 𝑘 ≤ (𝐵𝑘)) ↔ ((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 𝐴 ≤ (𝐵𝐴))))
20 simpl 468 . . . . . 6 ((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 𝐵 ∈ ℝ)
21 1nn0 11510 . . . . . . 7 1 ∈ ℕ0
2221a1i 11 . . . . . 6 ((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 1 ∈ ℕ0)
23 1red 10257 . . . . . . 7 ((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 1 ∈ ℝ)
24 2re 11292 . . . . . . . 8 2 ∈ ℝ
2524a1i 11 . . . . . . 7 ((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 2 ∈ ℝ)
26 1le2 11443 . . . . . . . 8 1 ≤ 2
2726a1i 11 . . . . . . 7 ((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 1 ≤ 2)
28 simpr 471 . . . . . . 7 ((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 2 ≤ 𝐵)
2923, 25, 20, 27, 28letrd 10396 . . . . . 6 ((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 1 ≤ 𝐵)
3020, 22, 29expge1d 13234 . . . . 5 ((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 1 ≤ (𝐵↑1))
31 simp1 1130 . . . . . . . . . . . 12 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → 𝑛 ∈ ℕ)
3231nnnn0d 11553 . . . . . . . . . . 11 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → 𝑛 ∈ ℕ0)
3332nn0red 11554 . . . . . . . . . 10 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → 𝑛 ∈ ℝ)
34 1red 10257 . . . . . . . . . 10 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → 1 ∈ ℝ)
3533, 34readdcld 10271 . . . . . . . . 9 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → (𝑛 + 1) ∈ ℝ)
36203ad2ant2 1128 . . . . . . . . . 10 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → 𝐵 ∈ ℝ)
3733, 36remulcld 10272 . . . . . . . . 9 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → (𝑛 · 𝐵) ∈ ℝ)
3836, 32reexpcld 13232 . . . . . . . . . 10 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → (𝐵𝑛) ∈ ℝ)
3938, 36remulcld 10272 . . . . . . . . 9 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → ((𝐵𝑛) · 𝐵) ∈ ℝ)
4024a1i 11 . . . . . . . . . . 11 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → 2 ∈ ℝ)
4133, 40remulcld 10272 . . . . . . . . . 10 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → (𝑛 · 2) ∈ ℝ)
4231nnge1d 11265 . . . . . . . . . . . 12 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → 1 ≤ 𝑛)
4334, 33, 33, 42leadd2dd 10844 . . . . . . . . . . 11 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → (𝑛 + 1) ≤ (𝑛 + 𝑛))
4433recnd 10270 . . . . . . . . . . . 12 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → 𝑛 ∈ ℂ)
4544times2d 11478 . . . . . . . . . . 11 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → (𝑛 · 2) = (𝑛 + 𝑛))
4643, 45breqtrrd 4814 . . . . . . . . . 10 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → (𝑛 + 1) ≤ (𝑛 · 2))
4732nn0ge0d 11556 . . . . . . . . . . 11 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → 0 ≤ 𝑛)
48 simp2r 1242 . . . . . . . . . . 11 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → 2 ≤ 𝐵)
4940, 36, 33, 47, 48lemul2ad 11166 . . . . . . . . . 10 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → (𝑛 · 2) ≤ (𝑛 · 𝐵))
5035, 41, 37, 46, 49letrd 10396 . . . . . . . . 9 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → (𝑛 + 1) ≤ (𝑛 · 𝐵))
51 0red 10243 . . . . . . . . . . . 12 ((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 0 ∈ ℝ)
52 0le2 11313 . . . . . . . . . . . . 13 0 ≤ 2
5352a1i 11 . . . . . . . . . . . 12 ((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 0 ≤ 2)
5451, 25, 20, 53, 28letrd 10396 . . . . . . . . . . 11 ((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 0 ≤ 𝐵)
55543ad2ant2 1128 . . . . . . . . . 10 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → 0 ≤ 𝐵)
56 simp3 1132 . . . . . . . . . 10 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → 𝑛 ≤ (𝐵𝑛))
5733, 38, 36, 55, 56lemul1ad 11165 . . . . . . . . 9 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → (𝑛 · 𝐵) ≤ ((𝐵𝑛) · 𝐵))
5835, 37, 39, 50, 57letrd 10396 . . . . . . . 8 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → (𝑛 + 1) ≤ ((𝐵𝑛) · 𝐵))
5936recnd 10270 . . . . . . . . 9 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → 𝐵 ∈ ℂ)
6059, 32expp1d 13216 . . . . . . . 8 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → (𝐵↑(𝑛 + 1)) = ((𝐵𝑛) · 𝐵))
6158, 60breqtrrd 4814 . . . . . . 7 ((𝑛 ∈ ℕ ∧ (𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝑛 ≤ (𝐵𝑛)) → (𝑛 + 1) ≤ (𝐵↑(𝑛 + 1)))
62613exp 1112 . . . . . 6 (𝑛 ∈ ℕ → ((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → (𝑛 ≤ (𝐵𝑛) → (𝑛 + 1) ≤ (𝐵↑(𝑛 + 1)))))
6362a2d 29 . . . . 5 (𝑛 ∈ ℕ → (((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 𝑛 ≤ (𝐵𝑛)) → ((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → (𝑛 + 1) ≤ (𝐵↑(𝑛 + 1)))))
647, 11, 15, 19, 30, 63nnind 11240 . . . 4 (𝐴 ∈ ℕ → ((𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 𝐴 ≤ (𝐵𝐴)))
65643impib 1108 . . 3 ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 𝐴 ≤ (𝐵𝐴))
661, 2, 3, 65syl3anc 1476 . 2 (((𝐴 ∈ ℕ0𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝐴 ∈ ℕ) → 𝐴 ≤ (𝐵𝐴))
67 0le1 10753 . . . 4 0 ≤ 1
6867a1i 11 . . 3 (((𝐴 ∈ ℕ0𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝐴 = 0) → 0 ≤ 1)
69 simpr 471 . . 3 (((𝐴 ∈ ℕ0𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝐴 = 0) → 𝐴 = 0)
7069oveq2d 6809 . . . 4 (((𝐴 ∈ ℕ0𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝐴 = 0) → (𝐵𝐴) = (𝐵↑0))
71 simpl2 1229 . . . . . 6 (((𝐴 ∈ ℕ0𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝐴 = 0) → 𝐵 ∈ ℝ)
7271recnd 10270 . . . . 5 (((𝐴 ∈ ℕ0𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝐴 = 0) → 𝐵 ∈ ℂ)
7372exp0d 13209 . . . 4 (((𝐴 ∈ ℕ0𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝐴 = 0) → (𝐵↑0) = 1)
7470, 73eqtrd 2805 . . 3 (((𝐴 ∈ ℕ0𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝐴 = 0) → (𝐵𝐴) = 1)
7568, 69, 743brtr4d 4818 . 2 (((𝐴 ∈ ℕ0𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) ∧ 𝐴 = 0) → 𝐴 ≤ (𝐵𝐴))
76 elnn0 11496 . . . 4 (𝐴 ∈ ℕ0 ↔ (𝐴 ∈ ℕ ∨ 𝐴 = 0))
7776biimpi 206 . . 3 (𝐴 ∈ ℕ0 → (𝐴 ∈ ℕ ∨ 𝐴 = 0))
78773ad2ant1 1127 . 2 ((𝐴 ∈ ℕ0𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → (𝐴 ∈ ℕ ∨ 𝐴 = 0))
7966, 75, 78mpjaodan 943 1 ((𝐴 ∈ ℕ0𝐵 ∈ ℝ ∧ 2 ≤ 𝐵) → 𝐴 ≤ (𝐵𝐴))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 382   ∨ wo 836   ∧ w3a 1071   = wceq 1631   ∈ wcel 2145   class class class wbr 4786  (class class class)co 6793  ℝcr 10137  0cc0 10138  1c1 10139   + caddc 10141   · cmul 10143   ≤ cle 10277  ℕcn 11222  2c2 11272  ℕ0cn0 11494  ↑cexp 13067 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-8 2147  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751  ax-sep 4915  ax-nul 4923  ax-pow 4974  ax-pr 5034  ax-un 7096  ax-cnex 10194  ax-resscn 10195  ax-1cn 10196  ax-icn 10197  ax-addcl 10198  ax-addrcl 10199  ax-mulcl 10200  ax-mulrcl 10201  ax-mulcom 10202  ax-addass 10203  ax-mulass 10204  ax-distr 10205  ax-i2m1 10206  ax-1ne0 10207  ax-1rid 10208  ax-rnegex 10209  ax-rrecex 10210  ax-cnre 10211  ax-pre-lttri 10212  ax-pre-lttrn 10213  ax-pre-ltadd 10214  ax-pre-mulgt0 10215 This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-3or 1072  df-3an 1073  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-eu 2622  df-mo 2623  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ne 2944  df-nel 3047  df-ral 3066  df-rex 3067  df-reu 3068  df-rab 3070  df-v 3353  df-sbc 3588  df-csb 3683  df-dif 3726  df-un 3728  df-in 3730  df-ss 3737  df-pss 3739  df-nul 4064  df-if 4226  df-pw 4299  df-sn 4317  df-pr 4319  df-tp 4321  df-op 4323  df-uni 4575  df-iun 4656  df-br 4787  df-opab 4847  df-mpt 4864  df-tr 4887  df-id 5157  df-eprel 5162  df-po 5170  df-so 5171  df-fr 5208  df-we 5210  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-rn 5260  df-res 5261  df-ima 5262  df-pred 5823  df-ord 5869  df-on 5870  df-lim 5871  df-suc 5872  df-iota 5994  df-fun 6033  df-fn 6034  df-f 6035  df-f1 6036  df-fo 6037  df-f1o 6038  df-fv 6039  df-riota 6754  df-ov 6796  df-oprab 6797  df-mpt2 6798  df-om 7213  df-2nd 7316  df-wrecs 7559  df-recs 7621  df-rdg 7659  df-er 7896  df-en 8110  df-dom 8111  df-sdom 8112  df-pnf 10278  df-mnf 10279  df-xr 10280  df-ltxr 10281  df-le 10282  df-sub 10470  df-neg 10471  df-nn 11223  df-2 11281  df-n0 11495  df-z 11580  df-uz 11889  df-seq 13009  df-exp 13068 This theorem is referenced by:  oddpwdc  30756
 Copyright terms: Public domain W3C validator