| 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 9425 | . . 3 ⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ) | |
| 2 | zleltp1 9443 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ (𝑁 − 1) ∈ ℤ) → (𝑀 ≤ (𝑁 − 1) ↔ 𝑀 < ((𝑁 − 1) + 1))) | |
| 3 | 1, 2 | sylan2 286 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ (𝑁 − 1) ↔ 𝑀 < ((𝑁 − 1) + 1))) |
| 4 | zcn 9392 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | |
| 5 | ax-1cn 8033 | . . . . 5 ⊢ 1 ∈ ℂ | |
| 6 | npcan 8296 | . . . . 5 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 − 1) + 1) = 𝑁) | |
| 7 | 4, 5, 6 | sylancl 413 | . . . 4 ⊢ (𝑁 ∈ ℤ → ((𝑁 − 1) + 1) = 𝑁) |
| 8 | 7 | adantl 277 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑁 − 1) + 1) = 𝑁) |
| 9 | 8 | breq2d 4062 | . 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 2177 class class class wbr 4050 (class class class)co 5956 ℂcc 7938 1c1 7941 + caddc 7943 < clt 8122 ≤ cle 8123 − cmin 8258 ℤcz 9387 |
| 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 2179 ax-14 2180 ax-ext 2188 ax-sep 4169 ax-pow 4225 ax-pr 4260 ax-un 4487 ax-setind 4592 ax-cnex 8031 ax-resscn 8032 ax-1cn 8033 ax-1re 8034 ax-icn 8035 ax-addcl 8036 ax-addrcl 8037 ax-mulcl 8038 ax-addcom 8040 ax-addass 8042 ax-distr 8044 ax-i2m1 8045 ax-0lt1 8046 ax-0id 8048 ax-rnegex 8049 ax-cnre 8051 ax-pre-ltirr 8052 ax-pre-ltwlin 8053 ax-pre-lttrn 8054 ax-pre-ltadd 8056 |
| 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 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-nel 2473 df-ral 2490 df-rex 2491 df-reu 2492 df-rab 2494 df-v 2775 df-sbc 3003 df-dif 3172 df-un 3174 df-in 3176 df-ss 3183 df-pw 3622 df-sn 3643 df-pr 3644 df-op 3646 df-uni 3856 df-int 3891 df-br 4051 df-opab 4113 df-id 4347 df-xp 4688 df-rel 4689 df-cnv 4690 df-co 4691 df-dm 4692 df-iota 5240 df-fun 5281 df-fv 5287 df-riota 5911 df-ov 5959 df-oprab 5960 df-mpo 5961 df-pnf 8124 df-mnf 8125 df-xr 8126 df-ltxr 8127 df-le 8128 df-sub 8260 df-neg 8261 df-inn 9052 df-n0 9311 df-z 9388 |
| This theorem is referenced by: nn0ltlem1 9452 nn0lt2 9469 nn0le2is012 9470 nnltlem1 9473 nnm1ge0 9474 zextlt 9480 uzm1 9694 elfzm11 10228 elfzo 10286 fzosplitprm1 10380 intfracq 10482 iseqf1olemqcl 10661 iseqf1olemnab 10663 iseqf1olemab 10664 seq3f1olemqsumkj 10673 seq3f1olemqsum 10675 seqf1oglem1 10681 seq3coll 11004 fzm1ndvds 12237 bitscmp 12339 nn0seqcvgd 12433 isprm3 12510 isprm5lem 12533 isprm5 12534 pw2dvds 12558 prmdiveq 12628 4sqlem12 12795 wilthlem1 15522 lgseisenlem2 15618 lgsquadlem1 15624 2lgslem1a1 15633 2sqlem8 15670 |
| Copyright terms: Public domain | W3C validator |