| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > zltp1le | GIF version | ||
| Description: Integer ordering relation. (Contributed by NM, 10-May-2004.) (Proof shortened by Mario Carneiro, 16-May-2014.) |
| Ref | Expression |
|---|---|
| zltp1le | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 ↔ (𝑀 + 1) ≤ 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nnge1 9208 | . . . 4 ⊢ ((𝑁 − 𝑀) ∈ ℕ → 1 ≤ (𝑁 − 𝑀)) | |
| 2 | 1 | a1i 9 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑁 − 𝑀) ∈ ℕ → 1 ≤ (𝑁 − 𝑀))) |
| 3 | znnsub 9575 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 ↔ (𝑁 − 𝑀) ∈ ℕ)) | |
| 4 | zre 9527 | . . . 4 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ) | |
| 5 | zre 9527 | . . . 4 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
| 6 | 1re 8221 | . . . . 5 ⊢ 1 ∈ ℝ | |
| 7 | leaddsub2 8661 | . . . . 5 ⊢ ((𝑀 ∈ ℝ ∧ 1 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((𝑀 + 1) ≤ 𝑁 ↔ 1 ≤ (𝑁 − 𝑀))) | |
| 8 | 6, 7 | mp3an2 1362 | . . . 4 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((𝑀 + 1) ≤ 𝑁 ↔ 1 ≤ (𝑁 − 𝑀))) |
| 9 | 4, 5, 8 | syl2an 289 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 + 1) ≤ 𝑁 ↔ 1 ≤ (𝑁 − 𝑀))) |
| 10 | 2, 3, 9 | 3imtr4d 203 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 → (𝑀 + 1) ≤ 𝑁)) |
| 11 | 4 | adantr 276 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑀 ∈ ℝ) |
| 12 | 11 | ltp1d 9152 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑀 < (𝑀 + 1)) |
| 13 | peano2re 8357 | . . . . 5 ⊢ (𝑀 ∈ ℝ → (𝑀 + 1) ∈ ℝ) | |
| 14 | 11, 13 | syl 14 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 + 1) ∈ ℝ) |
| 15 | 5 | adantl 277 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑁 ∈ ℝ) |
| 16 | ltletr 8311 | . . . 4 ⊢ ((𝑀 ∈ ℝ ∧ (𝑀 + 1) ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((𝑀 < (𝑀 + 1) ∧ (𝑀 + 1) ≤ 𝑁) → 𝑀 < 𝑁)) | |
| 17 | 11, 14, 15, 16 | syl3anc 1274 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 < (𝑀 + 1) ∧ (𝑀 + 1) ≤ 𝑁) → 𝑀 < 𝑁)) |
| 18 | 12, 17 | mpand 429 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 + 1) ≤ 𝑁 → 𝑀 < 𝑁)) |
| 19 | 10, 18 | impbid 129 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 ↔ (𝑀 + 1) ≤ 𝑁)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2202 class class class wbr 4093 (class class class)co 6028 ℝcr 8074 1c1 8076 + caddc 8078 < clt 8256 ≤ cle 8257 − cmin 8392 ℕcn 9185 ℤcz 9523 |
| 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 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-addass 8177 ax-distr 8179 ax-i2m1 8180 ax-0lt1 8181 ax-0id 8183 ax-rnegex 8184 ax-cnre 8186 ax-pre-ltirr 8187 ax-pre-ltwlin 8188 ax-pre-lttrn 8189 ax-pre-ltadd 8191 |
| 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 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-br 4094 df-opab 4156 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-iota 5293 df-fun 5335 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-pnf 8258 df-mnf 8259 df-xr 8260 df-ltxr 8261 df-le 8262 df-sub 8394 df-neg 8395 df-inn 9186 df-n0 9445 df-z 9524 |
| This theorem is referenced by: zleltp1 9579 zlem1lt 9580 zgt0ge1 9582 nnltp1le 9584 nn0ltp1le 9586 btwnnz 9618 uzind2 9636 fzind 9639 btwnapz 9654 eluzp1l 9825 eluz2b1 9879 zltaddlt1le 10287 fzsplit2 10330 zsupcllemstep 10535 infssuzex 10539 suprzubdc 10542 m1modge3gt1 10679 seq3f1olemqsumkj 10819 seq3f1olemqsumk 10820 bcval5 11071 seq3coll 11152 cvgratnnlemseq 12150 nn0o1gt2 12529 divalglemnqt 12544 isprm3 12753 dvdsnprmd 12760 prmgt1 12767 oddprmge3 12770 znege1 12813 hashdvds 12856 lgsdilem2 15838 lgsquadlem1 15879 2lgslem1a 15890 konigsberglem5 16416 |
| Copyright terms: Public domain | W3C validator |