Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > expcanlem | GIF version |
Description: Lemma for expcan 10650. 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 10528 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ (1 < 𝐴 ∧ 𝑁 < 𝑀)) → (𝐴↑𝑁) < (𝐴↑𝑀)) | |
6 | 5 | expr 373 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 1 < 𝐴) → (𝑁 < 𝑀 → (𝐴↑𝑁) < (𝐴↑𝑀))) |
7 | 1, 2, 3, 4, 6 | syl31anc 1236 | . . 3 ⊢ (𝜑 → (𝑁 < 𝑀 → (𝐴↑𝑁) < (𝐴↑𝑀))) |
8 | 7 | con3d 626 | . 2 ⊢ (𝜑 → (¬ (𝐴↑𝑁) < (𝐴↑𝑀) → ¬ 𝑁 < 𝑀)) |
9 | 0red 7921 | . . . . . 6 ⊢ (𝜑 → 0 ∈ ℝ) | |
10 | 1red 7935 | . . . . . 6 ⊢ (𝜑 → 1 ∈ ℝ) | |
11 | 0lt1 8046 | . . . . . . 7 ⊢ 0 < 1 | |
12 | 11 | a1i 9 | . . . . . 6 ⊢ (𝜑 → 0 < 1) |
13 | 9, 10, 1, 12, 4 | lttrd 8045 | . . . . 5 ⊢ (𝜑 → 0 < 𝐴) |
14 | 1, 13 | gt0ap0d 8548 | . . . 4 ⊢ (𝜑 → 𝐴 # 0) |
15 | 1, 14, 3 | reexpclzapd 10634 | . . 3 ⊢ (𝜑 → (𝐴↑𝑀) ∈ ℝ) |
16 | 1, 14, 2 | reexpclzapd 10634 | . . 3 ⊢ (𝜑 → (𝐴↑𝑁) ∈ ℝ) |
17 | 15, 16 | lenltd 8037 | . 2 ⊢ (𝜑 → ((𝐴↑𝑀) ≤ (𝐴↑𝑁) ↔ ¬ (𝐴↑𝑁) < (𝐴↑𝑀))) |
18 | 3 | zred 9334 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℝ) |
19 | 2 | zred 9334 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℝ) |
20 | 18, 19 | lenltd 8037 | . 2 ⊢ (𝜑 → (𝑀 ≤ 𝑁 ↔ ¬ 𝑁 < 𝑀)) |
21 | 8, 17, 20 | 3imtr4d 202 | 1 ⊢ (𝜑 → ((𝐴↑𝑀) ≤ (𝐴↑𝑁) → 𝑀 ≤ 𝑁)) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 973 ∈ wcel 2141 class class class wbr 3989 (class class class)co 5853 ℝcr 7773 0cc0 7774 1c1 7775 < clt 7954 ≤ cle 7955 ℤcz 9212 ↑cexp 10475 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-coll 4104 ax-sep 4107 ax-nul 4115 ax-pow 4160 ax-pr 4194 ax-un 4418 ax-setind 4521 ax-iinf 4572 ax-cnex 7865 ax-resscn 7866 ax-1cn 7867 ax-1re 7868 ax-icn 7869 ax-addcl 7870 ax-addrcl 7871 ax-mulcl 7872 ax-mulrcl 7873 ax-addcom 7874 ax-mulcom 7875 ax-addass 7876 ax-mulass 7877 ax-distr 7878 ax-i2m1 7879 ax-0lt1 7880 ax-1rid 7881 ax-0id 7882 ax-rnegex 7883 ax-precex 7884 ax-cnre 7885 ax-pre-ltirr 7886 ax-pre-ltwlin 7887 ax-pre-lttrn 7888 ax-pre-apti 7889 ax-pre-ltadd 7890 ax-pre-mulgt0 7891 ax-pre-mulext 7892 |
This theorem depends on definitions: df-bi 116 df-dc 830 df-3or 974 df-3an 975 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ne 2341 df-nel 2436 df-ral 2453 df-rex 2454 df-reu 2455 df-rmo 2456 df-rab 2457 df-v 2732 df-sbc 2956 df-csb 3050 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-nul 3415 df-if 3527 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 df-uni 3797 df-int 3832 df-iun 3875 df-br 3990 df-opab 4051 df-mpt 4052 df-tr 4088 df-id 4278 df-po 4281 df-iso 4282 df-iord 4351 df-on 4353 df-ilim 4354 df-suc 4356 df-iom 4575 df-xp 4617 df-rel 4618 df-cnv 4619 df-co 4620 df-dm 4621 df-rn 4622 df-res 4623 df-ima 4624 df-iota 5160 df-fun 5200 df-fn 5201 df-f 5202 df-f1 5203 df-fo 5204 df-f1o 5205 df-fv 5206 df-riota 5809 df-ov 5856 df-oprab 5857 df-mpo 5858 df-1st 6119 df-2nd 6120 df-recs 6284 df-frec 6370 df-pnf 7956 df-mnf 7957 df-xr 7958 df-ltxr 7959 df-le 7960 df-sub 8092 df-neg 8093 df-reap 8494 df-ap 8501 df-div 8590 df-inn 8879 df-n0 9136 df-z 9213 df-uz 9488 df-rp 9611 df-seqfrec 10402 df-exp 10476 |
This theorem is referenced by: expcan 10650 |
Copyright terms: Public domain | W3C validator |