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. (Contributed by NM, 14-Dec-2005.) (Revised by Mario Carneiro, 5-Jun-2014.) |
Ref | Expression |
---|---|
leexp2a | ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝐴↑𝑀) ≤ (𝐴↑𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp1 1135 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝐴 ∈ ℝ) | |
2 | 0red 11079 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 0 ∈ ℝ) | |
3 | 1red 11077 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 1 ∈ ℝ) | |
4 | 0lt1 11598 | . . . . . . . . 9 ⊢ 0 < 1 | |
5 | 4 | a1i 11 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 0 < 1) |
6 | simp2 1136 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 1 ≤ 𝐴) | |
7 | 2, 3, 1, 5, 6 | ltletrd 11236 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 0 < 𝐴) |
8 | 1, 7 | elrpd 12870 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝐴 ∈ ℝ+) |
9 | eluzel2 12688 | . . . . . . 7 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑀 ∈ ℤ) | |
10 | 9 | 3ad2ant3 1134 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝑀 ∈ ℤ) |
11 | rpexpcl 13902 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝑀 ∈ ℤ) → (𝐴↑𝑀) ∈ ℝ+) | |
12 | 8, 10, 11 | syl2anc 584 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝐴↑𝑀) ∈ ℝ+) |
13 | 12 | rpred 12873 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝐴↑𝑀) ∈ ℝ) |
14 | 13 | recnd 11104 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝐴↑𝑀) ∈ ℂ) |
15 | 14 | mulid2d 11094 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (1 · (𝐴↑𝑀)) = (𝐴↑𝑀)) |
16 | uznn0sub 12718 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 − 𝑀) ∈ ℕ0) | |
17 | 16 | 3ad2ant3 1134 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝑁 − 𝑀) ∈ ℕ0) |
18 | expge1 13921 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ (𝑁 − 𝑀) ∈ ℕ0 ∧ 1 ≤ 𝐴) → 1 ≤ (𝐴↑(𝑁 − 𝑀))) | |
19 | 1, 17, 6, 18 | syl3anc 1370 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 1 ≤ (𝐴↑(𝑁 − 𝑀))) |
20 | 1 | recnd 11104 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝐴 ∈ ℂ) |
21 | 7 | gt0ne0d 11640 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝐴 ≠ 0) |
22 | eluzelz 12693 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℤ) | |
23 | 22 | 3ad2ant3 1134 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 𝑁 ∈ ℤ) |
24 | expsub 13932 | . . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ (𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → (𝐴↑(𝑁 − 𝑀)) = ((𝐴↑𝑁) / (𝐴↑𝑀))) | |
25 | 20, 21, 23, 10, 24 | syl22anc 836 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝐴↑(𝑁 − 𝑀)) = ((𝐴↑𝑁) / (𝐴↑𝑀))) |
26 | 19, 25 | breqtrd 5118 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → 1 ≤ ((𝐴↑𝑁) / (𝐴↑𝑀))) |
27 | rpexpcl 13902 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ ℝ+) | |
28 | 8, 23, 27 | syl2anc 584 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝐴↑𝑁) ∈ ℝ+) |
29 | 28 | rpred 12873 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝐴↑𝑁) ∈ ℝ) |
30 | 3, 29, 12 | lemuldivd 12922 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → ((1 · (𝐴↑𝑀)) ≤ (𝐴↑𝑁) ↔ 1 ≤ ((𝐴↑𝑁) / (𝐴↑𝑀)))) |
31 | 26, 30 | mpbird 256 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (1 · (𝐴↑𝑀)) ≤ (𝐴↑𝑁)) |
32 | 15, 31 | eqbrtrrd 5116 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 1 ≤ 𝐴 ∧ 𝑁 ∈ (ℤ≥‘𝑀)) → (𝐴↑𝑀) ≤ (𝐴↑𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1540 ∈ wcel 2105 ≠ wne 2940 class class class wbr 5092 ‘cfv 6479 (class class class)co 7337 ℂcc 10970 ℝcr 10971 0cc0 10972 1c1 10973 · cmul 10977 < clt 11110 ≤ cle 11111 − cmin 11306 / cdiv 11733 ℕ0cn0 12334 ℤcz 12420 ℤ≥cuz 12683 ℝ+crp 12831 ↑cexp 13883 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2707 ax-sep 5243 ax-nul 5250 ax-pow 5308 ax-pr 5372 ax-un 7650 ax-cnex 11028 ax-resscn 11029 ax-1cn 11030 ax-icn 11031 ax-addcl 11032 ax-addrcl 11033 ax-mulcl 11034 ax-mulrcl 11035 ax-mulcom 11036 ax-addass 11037 ax-mulass 11038 ax-distr 11039 ax-i2m1 11040 ax-1ne0 11041 ax-1rid 11042 ax-rnegex 11043 ax-rrecex 11044 ax-cnre 11045 ax-pre-lttri 11046 ax-pre-lttrn 11047 ax-pre-ltadd 11048 ax-pre-mulgt0 11049 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3349 df-reu 3350 df-rab 3404 df-v 3443 df-sbc 3728 df-csb 3844 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3917 df-nul 4270 df-if 4474 df-pw 4549 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4853 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5176 df-tr 5210 df-id 5518 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5575 df-we 5577 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6238 df-ord 6305 df-on 6306 df-lim 6307 df-suc 6308 df-iota 6431 df-fun 6481 df-fn 6482 df-f 6483 df-f1 6484 df-fo 6485 df-f1o 6486 df-fv 6487 df-riota 7293 df-ov 7340 df-oprab 7341 df-mpo 7342 df-om 7781 df-2nd 7900 df-frecs 8167 df-wrecs 8198 df-recs 8272 df-rdg 8311 df-er 8569 df-en 8805 df-dom 8806 df-sdom 8807 df-pnf 11112 df-mnf 11113 df-xr 11114 df-ltxr 11115 df-le 11116 df-sub 11308 df-neg 11309 df-div 11734 df-nn 12075 df-n0 12335 df-z 12421 df-uz 12684 df-rp 12832 df-seq 13823 df-exp 13884 |
This theorem is referenced by: expnlbnd2 14050 digit1 14053 leexp2ad 14072 faclbnd4lem1 14108 climcndslem1 15660 climcndslem2 15661 ef01bndlem 15992 aaliou3lem2 25609 ackval42 46401 |
Copyright terms: Public domain | W3C validator |