| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > expcanlem | GIF version | ||
| Description: Lemma for expcan 10905. 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 10780 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑁 < 𝑀)) → (𝐴↑𝑁) < (𝐴↑𝑀)) | |
| 6 | 5 | expr 375 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 1 < 𝐴) → (𝑁 < 𝑀 → (𝐴↑𝑁) < (𝐴↑𝑀))) |
| 7 | 1, 2, 3, 4, 6 | syl31anc 1255 | . . 3 ⊢ (𝜑 → (𝑁 < 𝑀 → (𝐴↑𝑁) < (𝐴↑𝑀))) |
| 8 | 7 | con3d 634 | . 2 ⊢ (𝜑 → (¬ (𝐴↑𝑁) < (𝐴↑𝑀) → ¬ 𝑁 < 𝑀)) |
| 9 | 0red 8115 | . . . . . 6 ⊢ (𝜑 → 0 ∈ ℝ) | |
| 10 | 1red 8129 | . . . . . 6 ⊢ (𝜑 → 1 ∈ ℝ) | |
| 11 | 0lt1 8241 | . . . . . . 7 ⊢ 0 < 1 | |
| 12 | 11 | a1i 9 | . . . . . 6 ⊢ (𝜑 → 0 < 1) |
| 13 | 9, 10, 1, 12, 4 | lttrd 8240 | . . . . 5 ⊢ (𝜑 → 0 < 𝐴) |
| 14 | 1, 13 | gt0ap0d 8744 | . . . 4 ⊢ (𝜑 → 𝐴 # 0) |
| 15 | 1, 14, 3 | reexpclzapd 10887 | . . 3 ⊢ (𝜑 → (𝐴↑𝑀) ∈ ℝ) |
| 16 | 1, 14, 2 | reexpclzapd 10887 | . . 3 ⊢ (𝜑 → (𝐴↑𝑁) ∈ ℝ) |
| 17 | 15, 16 | lenltd 8232 | . 2 ⊢ (𝜑 → ((𝐴↑𝑀) ≤ (𝐴↑𝑁) ↔ ¬ (𝐴↑𝑁) < (𝐴↑𝑀))) |
| 18 | 3 | zred 9537 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
| 19 | 2 | zred 9537 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
| 20 | 18, 19 | lenltd 8232 | . 2 ⊢ (𝜑 → (𝑀 ≤ 𝑁 ↔ ¬ 𝑁 < 𝑀)) |
| 21 | 8, 17, 20 | 3imtr4d 203 | 1 ⊢ (𝜑 → ((𝐴↑𝑀) ≤ (𝐴↑𝑁) → 𝑀 ≤ 𝑁)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 983 ∈ wcel 2180 class class class wbr 4062 (class class class)co 5974 ℝcr 7966 0cc0 7967 1c1 7968 < clt 8149 ≤ cle 8150 ℤcz 9414 ↑cexp 10727 |
| 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 713 ax-5 1473 ax-7 1474 ax-gen 1475 ax-ie1 1519 ax-ie2 1520 ax-8 1530 ax-10 1531 ax-11 1532 ax-i12 1533 ax-bndl 1535 ax-4 1536 ax-17 1552 ax-i9 1556 ax-ial 1560 ax-i5r 1561 ax-13 2182 ax-14 2183 ax-ext 2191 ax-coll 4178 ax-sep 4181 ax-nul 4189 ax-pow 4237 ax-pr 4272 ax-un 4501 ax-setind 4606 ax-iinf 4657 ax-cnex 8058 ax-resscn 8059 ax-1cn 8060 ax-1re 8061 ax-icn 8062 ax-addcl 8063 ax-addrcl 8064 ax-mulcl 8065 ax-mulrcl 8066 ax-addcom 8067 ax-mulcom 8068 ax-addass 8069 ax-mulass 8070 ax-distr 8071 ax-i2m1 8072 ax-0lt1 8073 ax-1rid 8074 ax-0id 8075 ax-rnegex 8076 ax-precex 8077 ax-cnre 8078 ax-pre-ltirr 8079 ax-pre-ltwlin 8080 ax-pre-lttrn 8081 ax-pre-apti 8082 ax-pre-ltadd 8083 ax-pre-mulgt0 8084 ax-pre-mulext 8085 |
| This theorem depends on definitions: df-bi 117 df-dc 839 df-3or 984 df-3an 985 df-tru 1378 df-fal 1381 df-nf 1487 df-sb 1789 df-eu 2060 df-mo 2061 df-clab 2196 df-cleq 2202 df-clel 2205 df-nfc 2341 df-ne 2381 df-nel 2476 df-ral 2493 df-rex 2494 df-reu 2495 df-rmo 2496 df-rab 2497 df-v 2781 df-sbc 3009 df-csb 3105 df-dif 3179 df-un 3181 df-in 3183 df-ss 3190 df-nul 3472 df-if 3583 df-pw 3631 df-sn 3652 df-pr 3653 df-op 3655 df-uni 3868 df-int 3903 df-iun 3946 df-br 4063 df-opab 4125 df-mpt 4126 df-tr 4162 df-id 4361 df-po 4364 df-iso 4365 df-iord 4434 df-on 4436 df-ilim 4437 df-suc 4439 df-iom 4660 df-xp 4702 df-rel 4703 df-cnv 4704 df-co 4705 df-dm 4706 df-rn 4707 df-res 4708 df-ima 4709 df-iota 5254 df-fun 5296 df-fn 5297 df-f 5298 df-f1 5299 df-fo 5300 df-f1o 5301 df-fv 5302 df-riota 5927 df-ov 5977 df-oprab 5978 df-mpo 5979 df-1st 6256 df-2nd 6257 df-recs 6421 df-frec 6507 df-pnf 8151 df-mnf 8152 df-xr 8153 df-ltxr 8154 df-le 8155 df-sub 8287 df-neg 8288 df-reap 8690 df-ap 8697 df-div 8788 df-inn 9079 df-n0 9338 df-z 9415 df-uz 9691 df-rp 9818 df-seqfrec 10637 df-exp 10728 |
| This theorem is referenced by: expcan 10905 |
| Copyright terms: Public domain | W3C validator |