| 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 9447 | . . 3 ⊢ (𝑀 ∈ ℤ → (𝑀 − 1) ∈ ℤ) | |
| 2 | zltp1le 9464 | . . 3 ⊢ (((𝑀 − 1) ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 − 1) < 𝑁 ↔ ((𝑀 − 1) + 1) ≤ 𝑁)) | |
| 3 | 1, 2 | sylan 283 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 − 1) < 𝑁 ↔ ((𝑀 − 1) + 1) ≤ 𝑁)) |
| 4 | zcn 9414 | . . . . 5 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ) | |
| 5 | ax-1cn 8055 | . . . . 5 ⊢ 1 ∈ ℂ | |
| 6 | npcan 8318 | . . . . 5 ⊢ ((𝑀 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑀 − 1) + 1) = 𝑀) | |
| 7 | 4, 5, 6 | sylancl 413 | . . . 4 ⊢ (𝑀 ∈ ℤ → ((𝑀 − 1) + 1) = 𝑀) |
| 8 | 7 | adantr 276 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 − 1) + 1) = 𝑀) |
| 9 | 8 | breq1d 4070 | . 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 1373 ∈ wcel 2178 class class class wbr 4060 (class class class)co 5969 ℂcc 7960 1c1 7963 + caddc 7965 < clt 8144 ≤ cle 8145 − cmin 8280 ℤcz 9409 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2180 ax-14 2181 ax-ext 2189 ax-sep 4179 ax-pow 4235 ax-pr 4270 ax-un 4499 ax-setind 4604 ax-cnex 8053 ax-resscn 8054 ax-1cn 8055 ax-1re 8056 ax-icn 8057 ax-addcl 8058 ax-addrcl 8059 ax-mulcl 8060 ax-addcom 8062 ax-addass 8064 ax-distr 8066 ax-i2m1 8067 ax-0lt1 8068 ax-0id 8070 ax-rnegex 8071 ax-cnre 8073 ax-pre-ltirr 8074 ax-pre-ltwlin 8075 ax-pre-lttrn 8076 ax-pre-ltadd 8078 |
| This theorem depends on definitions: df-bi 117 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ne 2379 df-nel 2474 df-ral 2491 df-rex 2492 df-reu 2493 df-rab 2495 df-v 2779 df-sbc 3007 df-dif 3177 df-un 3179 df-in 3181 df-ss 3188 df-pw 3629 df-sn 3650 df-pr 3651 df-op 3653 df-uni 3866 df-int 3901 df-br 4061 df-opab 4123 df-id 4359 df-xp 4700 df-rel 4701 df-cnv 4702 df-co 4703 df-dm 4704 df-iota 5252 df-fun 5293 df-fv 5299 df-riota 5924 df-ov 5972 df-oprab 5973 df-mpo 5974 df-pnf 8146 df-mnf 8147 df-xr 8148 df-ltxr 8149 df-le 8150 df-sub 8282 df-neg 8283 df-inn 9074 df-n0 9333 df-z 9410 |
| This theorem is referenced by: nn0lem1lt 9493 nnlem1lt 9494 uzdisj 10252 nn0disj 10297 fzon 10326 ssfzo12 10392 ceiqle 10497 nn0ltexp2 10893 bitsfzolem 12426 bitscmp 12430 bitsinv1lem 12433 hashdvds 12704 lgsquadlem1 15715 |
| Copyright terms: Public domain | W3C validator |