Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ltexp2 | Structured version Visualization version GIF version |
Description: Ordering law for exponentiation. (Contributed by NM, 2-Aug-2006.) (Revised by Mario Carneiro, 5-Jun-2014.) |
Ref | Expression |
---|---|
ltexp2 | ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 1 < 𝐴) → (𝑀 < 𝑁 ↔ (𝐴↑𝑀) < (𝐴↑𝑁))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oveq2 7153 | . . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐴↑𝑥) = (𝐴↑𝑦)) | |
2 | oveq2 7153 | . . . . . 6 ⊢ (𝑥 = 𝑀 → (𝐴↑𝑥) = (𝐴↑𝑀)) | |
3 | oveq2 7153 | . . . . . 6 ⊢ (𝑥 = 𝑁 → (𝐴↑𝑥) = (𝐴↑𝑁)) | |
4 | zssre 11976 | . . . . . 6 ⊢ ℤ ⊆ ℝ | |
5 | simpl 483 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 1 < 𝐴) → 𝐴 ∈ ℝ) | |
6 | 0red 10632 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 1 < 𝐴) → 0 ∈ ℝ) | |
7 | 1red 10630 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 1 < 𝐴) → 1 ∈ ℝ) | |
8 | 0lt1 11150 | . . . . . . . . . . 11 ⊢ 0 < 1 | |
9 | 8 | a1i 11 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 1 < 𝐴) → 0 < 1) |
10 | simpr 485 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 1 < 𝐴) → 1 < 𝐴) | |
11 | 6, 7, 5, 9, 10 | lttrd 10789 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 1 < 𝐴) → 0 < 𝐴) |
12 | 5, 11 | elrpd 12416 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 1 < 𝐴) → 𝐴 ∈ ℝ+) |
13 | rpexpcl 13436 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝑥 ∈ ℤ) → (𝐴↑𝑥) ∈ ℝ+) | |
14 | 12, 13 | sylan 580 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 1 < 𝐴) ∧ 𝑥 ∈ ℤ) → (𝐴↑𝑥) ∈ ℝ+) |
15 | 14 | rpred 12419 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 1 < 𝐴) ∧ 𝑥 ∈ ℤ) → (𝐴↑𝑥) ∈ ℝ) |
16 | simpll 763 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 1 < 𝐴) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → 𝐴 ∈ ℝ) | |
17 | simprl 767 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 1 < 𝐴) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → 𝑥 ∈ ℤ) | |
18 | simprr 769 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 1 < 𝐴) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → 𝑦 ∈ ℤ) | |
19 | simplr 765 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 1 < 𝐴) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → 1 < 𝐴) | |
20 | ltexp2a 13518 | . . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑥 < 𝑦)) → (𝐴↑𝑥) < (𝐴↑𝑦)) | |
21 | 20 | expr 457 | . . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ) ∧ 1 < 𝐴) → (𝑥 < 𝑦 → (𝐴↑𝑥) < (𝐴↑𝑦))) |
22 | 16, 17, 18, 19, 21 | syl31anc 1365 | . . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 1 < 𝐴) ∧ (𝑥 ∈ ℤ ∧ 𝑦 ∈ ℤ)) → (𝑥 < 𝑦 → (𝐴↑𝑥) < (𝐴↑𝑦))) |
23 | 1, 2, 3, 4, 15, 22 | ltord1 11154 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 1 < 𝐴) ∧ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ)) → (𝑀 < 𝑁 ↔ (𝐴↑𝑀) < (𝐴↑𝑁))) |
24 | 23 | ancom2s 646 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 1 < 𝐴) ∧ (𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ)) → (𝑀 < 𝑁 ↔ (𝐴↑𝑀) < (𝐴↑𝑁))) |
25 | 24 | exp43 437 | . . 3 ⊢ (𝐴 ∈ ℝ → (1 < 𝐴 → (𝑁 ∈ ℤ → (𝑀 ∈ ℤ → (𝑀 < 𝑁 ↔ (𝐴↑𝑀) < (𝐴↑𝑁)))))) |
26 | 25 | com24 95 | . 2 ⊢ (𝐴 ∈ ℝ → (𝑀 ∈ ℤ → (𝑁 ∈ ℤ → (1 < 𝐴 → (𝑀 < 𝑁 ↔ (𝐴↑𝑀) < (𝐴↑𝑁)))))) |
27 | 26 | 3imp1 1339 | 1 ⊢ (((𝐴 ∈ ℝ ∧ 𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) ∧ 1 < 𝐴) → (𝑀 < 𝑁 ↔ (𝐴↑𝑀) < (𝐴↑𝑁))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1079 ∈ wcel 2105 class class class wbr 5057 (class class class)co 7145 ℝcr 10524 0cc0 10525 1c1 10526 < clt 10663 ℤcz 11969 ℝ+crp 12377 ↑cexp 13417 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-er 8278 df-en 8498 df-dom 8499 df-sdom 8500 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-div 11286 df-nn 11627 df-n0 11886 df-z 11970 df-uz 12232 df-rp 12378 df-seq 13358 df-exp 13418 |
This theorem is referenced by: leexp2 13523 ltexp2r 13525 ltexp2d 13602 |
Copyright terms: Public domain | W3C validator |