| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > leexp2a | Structured version Visualization version GIF version | ||
| Description: Weak ordering relationship for exponentiation of a fixed real base greater than or equal to 1 to integer exponents. (Contributed by NM, 14-Dec-2005.) (Revised by Mario Carneiro, 5-Jun-2014.) |
| Ref | Expression |
|---|---|
| leexp2a | ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝐴↑𝑀) ≤ (𝐴↑𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1137 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝐴 ∈ ℝ) | |
| 2 | 0red 11147 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 0 ∈ ℝ) | |
| 3 | 1red 11145 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 1 ∈ ℝ) | |
| 4 | 0lt1 11672 | . . . . . . . . 9 ⊢ 0 < 1 | |
| 5 | 4 | a1i 11 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 0 < 1) |
| 6 | simp2 1138 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 1 ≤ 𝐴) | |
| 7 | 2, 3, 1, 5, 6 | ltletrd 11306 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 0 < 𝐴) |
| 8 | 1, 7 | elrpd 12983 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝐴 ∈ ℝ+) |
| 9 | eluzel2 12793 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
| 10 | 9 | 3ad2ant3 1136 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝑀 ∈ ℤ) |
| 11 | rpexpcl 14042 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝑀 ∈ ℤ) → (𝐴↑𝑀) ∈ ℝ+) | |
| 12 | 8, 10, 11 | syl2anc 585 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝐴↑𝑀) ∈ ℝ+) |
| 13 | 12 | rpred 12986 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝐴↑𝑀) ∈ ℝ) |
| 14 | 13 | recnd 11173 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝐴↑𝑀) ∈ ℂ) |
| 15 | 14 | mullidd 11163 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (1 · (𝐴↑𝑀)) = (𝐴↑𝑀)) |
| 16 | uznn0sub 12823 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 − 𝑀) ∈ ℕ0) | |
| 17 | 16 | 3ad2ant3 1136 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝑁 − 𝑀) ∈ ℕ0) |
| 18 | expge1 14061 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ (𝑁 − 𝑀) ∈ ℕ0 ∧ 1 ≤ 𝐴) → 1 ≤ (𝐴↑(𝑁 − 𝑀))) | |
| 19 | 1, 17, 6, 18 | syl3anc 1374 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 1 ≤ (𝐴↑(𝑁 − 𝑀))) |
| 20 | 1 | recnd 11173 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝐴 ∈ ℂ) |
| 21 | 7 | gt0ne0d 11714 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝐴 ≠ 0) |
| 22 | eluzelz 12798 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
| 23 | 22 | 3ad2ant3 1136 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝑁 ∈ ℤ) |
| 24 | expsub 14072 | . . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ (𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → (𝐴↑(𝑁 − 𝑀)) = ((𝐴↑𝑁) / (𝐴↑𝑀))) | |
| 25 | 20, 21, 23, 10, 24 | syl22anc 839 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝐴↑(𝑁 − 𝑀)) = ((𝐴↑𝑁) / (𝐴↑𝑀))) |
| 26 | 19, 25 | breqtrd 5111 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 1 ≤ ((𝐴↑𝑁) / (𝐴↑𝑀))) |
| 27 | rpexpcl 14042 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ ℝ+) | |
| 28 | 8, 23, 27 | syl2anc 585 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝐴↑𝑁) ∈ ℝ+) |
| 29 | 28 | rpred 12986 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝐴↑𝑁) ∈ ℝ) |
| 30 | 3, 29, 12 | lemuldivd 13035 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → ((1 · (𝐴↑𝑀)) ≤ (𝐴↑𝑁) ↔ 1 ≤ ((𝐴↑𝑁) / (𝐴↑𝑀)))) |
| 31 | 26, 30 | mpbird 257 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (1 · (𝐴↑𝑀)) ≤ (𝐴↑𝑁)) |
| 32 | 15, 31 | eqbrtrrd 5109 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝐴↑𝑀) ≤ (𝐴↑𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2932 class class class wbr 5085 ‘cfv 6498 (class class class)co 7367 ℂcc 11036 ℝcr 11037 0cc0 11038 1c1 11039 · cmul 11043 < clt 11179 ≤ cle 11180 − cmin 11377 / cdiv 11807 ℕ0cn0 12437 ℤcz 12524 ℤ≥cuz 12788 ℝ+crp 12942 ↑cexp 14023 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-n0 12438 df-z 12525 df-uz 12789 df-rp 12943 df-seq 13964 df-exp 14024 |
| This theorem is referenced by: expnlbnd2 14196 digit1 14199 leexp2ad 14216 faclbnd4lem1 14255 climcndslem1 15814 climcndslem2 15815 ef01bndlem 16151 aaliou3lem2 26309 ackval42 49172 |
| Copyright terms: Public domain | W3C validator |