| 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 12817 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 = 𝑀 ∨ (𝑁 − 1) ∈ (ℤ≥‘𝑀))) | |
| 2 | eluzp1p1 12811 | . . . 4 ⊢ ((𝑁 − 1) ∈ (ℤ≥‘𝑀) → ((𝑁 − 1) + 1) ∈ (ℤ≥‘(𝑀 + 1))) | |
| 3 | eluzelcn 12795 | . . . . . 6 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝑁 ∈ ℂ) | |
| 4 | ax-1cn 11092 | . . . . . 6 ⊢ 1 ∈ ℂ | |
| 5 | npcan 11398 | . . . . . 6 ⊢ ((𝑁 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑁 − 1) + 1) = 𝑁) | |
| 6 | 3, 4, 5 | sylancl 593 | . . . . 5 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑁 − 1) + 1) = 𝑁) |
| 7 | 6 | eleq1d 2826 | . . . 4 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (((𝑁 − 1) + 1) ∈ (ℤ≥‘(𝑀 + 1)) ↔ 𝑁 ∈ (ℤ≥‘(𝑀 + 1)))) |
| 8 | 2, 7 | imbitrid 246 | . . 3 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑁 − 1) ∈ (ℤ≥‘𝑀) → 𝑁 ∈ (ℤ≥‘(𝑀 + 1)))) |
| 9 | 8 | orim2d 975 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → ((𝑁 = 𝑀 ∨ (𝑁 − 1) ∈ (ℤ≥‘𝑀)) → (𝑁 = 𝑀 ∨ 𝑁 ∈ (ℤ≥‘(𝑀 + 1))))) |
| 10 | 1, 9 | mpd 15 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 = 𝑀 ∨ 𝑁 ∈ (ℤ≥‘(𝑀 + 1)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 854 = wceq 1548 ∈ wcel 2121 ‘cfv 6488 (class class class)co 7359 ℂcc 11032 1c1 11035 + caddc 11037 − cmin 11373 ℤ≥cuz 12783 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7681 ax-cnex 11090 ax-resscn 11091 ax-1cn 11092 ax-icn 11093 ax-addcl 11094 ax-addrcl 11095 ax-mulcl 11096 ax-mulrcl 11097 ax-mulcom 11098 ax-addass 11099 ax-mulass 11100 ax-distr 11101 ax-i2m1 11102 ax-1ne0 11103 ax-1rid 11104 ax-rnegex 11105 ax-rrecex 11106 ax-cnre 11107 ax-pre-lttri 11108 ax-pre-lttrn 11109 ax-pre-ltadd 11110 ax-pre-mulgt0 11111 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3725 df-csb 3833 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-pss 3904 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6255 df-ord 6316 df-on 6317 df-lim 6318 df-suc 6319 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-riota 7316 df-ov 7362 df-oprab 7363 df-mpo 7364 df-om 7810 df-2nd 7934 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8343 df-er 8637 df-en 8888 df-dom 8889 df-sdom 8890 df-pnf 11177 df-mnf 11178 df-xr 11179 df-ltxr 11180 df-le 11181 df-sub 11375 df-neg 11376 df-nn 12170 df-n0 12433 df-z 12520 df-uz 12784 |
| This theorem is referenced by: fzsuc2 13531 fldiv4p1lem1div2 13789 seqid 14004 seqz 14007 hashfzp1 14388 telfsumo 15760 fsumparts 15764 isumsplit 15800 prmlem0 17071 efgredlemc 19714 chtub 27196 numclwlk1 30461 incsequz2 38129 jm2.23 43454 fmul01lt1lem1 46041 wallispilem3 46522 2ltceilhalf 47807 ppivalnnnprm 48118 |
| Copyright terms: Public domain | W3C validator |