| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uzp1 | Structured version Visualization version GIF version | ||
| Description: Choices for an element of an upper interval of integers. (Contributed by Jeff Madsen, 2-Sep-2009.) |
| Ref | Expression |
|---|---|
| uzp1 | ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 = 𝑀 ∨ 𝑁 ∈ (ℤ≥‘(𝑀 + 1)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uzm1 12790 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 = 𝑀 ∨ (𝑁 − 1) ∈ (ℤ≥‘𝑀))) | |
| 2 | eluzp1p1 12784 | . . . 4 ⊢ ((𝑁 − 1) ∈ (ℤ≥‘𝑀) → ((𝑁 − 1) + 1) ∈ (ℤ≥‘(𝑀 + 1))) | |
| 3 | eluzelcn 12768 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℂ) | |
| 4 | ax-1cn 11089 | . . . . . 6 ⊢ 1 ∈ ℂ | |
| 5 | npcan 11394 | . . . . . 6 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 − 1) + 1) = 𝑁) | |
| 6 | 3, 4, 5 | sylancl 587 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑁 − 1) + 1) = 𝑁) |
| 7 | 6 | eleq1d 2822 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (((𝑁 − 1) + 1) ∈ (ℤ≥‘(𝑀 + 1)) ↔ 𝑁 ∈ (ℤ≥‘(𝑀 + 1)))) |
| 8 | 2, 7 | imbitrid 244 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑁 − 1) ∈ (ℤ≥‘𝑀) → 𝑁 ∈ (ℤ≥‘(𝑀 + 1)))) |
| 9 | 8 | orim2d 969 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑁 = 𝑀 ∨ (𝑁 − 1) ∈ (ℤ≥‘𝑀)) → (𝑁 = 𝑀 ∨ 𝑁 ∈ (ℤ≥‘(𝑀 + 1))))) |
| 10 | 1, 9 | mpd 15 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 = 𝑀 ∨ 𝑁 ∈ (ℤ≥‘(𝑀 + 1)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 848 = wceq 1542 ∈ wcel 2114 ‘cfv 6493 (class class class)co 7361 ℂcc 11029 1c1 11032 + caddc 11034 − cmin 11369 ℤ≥cuz 12756 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7683 ax-cnex 11087 ax-resscn 11088 ax-1cn 11089 ax-icn 11090 ax-addcl 11091 ax-addrcl 11092 ax-mulcl 11093 ax-mulrcl 11094 ax-mulcom 11095 ax-addass 11096 ax-mulass 11097 ax-distr 11098 ax-i2m1 11099 ax-1ne0 11100 ax-1rid 11101 ax-rnegex 11102 ax-rrecex 11103 ax-cnre 11104 ax-pre-lttri 11105 ax-pre-lttrn 11106 ax-pre-ltadd 11107 ax-pre-mulgt0 11108 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-2nd 7937 df-frecs 8226 df-wrecs 8257 df-recs 8306 df-rdg 8344 df-er 8638 df-en 8889 df-dom 8890 df-sdom 8891 df-pnf 11173 df-mnf 11174 df-xr 11175 df-ltxr 11176 df-le 11177 df-sub 11371 df-neg 11372 df-nn 12151 df-n0 12407 df-z 12494 df-uz 12757 |
| This theorem is referenced by: fzsuc2 13503 fldiv4p1lem1div2 13760 seqid 13975 seqz 13978 hashfzp1 14359 telfsumo 15730 fsumparts 15734 isumsplit 15768 prmlem0 17038 efgredlemc 19679 chtub 27184 numclwlk1 30451 incsequz2 37963 jm2.23 43316 fmul01lt1lem1 45907 wallispilem3 46388 2ltceilhalf 47651 |
| Copyright terms: Public domain | W3C validator |