Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > zlem1lt | Structured version Visualization version GIF version |
Description: Integer ordering relation. (Contributed by NM, 13-Nov-2004.) |
Ref | Expression |
---|---|
zlem1lt | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ 𝑁 ↔ (𝑀 − 1) < 𝑁)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | peano2zm 12372 | . . 3 ⊢ (𝑀 ∈ ℤ → (𝑀 − 1) ∈ ℤ) | |
2 | zltp1le 12379 | . . 3 ⊢ (((𝑀 − 1) ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 − 1) < 𝑁 ↔ ((𝑀 − 1) + 1) ≤ 𝑁)) | |
3 | 1, 2 | sylan 580 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 − 1) < 𝑁 ↔ ((𝑀 − 1) + 1) ≤ 𝑁)) |
4 | zcn 12333 | . . . . 5 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ) | |
5 | ax-1cn 10938 | . . . . 5 ⊢ 1 ∈ ℂ | |
6 | npcan 11239 | . . . . 5 ⊢ ((𝑀 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑀 − 1) + 1) = 𝑀) | |
7 | 4, 5, 6 | sylancl 586 | . . . 4 ⊢ (𝑀 ∈ ℤ → ((𝑀 − 1) + 1) = 𝑀) |
8 | 7 | adantr 481 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 − 1) + 1) = 𝑀) |
9 | 8 | breq1d 5085 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (((𝑀 − 1) + 1) ≤ 𝑁 ↔ 𝑀 ≤ 𝑁)) |
10 | 3, 9 | bitr2d 279 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ 𝑁 ↔ (𝑀 − 1) < 𝑁)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1539 ∈ wcel 2107 class class class wbr 5075 (class class class)co 7284 ℂcc 10878 1c1 10881 + caddc 10883 < clt 11018 ≤ cle 11019 − cmin 11214 ℤcz 12328 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2710 ax-sep 5224 ax-nul 5231 ax-pow 5289 ax-pr 5353 ax-un 7597 ax-resscn 10937 ax-1cn 10938 ax-icn 10939 ax-addcl 10940 ax-addrcl 10941 ax-mulcl 10942 ax-mulrcl 10943 ax-mulcom 10944 ax-addass 10945 ax-mulass 10946 ax-distr 10947 ax-i2m1 10948 ax-1ne0 10949 ax-1rid 10950 ax-rnegex 10951 ax-rrecex 10952 ax-cnre 10953 ax-pre-lttri 10954 ax-pre-lttrn 10955 ax-pre-ltadd 10956 ax-pre-mulgt0 10957 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2817 df-nfc 2890 df-ne 2945 df-nel 3051 df-ral 3070 df-rex 3071 df-reu 3073 df-rab 3074 df-v 3435 df-sbc 3718 df-csb 3834 df-dif 3891 df-un 3893 df-in 3895 df-ss 3905 df-pss 3907 df-nul 4258 df-if 4461 df-pw 4536 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4841 df-iun 4927 df-br 5076 df-opab 5138 df-mpt 5159 df-tr 5193 df-id 5490 df-eprel 5496 df-po 5504 df-so 5505 df-fr 5545 df-we 5547 df-xp 5596 df-rel 5597 df-cnv 5598 df-co 5599 df-dm 5600 df-rn 5601 df-res 5602 df-ima 5603 df-pred 6206 df-ord 6273 df-on 6274 df-lim 6275 df-suc 6276 df-iota 6395 df-fun 6439 df-fn 6440 df-f 6441 df-f1 6442 df-fo 6443 df-f1o 6444 df-fv 6445 df-riota 7241 df-ov 7287 df-oprab 7288 df-mpo 7289 df-om 7722 df-2nd 7841 df-frecs 8106 df-wrecs 8137 df-recs 8211 df-rdg 8250 df-er 8507 df-en 8743 df-dom 8744 df-sdom 8745 df-pnf 11020 df-mnf 11021 df-xr 11022 df-ltxr 11023 df-le 11024 df-sub 11216 df-neg 11217 df-nn 11983 df-n0 12243 df-z 12329 |
This theorem is referenced by: nn0lem1lt 12394 nnlem1lt 12395 zbtwnre 12695 uzdisj 13338 nn0disj 13381 fzon 13417 ssfzo12 13489 ceile 13578 cshwidxn 14531 bitsfzolem 16150 bitscmp 16154 bitsinv1lem 16157 hashdvds 16485 logf1o2 25814 ang180lem3 25970 lgsquadlem1 26537 fzsplit3 31124 ballotlemfc0 32468 ballotlemfcc 32469 ballotlemimin 32481 ballotlemfrceq 32504 ballotlemfrcn0 32505 0nn0m1nnn0 33080 poimirlem23 35809 poimirlem24 35810 sticksstones10 40118 metakunt7 40138 metakunt18 40149 metakunt30 40161 irrapxlem3 40653 hashnzfz2 41946 fzdifsuc2 42856 stoweidlem26 43574 fourierdlem12 43667 fzoopth 44830 fpprel2 45204 nnsum3primesle9 45257 evengpop3 45261 zgtp1leeq 45873 m1modmmod 45878 nnolog2flm1 45947 |
Copyright terms: Public domain | W3C validator |