![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > rpexpmord | Structured version Visualization version GIF version |
Description: Mantissa ordering relationship for exponentiation of positive reals. (Contributed by Stefan O'Rear, 16-Oct-2014.) |
Ref | Expression |
---|---|
rpexpmord | ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → (𝐴 < 𝐵 ↔ (𝐴↑𝑁) < (𝐵↑𝑁))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oveq1 7142 | . . 3 ⊢ (𝑎 = 𝑏 → (𝑎↑𝑁) = (𝑏↑𝑁)) | |
2 | oveq1 7142 | . . 3 ⊢ (𝑎 = 𝐴 → (𝑎↑𝑁) = (𝐴↑𝑁)) | |
3 | oveq1 7142 | . . 3 ⊢ (𝑎 = 𝐵 → (𝑎↑𝑁) = (𝐵↑𝑁)) | |
4 | rpssre 12384 | . . 3 ⊢ ℝ+ ⊆ ℝ | |
5 | rpre 12385 | . . . 4 ⊢ (𝑎 ∈ ℝ+ → 𝑎 ∈ ℝ) | |
6 | nnnn0 11892 | . . . 4 ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℕ0) | |
7 | reexpcl 13442 | . . . 4 ⊢ ((𝑎 ∈ ℝ ∧ 𝑁 ∈ ℕ0) → (𝑎↑𝑁) ∈ ℝ) | |
8 | 5, 6, 7 | syl2anr 599 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ 𝑎 ∈ ℝ+) → (𝑎↑𝑁) ∈ ℝ) |
9 | simplrl 776 | . . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ (𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+)) ∧ 𝑎 < 𝑏) → 𝑎 ∈ ℝ+) | |
10 | 9 | rpred 12419 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ (𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+)) ∧ 𝑎 < 𝑏) → 𝑎 ∈ ℝ) |
11 | simplrr 777 | . . . . . 6 ⊢ (((𝑁 ∈ ℕ ∧ (𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+)) ∧ 𝑎 < 𝑏) → 𝑏 ∈ ℝ+) | |
12 | 11 | rpred 12419 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ (𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+)) ∧ 𝑎 < 𝑏) → 𝑏 ∈ ℝ) |
13 | 9 | rpge0d 12423 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ (𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+)) ∧ 𝑎 < 𝑏) → 0 ≤ 𝑎) |
14 | simpr 488 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ (𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+)) ∧ 𝑎 < 𝑏) → 𝑎 < 𝑏) | |
15 | simpll 766 | . . . . 5 ⊢ (((𝑁 ∈ ℕ ∧ (𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+)) ∧ 𝑎 < 𝑏) → 𝑁 ∈ ℕ) | |
16 | expmordi 13527 | . . . . 5 ⊢ (((𝑎 ∈ ℝ ∧ 𝑏 ∈ ℝ) ∧ (0 ≤ 𝑎 ∧ 𝑎 < 𝑏) ∧ 𝑁 ∈ ℕ) → (𝑎↑𝑁) < (𝑏↑𝑁)) | |
17 | 10, 12, 13, 14, 15, 16 | syl221anc 1378 | . . . 4 ⊢ (((𝑁 ∈ ℕ ∧ (𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+)) ∧ 𝑎 < 𝑏) → (𝑎↑𝑁) < (𝑏↑𝑁)) |
18 | 17 | ex 416 | . . 3 ⊢ ((𝑁 ∈ ℕ ∧ (𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+)) → (𝑎 < 𝑏 → (𝑎↑𝑁) < (𝑏↑𝑁))) |
19 | 1, 2, 3, 4, 8, 18 | ltord1 11155 | . 2 ⊢ ((𝑁 ∈ ℕ ∧ (𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+)) → (𝐴 < 𝐵 ↔ (𝐴↑𝑁) < (𝐵↑𝑁))) |
20 | 19 | 3impb 1112 | 1 ⊢ ((𝑁 ∈ ℕ ∧ 𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → (𝐴 < 𝐵 ↔ (𝐴↑𝑁) < (𝐵↑𝑁))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1084 ∈ wcel 2111 class class class wbr 5030 (class class class)co 7135 ℝcr 10525 0cc0 10526 < clt 10664 ≤ cle 10665 ℕcn 11625 ℕ0cn0 11885 ℝ+crp 12377 ↑cexp 13425 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-n0 11886 df-z 11970 df-uz 12232 df-rp 12378 df-seq 13365 df-exp 13426 |
This theorem is referenced by: ltexp1d 39498 jm3.1lem1 39958 |
Copyright terms: Public domain | W3C validator |