| 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 9635 | . . 3 ⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ) | |
| 2 | zleltp1 9653 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ) → (𝑀 ≤ (𝑁 − 1) ↔ 𝑀 < ((𝑁 − 1) + 1))) | |
| 3 | 1, 2 | sylan2 286 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ (𝑁 − 1) ↔ 𝑀 < ((𝑁 − 1) + 1))) |
| 4 | zcn 9602 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
| 5 | ax-1cn 8236 | . . . . 5 ⊢ 1 ∈ ℂ | |
| 6 | npcan 8499 | . . . . 5 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 − 1) + 1) = 𝑁) | |
| 7 | 4, 5, 6 | sylancl 413 | . . . 4 ⊢ (𝑁 ∈ ℤ → ((𝑁 − 1) + 1) = 𝑁) |
| 8 | 7 | adantl 277 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑁 − 1) + 1) = 𝑁) |
| 9 | 8 | breq2d 4126 | . 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 2205 class class class wbr 4114 (class class class)co 6058 ℂcc 8141 1c1 8144 + caddc 8146 < clt 8324 ≤ cle 8325 − cmin 8461 ℤcz 9597 |
| 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 2207 ax-14 2208 ax-ext 2216 ax-sep 4233 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-addcom 8243 ax-addass 8245 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-0id 8251 ax-rnegex 8252 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-ltadd 8259 |
| 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 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-br 4115 df-opab 4177 df-id 4419 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-iota 5317 df-fun 5359 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8463 df-neg 8464 df-inn 9258 df-n0 9517 df-z 9598 |
| This theorem is referenced by: nn0ltlem1 9662 nn0lt2 9680 nn0le2is012 9681 nnltlem1 9684 nnm1ge0 9685 zextlt 9691 uzm1 9906 elfzm11 10450 elfzo 10508 fzosplitprm1 10605 intfracq 10709 iseqf1olemqcl 10888 iseqf1olemnab 10890 iseqf1olemab 10891 seq3f1olemqsumkj 10900 seq3f1olemqsum 10902 seqf1oglem1 10908 bcm1n 11159 seq3coll 11242 fzm1ndvds 12571 bitscmp 12673 nn0seqcvgd 12767 isprm3 12844 isprm5lem 12867 isprm5 12868 pw2dvds 12892 prmdiveq 12962 4sqlem12 13129 ballotfilemimin 13197 ballotfilemfrcn0 13221 wilthlem1 15978 lgseisenlem2 16074 lgsquadlem1 16080 2lgslem1a1 16089 2sqlem8 16126 |
| Copyright terms: Public domain | W3C validator |