![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > zltlem1 | Structured version Visualization version GIF version |
Description: Integer ordering relation. (Contributed by NM, 13-Nov-2004.) |
Ref | Expression |
---|---|
zltlem1 | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 ↔ 𝑀 ≤ (𝑁 − 1))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | peano2zm 11612 | . . 3 ⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ) | |
2 | zleltp1 11620 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ) → (𝑀 ≤ (𝑁 − 1) ↔ 𝑀 < ((𝑁 − 1) + 1))) | |
3 | 1, 2 | sylan2 492 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ (𝑁 − 1) ↔ 𝑀 < ((𝑁 − 1) + 1))) |
4 | zcn 11574 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
5 | ax-1cn 10186 | . . . . 5 ⊢ 1 ∈ ℂ | |
6 | npcan 10482 | . . . . 5 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 − 1) + 1) = 𝑁) | |
7 | 4, 5, 6 | sylancl 697 | . . . 4 ⊢ (𝑁 ∈ ℤ → ((𝑁 − 1) + 1) = 𝑁) |
8 | 7 | adantl 473 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑁 − 1) + 1) = 𝑁) |
9 | 8 | breq2d 4816 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < ((𝑁 − 1) + 1) ↔ 𝑀 < 𝑁)) |
10 | 3, 9 | bitr2d 269 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 ↔ 𝑀 ≤ (𝑁 − 1))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 383 = wceq 1632 ∈ wcel 2139 class class class wbr 4804 (class class class)co 6813 ℂcc 10126 1c1 10129 + caddc 10131 < clt 10266 ≤ cle 10267 − cmin 10458 ℤcz 11569 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1871 ax-4 1886 ax-5 1988 ax-6 2054 ax-7 2090 ax-8 2141 ax-9 2148 ax-10 2168 ax-11 2183 ax-12 2196 ax-13 2391 ax-ext 2740 ax-sep 4933 ax-nul 4941 ax-pow 4992 ax-pr 5055 ax-un 7114 ax-resscn 10185 ax-1cn 10186 ax-icn 10187 ax-addcl 10188 ax-addrcl 10189 ax-mulcl 10190 ax-mulrcl 10191 ax-mulcom 10192 ax-addass 10193 ax-mulass 10194 ax-distr 10195 ax-i2m1 10196 ax-1ne0 10197 ax-1rid 10198 ax-rnegex 10199 ax-rrecex 10200 ax-cnre 10201 ax-pre-lttri 10202 ax-pre-lttrn 10203 ax-pre-ltadd 10204 ax-pre-mulgt0 10205 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1635 df-ex 1854 df-nf 1859 df-sb 2047 df-eu 2611 df-mo 2612 df-clab 2747 df-cleq 2753 df-clel 2756 df-nfc 2891 df-ne 2933 df-nel 3036 df-ral 3055 df-rex 3056 df-reu 3057 df-rab 3059 df-v 3342 df-sbc 3577 df-csb 3675 df-dif 3718 df-un 3720 df-in 3722 df-ss 3729 df-pss 3731 df-nul 4059 df-if 4231 df-pw 4304 df-sn 4322 df-pr 4324 df-tp 4326 df-op 4328 df-uni 4589 df-iun 4674 df-br 4805 df-opab 4865 df-mpt 4882 df-tr 4905 df-id 5174 df-eprel 5179 df-po 5187 df-so 5188 df-fr 5225 df-we 5227 df-xp 5272 df-rel 5273 df-cnv 5274 df-co 5275 df-dm 5276 df-rn 5277 df-res 5278 df-ima 5279 df-pred 5841 df-ord 5887 df-on 5888 df-lim 5889 df-suc 5890 df-iota 6012 df-fun 6051 df-fn 6052 df-f 6053 df-f1 6054 df-fo 6055 df-f1o 6056 df-fv 6057 df-riota 6774 df-ov 6816 df-oprab 6817 df-mpt2 6818 df-om 7231 df-wrecs 7576 df-recs 7637 df-rdg 7675 df-er 7911 df-en 8122 df-dom 8123 df-sdom 8124 df-pnf 10268 df-mnf 10269 df-xr 10270 df-ltxr 10271 df-le 10272 df-sub 10460 df-neg 10461 df-nn 11213 df-n0 11485 df-z 11570 |
This theorem is referenced by: nn0ltlem1 11629 nn0lt2 11632 nn0le2is012 11633 nnltlem1 11636 nnm1ge0 11637 zextlt 11643 uzm1 11911 elfzm11 12604 preduz 12655 predfz 12658 elfzo 12666 fzosplitprm1 12772 intfracq 12852 seqf1olem1 13034 seqcoll 13440 isercolllem1 14594 fzm1ndvds 15246 bitscmp 15362 nn0seqcvgd 15485 isprm3 15598 ncoprmlnprm 15638 prmdiveq 15693 4sqlem12 15862 degltlem1 24031 dgreq0 24220 wilthlem1 24993 lgseisenlem2 25300 lgsquadlem1 25304 2lgslem1a1 25313 2sqlem8 25350 crctcshwlkn0lem4 26916 clwlkclwwlklem2a4 27120 clwlkclwwlklem2a 27121 frgrreggt1 27561 bcm1n 29863 smatrcl 30171 ballotlemimin 30876 ballotlemfrcn0 30900 knoppndvlem2 32810 poimirlem2 33724 poimirlem24 33746 fmul01lt1lem2 40320 fourierdlem41 40868 fourierdlem42 40869 fourierdlem50 40876 fourierdlem64 40890 fourierdlem79 40905 etransclem44 40998 etransclem48 41002 pw2m1lepw2m1 42820 fllog2 42872 |
Copyright terms: Public domain | W3C validator |