![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > expcanlem | GIF version |
Description: Lemma for expcan 10699. 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 10575 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑁 < 𝑀)) → (𝐴↑𝑁) < (𝐴↑𝑀)) | |
6 | 5 | expr 375 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 1 < 𝐴) → (𝑁 < 𝑀 → (𝐴↑𝑁) < (𝐴↑𝑀))) |
7 | 1, 2, 3, 4, 6 | syl31anc 1241 | . . 3 ⊢ (𝜑 → (𝑁 < 𝑀 → (𝐴↑𝑁) < (𝐴↑𝑀))) |
8 | 7 | con3d 631 | . 2 ⊢ (𝜑 → (¬ (𝐴↑𝑁) < (𝐴↑𝑀) → ¬ 𝑁 < 𝑀)) |
9 | 0red 7961 | . . . . . 6 ⊢ (𝜑 → 0 ∈ ℝ) | |
10 | 1red 7975 | . . . . . 6 ⊢ (𝜑 → 1 ∈ ℝ) | |
11 | 0lt1 8087 | . . . . . . 7 ⊢ 0 < 1 | |
12 | 11 | a1i 9 | . . . . . 6 ⊢ (𝜑 → 0 < 1) |
13 | 9, 10, 1, 12, 4 | lttrd 8086 | . . . . 5 ⊢ (𝜑 → 0 < 𝐴) |
14 | 1, 13 | gt0ap0d 8589 | . . . 4 ⊢ (𝜑 → 𝐴 # 0) |
15 | 1, 14, 3 | reexpclzapd 10682 | . . 3 ⊢ (𝜑 → (𝐴↑𝑀) ∈ ℝ) |
16 | 1, 14, 2 | reexpclzapd 10682 | . . 3 ⊢ (𝜑 → (𝐴↑𝑁) ∈ ℝ) |
17 | 15, 16 | lenltd 8078 | . 2 ⊢ (𝜑 → ((𝐴↑𝑀) ≤ (𝐴↑𝑁) ↔ ¬ (𝐴↑𝑁) < (𝐴↑𝑀))) |
18 | 3 | zred 9378 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
19 | 2 | zred 9378 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
20 | 18, 19 | lenltd 8078 | . 2 ⊢ (𝜑 → (𝑀 ≤ 𝑁 ↔ ¬ 𝑁 < 𝑀)) |
21 | 8, 17, 20 | 3imtr4d 203 | 1 ⊢ (𝜑 → ((𝐴↑𝑀) ≤ (𝐴↑𝑁) → 𝑀 ≤ 𝑁)) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 978 ∈ wcel 2148 class class class wbr 4005 (class class class)co 5878 ℝcr 7813 0cc0 7814 1c1 7815 < clt 7995 ≤ cle 7996 ℤcz 9256 ↑cexp 10522 |
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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4120 ax-sep 4123 ax-nul 4131 ax-pow 4176 ax-pr 4211 ax-un 4435 ax-setind 4538 ax-iinf 4589 ax-cnex 7905 ax-resscn 7906 ax-1cn 7907 ax-1re 7908 ax-icn 7909 ax-addcl 7910 ax-addrcl 7911 ax-mulcl 7912 ax-mulrcl 7913 ax-addcom 7914 ax-mulcom 7915 ax-addass 7916 ax-mulass 7917 ax-distr 7918 ax-i2m1 7919 ax-0lt1 7920 ax-1rid 7921 ax-0id 7922 ax-rnegex 7923 ax-precex 7924 ax-cnre 7925 ax-pre-ltirr 7926 ax-pre-ltwlin 7927 ax-pre-lttrn 7928 ax-pre-apti 7929 ax-pre-ltadd 7930 ax-pre-mulgt0 7931 ax-pre-mulext 7932 |
This theorem depends on definitions: df-bi 117 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2741 df-sbc 2965 df-csb 3060 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-nul 3425 df-if 3537 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-int 3847 df-iun 3890 df-br 4006 df-opab 4067 df-mpt 4068 df-tr 4104 df-id 4295 df-po 4298 df-iso 4299 df-iord 4368 df-on 4370 df-ilim 4371 df-suc 4373 df-iom 4592 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-rn 4639 df-res 4640 df-ima 4641 df-iota 5180 df-fun 5220 df-fn 5221 df-f 5222 df-f1 5223 df-fo 5224 df-f1o 5225 df-fv 5226 df-riota 5834 df-ov 5881 df-oprab 5882 df-mpo 5883 df-1st 6144 df-2nd 6145 df-recs 6309 df-frec 6395 df-pnf 7997 df-mnf 7998 df-xr 7999 df-ltxr 8000 df-le 8001 df-sub 8133 df-neg 8134 df-reap 8535 df-ap 8542 df-div 8633 df-inn 8923 df-n0 9180 df-z 9257 df-uz 9532 df-rp 9657 df-seqfrec 10449 df-exp 10523 |
This theorem is referenced by: expcan 10699 |
Copyright terms: Public domain | W3C validator |