| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > expcanlem | GIF version | ||
| Description: Lemma for expcan 10984. 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 10859 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑁 < 𝑀)) → (𝐴↑𝑁) < (𝐴↑𝑀)) | |
| 6 | 5 | expr 375 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 1 < 𝐴) → (𝑁 < 𝑀 → (𝐴↑𝑁) < (𝐴↑𝑀))) |
| 7 | 1, 2, 3, 4, 6 | syl31anc 1276 | . . 3 ⊢ (𝜑 → (𝑁 < 𝑀 → (𝐴↑𝑁) < (𝐴↑𝑀))) |
| 8 | 7 | con3d 636 | . 2 ⊢ (𝜑 → (¬ (𝐴↑𝑁) < (𝐴↑𝑀) → ¬ 𝑁 < 𝑀)) |
| 9 | 0red 8185 | . . . . . 6 ⊢ (𝜑 → 0 ∈ ℝ) | |
| 10 | 1red 8199 | . . . . . 6 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 11 | 0lt1 8311 | . . . . . . 7 ⊢ 0 < 1 | |
| 12 | 11 | a1i 9 | . . . . . 6 ⊢ (𝜑 → 0 < 1) |
| 13 | 9, 10, 1, 12, 4 | lttrd 8310 | . . . . 5 ⊢ (𝜑 → 0 < 𝐴) |
| 14 | 1, 13 | gt0ap0d 8814 | . . . 4 ⊢ (𝜑 → 𝐴 # 0) |
| 15 | 1, 14, 3 | reexpclzapd 10966 | . . 3 ⊢ (𝜑 → (𝐴↑𝑀) ∈ ℝ) |
| 16 | 1, 14, 2 | reexpclzapd 10966 | . . 3 ⊢ (𝜑 → (𝐴↑𝑁) ∈ ℝ) |
| 17 | 15, 16 | lenltd 8302 | . 2 ⊢ (𝜑 → ((𝐴↑𝑀) ≤ (𝐴↑𝑁) ↔ ¬ (𝐴↑𝑁) < (𝐴↑𝑀))) |
| 18 | 3 | zred 9607 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
| 19 | 2 | zred 9607 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
| 20 | 18, 19 | lenltd 8302 | . 2 ⊢ (𝜑 → (𝑀 ≤ 𝑁 ↔ ¬ 𝑁 < 𝑀)) |
| 21 | 8, 17, 20 | 3imtr4d 203 | 1 ⊢ (𝜑 → ((𝐴↑𝑀) ≤ (𝐴↑𝑁) → 𝑀 ≤ 𝑁)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 1004 ∈ wcel 2201 class class class wbr 4089 (class class class)co 6023 ℝcr 8036 0cc0 8037 1c1 8038 < clt 8219 ≤ cle 8220 ℤcz 9484 ↑cexp 10806 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2203 ax-14 2204 ax-ext 2212 ax-coll 4205 ax-sep 4208 ax-nul 4216 ax-pow 4266 ax-pr 4301 ax-un 4532 ax-setind 4637 ax-iinf 4688 ax-cnex 8128 ax-resscn 8129 ax-1cn 8130 ax-1re 8131 ax-icn 8132 ax-addcl 8133 ax-addrcl 8134 ax-mulcl 8135 ax-mulrcl 8136 ax-addcom 8137 ax-mulcom 8138 ax-addass 8139 ax-mulass 8140 ax-distr 8141 ax-i2m1 8142 ax-0lt1 8143 ax-1rid 8144 ax-0id 8145 ax-rnegex 8146 ax-precex 8147 ax-cnre 8148 ax-pre-ltirr 8149 ax-pre-ltwlin 8150 ax-pre-lttrn 8151 ax-pre-apti 8152 ax-pre-ltadd 8153 ax-pre-mulgt0 8154 ax-pre-mulext 8155 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ne 2402 df-nel 2497 df-ral 2514 df-rex 2515 df-reu 2516 df-rmo 2517 df-rab 2518 df-v 2803 df-sbc 3031 df-csb 3127 df-dif 3201 df-un 3203 df-in 3205 df-ss 3212 df-nul 3494 df-if 3605 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-int 3930 df-iun 3973 df-br 4090 df-opab 4152 df-mpt 4153 df-tr 4189 df-id 4392 df-po 4395 df-iso 4396 df-iord 4465 df-on 4467 df-ilim 4468 df-suc 4470 df-iom 4691 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-ima 4740 df-iota 5288 df-fun 5330 df-fn 5331 df-f 5332 df-f1 5333 df-fo 5334 df-f1o 5335 df-fv 5336 df-riota 5976 df-ov 6026 df-oprab 6027 df-mpo 6028 df-1st 6308 df-2nd 6309 df-recs 6476 df-frec 6562 df-pnf 8221 df-mnf 8222 df-xr 8223 df-ltxr 8224 df-le 8225 df-sub 8357 df-neg 8358 df-reap 8760 df-ap 8767 df-div 8858 df-inn 9149 df-n0 9408 df-z 9485 df-uz 9761 df-rp 9894 df-seqfrec 10716 df-exp 10807 |
| This theorem is referenced by: expcan 10984 |
| Copyright terms: Public domain | W3C validator |