| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > expcanlem | GIF version | ||
| Description: Lemma for expcan 10955. Proving the order in one direction. (Contributed by Jim Kingdon, 29-Jan-2022.) |
| Ref | Expression |
|---|---|
| expcanlem.a | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| expcanlem.m | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| expcanlem.n | ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| expcanlem.gt1 | ⊢ (𝜑 → 1 < 𝐴) |
| Ref | Expression |
|---|---|
| expcanlem | ⊢ (𝜑 → ((𝐴↑𝑀) ≤ (𝐴↑𝑁) → 𝑀 ≤ 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | expcanlem.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 2 | expcanlem.n | . . . 4 ⊢ (𝜑 → 𝑁 ∈ ℤ) | |
| 3 | expcanlem.m | . . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 4 | expcanlem.gt1 | . . . 4 ⊢ (𝜑 → 1 < 𝐴) | |
| 5 | ltexp2a 10830 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑁 < 𝑀)) → (𝐴↑𝑁) < (𝐴↑𝑀)) | |
| 6 | 5 | expr 375 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 1 < 𝐴) → (𝑁 < 𝑀 → (𝐴↑𝑁) < (𝐴↑𝑀))) |
| 7 | 1, 2, 3, 4, 6 | syl31anc 1274 | . . 3 ⊢ (𝜑 → (𝑁 < 𝑀 → (𝐴↑𝑁) < (𝐴↑𝑀))) |
| 8 | 7 | con3d 634 | . 2 ⊢ (𝜑 → (¬ (𝐴↑𝑁) < (𝐴↑𝑀) → ¬ 𝑁 < 𝑀)) |
| 9 | 0red 8163 | . . . . . 6 ⊢ (𝜑 → 0 ∈ ℝ) | |
| 10 | 1red 8177 | . . . . . 6 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 11 | 0lt1 8289 | . . . . . . 7 ⊢ 0 < 1 | |
| 12 | 11 | a1i 9 | . . . . . 6 ⊢ (𝜑 → 0 < 1) |
| 13 | 9, 10, 1, 12, 4 | lttrd 8288 | . . . . 5 ⊢ (𝜑 → 0 < 𝐴) |
| 14 | 1, 13 | gt0ap0d 8792 | . . . 4 ⊢ (𝜑 → 𝐴 # 0) |
| 15 | 1, 14, 3 | reexpclzapd 10937 | . . 3 ⊢ (𝜑 → (𝐴↑𝑀) ∈ ℝ) |
| 16 | 1, 14, 2 | reexpclzapd 10937 | . . 3 ⊢ (𝜑 → (𝐴↑𝑁) ∈ ℝ) |
| 17 | 15, 16 | lenltd 8280 | . 2 ⊢ (𝜑 → ((𝐴↑𝑀) ≤ (𝐴↑𝑁) ↔ ¬ (𝐴↑𝑁) < (𝐴↑𝑀))) |
| 18 | 3 | zred 9585 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
| 19 | 2 | zred 9585 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
| 20 | 18, 19 | lenltd 8280 | . 2 ⊢ (𝜑 → (𝑀 ≤ 𝑁 ↔ ¬ 𝑁 < 𝑀)) |
| 21 | 8, 17, 20 | 3imtr4d 203 | 1 ⊢ (𝜑 → ((𝐴↑𝑀) ≤ (𝐴↑𝑁) → 𝑀 ≤ 𝑁)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 1002 ∈ wcel 2200 class class class wbr 4083 (class class class)co 6010 ℝcr 8014 0cc0 8015 1c1 8016 < clt 8197 ≤ cle 8198 ℤcz 9462 ↑cexp 10777 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4259 ax-pr 4294 ax-un 4525 ax-setind 4630 ax-iinf 4681 ax-cnex 8106 ax-resscn 8107 ax-1cn 8108 ax-1re 8109 ax-icn 8110 ax-addcl 8111 ax-addrcl 8112 ax-mulcl 8113 ax-mulrcl 8114 ax-addcom 8115 ax-mulcom 8116 ax-addass 8117 ax-mulass 8118 ax-distr 8119 ax-i2m1 8120 ax-0lt1 8121 ax-1rid 8122 ax-0id 8123 ax-rnegex 8124 ax-precex 8125 ax-cnre 8126 ax-pre-ltirr 8127 ax-pre-ltwlin 8128 ax-pre-lttrn 8129 ax-pre-apti 8130 ax-pre-ltadd 8131 ax-pre-mulgt0 8132 ax-pre-mulext 8133 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-id 4385 df-po 4388 df-iso 4389 df-iord 4458 df-on 4460 df-ilim 4461 df-suc 4463 df-iom 4684 df-xp 4726 df-rel 4727 df-cnv 4728 df-co 4729 df-dm 4730 df-rn 4731 df-res 4732 df-ima 4733 df-iota 5281 df-fun 5323 df-fn 5324 df-f 5325 df-f1 5326 df-fo 5327 df-f1o 5328 df-fv 5329 df-riota 5963 df-ov 6013 df-oprab 6014 df-mpo 6015 df-1st 6295 df-2nd 6296 df-recs 6462 df-frec 6548 df-pnf 8199 df-mnf 8200 df-xr 8201 df-ltxr 8202 df-le 8203 df-sub 8335 df-neg 8336 df-reap 8738 df-ap 8745 df-div 8836 df-inn 9127 df-n0 9386 df-z 9463 df-uz 9739 df-rp 9867 df-seqfrec 10687 df-exp 10778 |
| This theorem is referenced by: expcan 10955 |
| Copyright terms: Public domain | W3C validator |