| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > expcanlem | GIF version | ||
| Description: Lemma for expcan 11086. 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 10960 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑁 < 𝑀)) → (𝐴↑𝑁) < (𝐴↑𝑀)) | |
| 6 | 5 | expr 375 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 1 < 𝐴) → (𝑁 < 𝑀 → (𝐴↑𝑁) < (𝐴↑𝑀))) |
| 7 | 1, 2, 3, 4, 6 | syl31anc 1277 | . . 3 ⊢ (𝜑 → (𝑁 < 𝑀 → (𝐴↑𝑁) < (𝐴↑𝑀))) |
| 8 | 7 | con3d 636 | . 2 ⊢ (𝜑 → (¬ (𝐴↑𝑁) < (𝐴↑𝑀) → ¬ 𝑁 < 𝑀)) |
| 9 | 0red 8280 | . . . . . 6 ⊢ (𝜑 → 0 ∈ ℝ) | |
| 10 | 1red 8294 | . . . . . 6 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 11 | 0lt1 8405 | . . . . . . 7 ⊢ 0 < 1 | |
| 12 | 11 | a1i 9 | . . . . . 6 ⊢ (𝜑 → 0 < 1) |
| 13 | 9, 10, 1, 12, 4 | lttrd 8404 | . . . . 5 ⊢ (𝜑 → 0 < 𝐴) |
| 14 | 1, 13 | gt0ap0d 8908 | . . . 4 ⊢ (𝜑 → 𝐴 # 0) |
| 15 | 1, 14, 3 | reexpclzapd 11068 | . . 3 ⊢ (𝜑 → (𝐴↑𝑀) ∈ ℝ) |
| 16 | 1, 14, 2 | reexpclzapd 11068 | . . 3 ⊢ (𝜑 → (𝐴↑𝑁) ∈ ℝ) |
| 17 | 15, 16 | lenltd 8396 | . 2 ⊢ (𝜑 → ((𝐴↑𝑀) ≤ (𝐴↑𝑁) ↔ ¬ (𝐴↑𝑁) < (𝐴↑𝑀))) |
| 18 | 3 | zred 9706 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
| 19 | 2 | zred 9706 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
| 20 | 18, 19 | lenltd 8396 | . 2 ⊢ (𝜑 → (𝑀 ≤ 𝑁 ↔ ¬ 𝑁 < 𝑀)) |
| 21 | 8, 17, 20 | 3imtr4d 203 | 1 ⊢ (𝜑 → ((𝐴↑𝑀) ≤ (𝐴↑𝑁) → 𝑀 ≤ 𝑁)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 1005 ∈ wcel 2205 class class class wbr 4111 (class class class)co 6052 ℝcr 8131 0cc0 8132 1c1 8133 < clt 8313 ≤ cle 8314 ℤcz 9582 ↑cexp 10907 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4227 ax-sep 4230 ax-nul 4238 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-iinf 4712 ax-cnex 8223 ax-resscn 8224 ax-1cn 8225 ax-1re 8226 ax-icn 8227 ax-addcl 8228 ax-addrcl 8229 ax-mulcl 8230 ax-mulrcl 8231 ax-addcom 8232 ax-mulcom 8233 ax-addass 8234 ax-mulass 8235 ax-distr 8236 ax-i2m1 8237 ax-0lt1 8238 ax-1rid 8239 ax-0id 8240 ax-rnegex 8241 ax-precex 8242 ax-cnre 8243 ax-pre-ltirr 8244 ax-pre-ltwlin 8245 ax-pre-lttrn 8246 ax-pre-apti 8247 ax-pre-ltadd 8248 ax-pre-mulgt0 8249 ax-pre-mulext 8250 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3045 df-csb 3141 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-nul 3511 df-if 3623 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-iun 3995 df-br 4112 df-opab 4174 df-mpt 4175 df-tr 4211 df-id 4416 df-po 4419 df-iso 4420 df-iord 4489 df-on 4491 df-ilim 4492 df-suc 4494 df-iom 4715 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-f1 5359 df-fo 5360 df-f1o 5361 df-fv 5362 df-riota 6005 df-ov 6055 df-oprab 6056 df-mpo 6057 df-1st 6336 df-2nd 6337 df-recs 6538 df-frec 6624 df-pnf 8315 df-mnf 8316 df-xr 8317 df-ltxr 8318 df-le 8319 df-sub 8451 df-neg 8452 df-reap 8854 df-ap 8861 df-div 8952 df-inn 9243 df-n0 9502 df-z 9583 df-uz 9860 df-rp 9993 df-seqfrec 10817 df-exp 10908 |
| This theorem is referenced by: expcan 11086 |
| Copyright terms: Public domain | W3C validator |