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 8876 | . . . 4 ⊢ ((𝑁 − 𝑀) ∈ ℕ → 1 ≤ (𝑁 − 𝑀)) | |
2 | 1 | a1i 9 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑁 − 𝑀) ∈ ℕ → 1 ≤ (𝑁 − 𝑀))) |
3 | znnsub 9238 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 ↔ (𝑁 − 𝑀) ∈ ℕ)) | |
4 | zre 9191 | . . . 4 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ) | |
5 | zre 9191 | . . . 4 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
6 | 1re 7894 | . . . . 5 ⊢ 1 ∈ ℝ | |
7 | leaddsub2 8333 | . . . . 5 ⊢ ((𝑀 ∈ ℝ ∧ 1 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((𝑀 + 1) ≤ 𝑁 ↔ 1 ≤ (𝑁 − 𝑀))) | |
8 | 6, 7 | mp3an2 1315 | . . . 4 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((𝑀 + 1) ≤ 𝑁 ↔ 1 ≤ (𝑁 − 𝑀))) |
9 | 4, 5, 8 | syl2an 287 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 + 1) ≤ 𝑁 ↔ 1 ≤ (𝑁 − 𝑀))) |
10 | 2, 3, 9 | 3imtr4d 202 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 → (𝑀 + 1) ≤ 𝑁)) |
11 | 4 | adantr 274 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑀 ∈ ℝ) |
12 | 11 | ltp1d 8821 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑀 < (𝑀 + 1)) |
13 | peano2re 8030 | . . . . 5 ⊢ (𝑀 ∈ ℝ → (𝑀 + 1) ∈ ℝ) | |
14 | 11, 13 | syl 14 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 + 1) ∈ ℝ) |
15 | 5 | adantl 275 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑁 ∈ ℝ) |
16 | ltletr 7984 | . . . 4 ⊢ ((𝑀 ∈ ℝ ∧ (𝑀 + 1) ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((𝑀 < (𝑀 + 1) ∧ (𝑀 + 1) ≤ 𝑁) → 𝑀 < 𝑁)) | |
17 | 11, 14, 15, 16 | syl3anc 1228 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 < (𝑀 + 1) ∧ (𝑀 + 1) ≤ 𝑁) → 𝑀 < 𝑁)) |
18 | 12, 17 | mpand 426 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 + 1) ≤ 𝑁 → 𝑀 < 𝑁)) |
19 | 10, 18 | impbid 128 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 ↔ (𝑀 + 1) ≤ 𝑁)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∈ wcel 2136 class class class wbr 3981 (class class class)co 5841 ℝcr 7748 1c1 7750 + caddc 7752 < clt 7929 ≤ cle 7930 − cmin 8065 ℕcn 8853 ℤcz 9187 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-13 2138 ax-14 2139 ax-ext 2147 ax-sep 4099 ax-pow 4152 ax-pr 4186 ax-un 4410 ax-setind 4513 ax-cnex 7840 ax-resscn 7841 ax-1cn 7842 ax-1re 7843 ax-icn 7844 ax-addcl 7845 ax-addrcl 7846 ax-mulcl 7847 ax-addcom 7849 ax-addass 7851 ax-distr 7853 ax-i2m1 7854 ax-0lt1 7855 ax-0id 7857 ax-rnegex 7858 ax-cnre 7860 ax-pre-ltirr 7861 ax-pre-ltwlin 7862 ax-pre-lttrn 7863 ax-pre-ltadd 7865 |
This theorem depends on definitions: df-bi 116 df-3or 969 df-3an 970 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2296 df-ne 2336 df-nel 2431 df-ral 2448 df-rex 2449 df-reu 2450 df-rab 2452 df-v 2727 df-sbc 2951 df-dif 3117 df-un 3119 df-in 3121 df-ss 3128 df-pw 3560 df-sn 3581 df-pr 3582 df-op 3584 df-uni 3789 df-int 3824 df-br 3982 df-opab 4043 df-id 4270 df-xp 4609 df-rel 4610 df-cnv 4611 df-co 4612 df-dm 4613 df-iota 5152 df-fun 5189 df-fv 5195 df-riota 5797 df-ov 5844 df-oprab 5845 df-mpo 5846 df-pnf 7931 df-mnf 7932 df-xr 7933 df-ltxr 7934 df-le 7935 df-sub 8067 df-neg 8068 df-inn 8854 df-n0 9111 df-z 9188 |
This theorem is referenced by: zleltp1 9242 zlem1lt 9243 zgt0ge1 9245 nnltp1le 9247 nn0ltp1le 9249 btwnnz 9281 uzind2 9299 fzind 9302 btwnapz 9317 eluzp1l 9486 eluz2b1 9535 zltaddlt1le 9939 fzsplit2 9981 m1modge3gt1 10302 seq3f1olemqsumkj 10429 seq3f1olemqsumk 10430 bcval5 10672 seq3coll 10751 cvgratnnlemseq 11463 nn0o1gt2 11838 divalglemnqt 11853 zsupcllemstep 11874 infssuzex 11878 suprzubdc 11881 isprm3 12046 dvdsnprmd 12053 prmgt1 12060 oddprmge3 12063 znege1 12106 hashdvds 12149 lgsdilem2 13537 |
Copyright terms: Public domain | W3C validator |