| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > zltlem1 | GIF version | ||
| Description: Integer ordering relation. (Contributed by NM, 13-Nov-2004.) |
| Ref | Expression |
|---|---|
| zltlem1 | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 ↔ 𝑀 ≤ (𝑁 − 1))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | peano2zm 9615 | . . 3 ⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ) | |
| 2 | zleltp1 9633 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ) → (𝑀 ≤ (𝑁 − 1) ↔ 𝑀 < ((𝑁 − 1) + 1))) | |
| 3 | 1, 2 | sylan2 286 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ (𝑁 − 1) ↔ 𝑀 < ((𝑁 − 1) + 1))) |
| 4 | zcn 9582 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
| 5 | ax-1cn 8220 | . . . . 5 ⊢ 1 ∈ ℂ | |
| 6 | npcan 8482 | . . . . 5 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 − 1) + 1) = 𝑁) | |
| 7 | 4, 5, 6 | sylancl 413 | . . . 4 ⊢ (𝑁 ∈ ℤ → ((𝑁 − 1) + 1) = 𝑁) |
| 8 | 7 | adantl 277 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑁 − 1) + 1) = 𝑁) |
| 9 | 8 | breq2d 4121 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < ((𝑁 − 1) + 1) ↔ 𝑀 < 𝑁)) |
| 10 | 3, 9 | bitr2d 189 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 ↔ 𝑀 ≤ (𝑁 − 1))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1398 ∈ wcel 2203 class class class wbr 4109 (class class class)co 6050 ℂcc 8125 1c1 8128 + caddc 8130 < clt 8308 ≤ cle 8309 − cmin 8444 ℤcz 9577 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-sep 4228 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-cnex 8218 ax-resscn 8219 ax-1cn 8220 ax-1re 8221 ax-icn 8222 ax-addcl 8223 ax-addrcl 8224 ax-mulcl 8225 ax-addcom 8227 ax-addass 8229 ax-distr 8231 ax-i2m1 8232 ax-0lt1 8233 ax-0id 8235 ax-rnegex 8236 ax-cnre 8238 ax-pre-ltirr 8239 ax-pre-ltwlin 8240 ax-pre-lttrn 8241 ax-pre-ltadd 8243 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2815 df-sbc 3043 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-br 4110 df-opab 4172 df-id 4414 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-iota 5312 df-fun 5354 df-fv 5360 df-riota 6003 df-ov 6053 df-oprab 6054 df-mpo 6055 df-pnf 8310 df-mnf 8311 df-xr 8312 df-ltxr 8313 df-le 8314 df-sub 8446 df-neg 8447 df-inn 9238 df-n0 9497 df-z 9578 |
| This theorem is referenced by: nn0ltlem1 9642 nn0lt2 9659 nn0le2is012 9660 nnltlem1 9663 nnm1ge0 9664 zextlt 9670 uzm1 9885 elfzm11 10425 elfzo 10483 fzosplitprm1 10580 intfracq 10682 iseqf1olemqcl 10861 iseqf1olemnab 10863 iseqf1olemab 10864 seq3f1olemqsumkj 10873 seq3f1olemqsum 10875 seqf1oglem1 10881 bcm1n 11131 seq3coll 11214 fzm1ndvds 12542 bitscmp 12644 nn0seqcvgd 12738 isprm3 12815 isprm5lem 12838 isprm5 12839 pw2dvds 12863 prmdiveq 12933 4sqlem12 13100 wilthlem1 15848 lgseisenlem2 15944 lgsquadlem1 15950 2lgslem1a1 15959 2sqlem8 15996 |
| Copyright terms: Public domain | W3C validator |