| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > zlem1lt | GIF version | ||
| Description: Integer ordering relation. (Contributed by NM, 13-Nov-2004.) |
| Ref | Expression |
|---|---|
| zlem1lt | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ 𝑁 ↔ (𝑀 − 1) < 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | peano2zm 9516 | . . 3 ⊢ (𝑀 ∈ ℤ → (𝑀 − 1) ∈ ℤ) | |
| 2 | zltp1le 9533 | . . 3 ⊢ (((𝑀 − 1) ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 − 1) < 𝑁 ↔ ((𝑀 − 1) + 1) ≤ 𝑁)) | |
| 3 | 1, 2 | sylan 283 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 − 1) < 𝑁 ↔ ((𝑀 − 1) + 1) ≤ 𝑁)) |
| 4 | zcn 9483 | . . . . 5 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ) | |
| 5 | ax-1cn 8124 | . . . . 5 ⊢ 1 ∈ ℂ | |
| 6 | npcan 8387 | . . . . 5 ⊢ ((𝑀 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑀 − 1) + 1) = 𝑀) | |
| 7 | 4, 5, 6 | sylancl 413 | . . . 4 ⊢ (𝑀 ∈ ℤ → ((𝑀 − 1) + 1) = 𝑀) |
| 8 | 7 | adantr 276 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 − 1) + 1) = 𝑀) |
| 9 | 8 | breq1d 4098 | . 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 1397 ∈ wcel 2202 class class class wbr 4088 (class class class)co 6017 ℂcc 8029 1c1 8032 + caddc 8034 < clt 8213 ≤ cle 8214 − cmin 8349 ℤcz 9478 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8122 ax-resscn 8123 ax-1cn 8124 ax-1re 8125 ax-icn 8126 ax-addcl 8127 ax-addrcl 8128 ax-mulcl 8129 ax-addcom 8131 ax-addass 8133 ax-distr 8135 ax-i2m1 8136 ax-0lt1 8137 ax-0id 8139 ax-rnegex 8140 ax-cnre 8142 ax-pre-ltirr 8143 ax-pre-ltwlin 8144 ax-pre-lttrn 8145 ax-pre-ltadd 8147 |
| This theorem depends on definitions: df-bi 117 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-br 4089 df-opab 4151 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-iota 5286 df-fun 5328 df-fv 5334 df-riota 5970 df-ov 6020 df-oprab 6021 df-mpo 6022 df-pnf 8215 df-mnf 8216 df-xr 8217 df-ltxr 8218 df-le 8219 df-sub 8351 df-neg 8352 df-inn 9143 df-n0 9402 df-z 9479 |
| This theorem is referenced by: nn0lem1lt 9562 nnlem1lt 9563 uzdisj 10327 nn0disj 10372 fzon 10401 ssfzo12 10468 ceiqle 10574 nn0ltexp2 10970 bitsfzolem 12514 bitscmp 12518 bitsinv1lem 12521 hashdvds 12792 lgsquadlem1 15805 |
| Copyright terms: Public domain | W3C validator |