![]() |
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 8357 | . . . 4 ⊢ ((𝑁 − 𝑀) ∈ ℕ → 1 ≤ (𝑁 − 𝑀)) | |
2 | 1 | a1i 9 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑁 − 𝑀) ∈ ℕ → 1 ≤ (𝑁 − 𝑀))) |
3 | znnsub 8711 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 ↔ (𝑁 − 𝑀) ∈ ℕ)) | |
4 | zre 8664 | . . . 4 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ) | |
5 | zre 8664 | . . . 4 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
6 | 1re 7408 | . . . . 5 ⊢ 1 ∈ ℝ | |
7 | leaddsub2 7838 | . . . . 5 ⊢ ((𝑀 ∈ ℝ ∧ 1 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((𝑀 + 1) ≤ 𝑁 ↔ 1 ≤ (𝑁 − 𝑀))) | |
8 | 6, 7 | mp3an2 1259 | . . . 4 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((𝑀 + 1) ≤ 𝑁 ↔ 1 ≤ (𝑁 − 𝑀))) |
9 | 4, 5, 8 | syl2an 283 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 + 1) ≤ 𝑁 ↔ 1 ≤ (𝑁 − 𝑀))) |
10 | 2, 3, 9 | 3imtr4d 201 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 → (𝑀 + 1) ≤ 𝑁)) |
11 | 4 | adantr 270 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑀 ∈ ℝ) |
12 | 11 | ltp1d 8303 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑀 < (𝑀 + 1)) |
13 | peano2re 7539 | . . . . 5 ⊢ (𝑀 ∈ ℝ → (𝑀 + 1) ∈ ℝ) | |
14 | 11, 13 | syl 14 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 + 1) ∈ ℝ) |
15 | 5 | adantl 271 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → 𝑁 ∈ ℝ) |
16 | ltletr 7495 | . . . 4 ⊢ ((𝑀 ∈ ℝ ∧ (𝑀 + 1) ∈ ℝ ∧ 𝑁 ∈ ℝ) → ((𝑀 < (𝑀 + 1) ∧ (𝑀 + 1) ≤ 𝑁) → 𝑀 < 𝑁)) | |
17 | 11, 14, 15, 16 | syl3anc 1172 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 < (𝑀 + 1) ∧ (𝑀 + 1) ≤ 𝑁) → 𝑀 < 𝑁)) |
18 | 12, 17 | mpand 420 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 + 1) ≤ 𝑁 → 𝑀 < 𝑁)) |
19 | 10, 18 | impbid 127 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 ↔ (𝑀 + 1) ≤ 𝑁)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 ↔ wb 103 ∈ wcel 1436 class class class wbr 3814 (class class class)co 5594 ℝcr 7270 1c1 7272 + caddc 7274 < clt 7443 ≤ cle 7444 − cmin 7574 ℕcn 8334 ℤcz 8660 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 577 ax-in2 578 ax-io 663 ax-5 1379 ax-7 1380 ax-gen 1381 ax-ie1 1425 ax-ie2 1426 ax-8 1438 ax-10 1439 ax-11 1440 ax-i12 1441 ax-bndl 1442 ax-4 1443 ax-13 1447 ax-14 1448 ax-17 1462 ax-i9 1466 ax-ial 1470 ax-i5r 1471 ax-ext 2067 ax-sep 3925 ax-pow 3977 ax-pr 4003 ax-un 4227 ax-setind 4319 ax-cnex 7357 ax-resscn 7358 ax-1cn 7359 ax-1re 7360 ax-icn 7361 ax-addcl 7362 ax-addrcl 7363 ax-mulcl 7364 ax-addcom 7366 ax-addass 7368 ax-distr 7370 ax-i2m1 7371 ax-0lt1 7372 ax-0id 7374 ax-rnegex 7375 ax-cnre 7377 ax-pre-ltirr 7378 ax-pre-ltwlin 7379 ax-pre-lttrn 7380 ax-pre-ltadd 7382 |
This theorem depends on definitions: df-bi 115 df-3or 923 df-3an 924 df-tru 1290 df-fal 1293 df-nf 1393 df-sb 1690 df-eu 1948 df-mo 1949 df-clab 2072 df-cleq 2078 df-clel 2081 df-nfc 2214 df-ne 2252 df-nel 2347 df-ral 2360 df-rex 2361 df-reu 2362 df-rab 2364 df-v 2616 df-sbc 2829 df-dif 2988 df-un 2990 df-in 2992 df-ss 2999 df-pw 3411 df-sn 3431 df-pr 3432 df-op 3434 df-uni 3631 df-int 3666 df-br 3815 df-opab 3869 df-id 4087 df-xp 4410 df-rel 4411 df-cnv 4412 df-co 4413 df-dm 4414 df-iota 4937 df-fun 4974 df-fv 4980 df-riota 5550 df-ov 5597 df-oprab 5598 df-mpt2 5599 df-pnf 7445 df-mnf 7446 df-xr 7447 df-ltxr 7448 df-le 7449 df-sub 7576 df-neg 7577 df-inn 8335 df-n0 8584 df-z 8661 |
This theorem is referenced by: zleltp1 8715 zlem1lt 8716 zgt0ge1 8718 nnltp1le 8720 nn0ltp1le 8722 btwnnz 8750 uzind2 8768 fzind 8771 eluzp1l 8952 eluz2b1 8997 zltaddlt1le 9332 fzsplit2 9373 m1modge3gt1 9681 ibcval5 10020 nn0o1gt2 10699 divalglemnqt 10714 zsupcllemstep 10735 infssuzex 10739 isprm3 10894 dvdsnprmd 10901 prmgt1 10907 oddprmge3 10910 znege1 10950 hashdvds 10991 |
Copyright terms: Public domain | W3C validator |