Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ltexp2a | Structured version Visualization version GIF version |
Description: Ordering relationship for exponentiation. (Contributed by NM, 2-Aug-2006.) (Revised by Mario Carneiro, 4-Jun-2014.) |
Ref | Expression |
---|---|
ltexp2a | ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → (𝐴↑𝑀) < (𝐴↑𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl1 1064 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → 𝐴 ∈ ℝ) | |
2 | 0red 10041 | . . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → 0 ∈ ℝ) | |
3 | 1red 10055 | . . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → 1 ∈ ℝ) | |
4 | 0lt1 10550 | . . . . . . . . 9 ⊢ 0 < 1 | |
5 | 4 | a1i 11 | . . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → 0 < 1) |
6 | simprl 794 | . . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → 1 < 𝐴) | |
7 | 2, 3, 1, 5, 6 | lttrd 10198 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → 0 < 𝐴) |
8 | 1, 7 | elrpd 11869 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → 𝐴 ∈ ℝ+) |
9 | simpl2 1065 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → 𝑀 ∈ ℤ) | |
10 | rpexpcl 12879 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝑀 ∈ ℤ) → (𝐴↑𝑀) ∈ ℝ+) | |
11 | 8, 9, 10 | syl2anc 693 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → (𝐴↑𝑀) ∈ ℝ+) |
12 | 11 | rpred 11872 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → (𝐴↑𝑀) ∈ ℝ) |
13 | 12 | recnd 10068 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → (𝐴↑𝑀) ∈ ℂ) |
14 | 13 | mulid2d 10058 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → (1 · (𝐴↑𝑀)) = (𝐴↑𝑀)) |
15 | simprr 796 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → 𝑀 < 𝑁) | |
16 | simpl3 1066 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → 𝑁 ∈ ℤ) | |
17 | znnsub 11423 | . . . . . . 7 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 ↔ (𝑁 − 𝑀) ∈ ℕ)) | |
18 | 9, 16, 17 | syl2anc 693 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → (𝑀 < 𝑁 ↔ (𝑁 − 𝑀) ∈ ℕ)) |
19 | 15, 18 | mpbid 222 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → (𝑁 − 𝑀) ∈ ℕ) |
20 | expgt1 12898 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ (𝑁 − 𝑀) ∈ ℕ ∧ 1 < 𝐴) → 1 < (𝐴↑(𝑁 − 𝑀))) | |
21 | 1, 19, 6, 20 | syl3anc 1326 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → 1 < (𝐴↑(𝑁 − 𝑀))) |
22 | 1 | recnd 10068 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → 𝐴 ∈ ℂ) |
23 | 7 | gt0ne0d 10592 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → 𝐴 ≠ 0) |
24 | expsub 12908 | . . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0) ∧ (𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → (𝐴↑(𝑁 − 𝑀)) = ((𝐴↑𝑁) / (𝐴↑𝑀))) | |
25 | 22, 23, 16, 9, 24 | syl22anc 1327 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → (𝐴↑(𝑁 − 𝑀)) = ((𝐴↑𝑁) / (𝐴↑𝑀))) |
26 | 21, 25 | breqtrd 4679 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → 1 < ((𝐴↑𝑁) / (𝐴↑𝑀))) |
27 | rpexpcl 12879 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝑁 ∈ ℤ) → (𝐴↑𝑁) ∈ ℝ+) | |
28 | 8, 16, 27 | syl2anc 693 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → (𝐴↑𝑁) ∈ ℝ+) |
29 | 28 | rpred 11872 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → (𝐴↑𝑁) ∈ ℝ) |
30 | 3, 29, 11 | ltmuldivd 11919 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → ((1 · (𝐴↑𝑀)) < (𝐴↑𝑁) ↔ 1 < ((𝐴↑𝑁) / (𝐴↑𝑀)))) |
31 | 26, 30 | mpbird 247 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → (1 · (𝐴↑𝑀)) < (𝐴↑𝑁)) |
32 | 14, 31 | eqbrtrrd 4677 | 1 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑀 < 𝑁)) → (𝐴↑𝑀) < (𝐴↑𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 class class class wbr 4653 (class class class)co 6650 ℂcc 9934 ℝcr 9935 0cc0 9936 1c1 9937 · cmul 9941 < clt 10074 − cmin 10266 / cdiv 10684 ℕcn 11020 ℤcz 11377 ℝ+crp 11832 ↑cexp 12860 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-n0 11293 df-z 11378 df-uz 11688 df-rp 11833 df-seq 12802 df-exp 12861 |
This theorem is referenced by: expcan 12913 ltexp2 12914 expnass 12970 perfectlem2 24955 2sqblem 25156 hgt750lemd 30726 hgt750lem 30729 2pwp1prm 41503 perfectALTVlem2 41631 tgblthelfgott 41703 tgoldbach 41705 tgblthelfgottOLD 41709 tgoldbachOLD 41712 expnegico01 42308 |
Copyright terms: Public domain | W3C validator |