| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fzpr | Structured version Visualization version GIF version | ||
| Description: A finite interval of integers with two elements. (Contributed by Jeff Madsen, 2-Sep-2009.) |
| Ref | Expression |
|---|---|
| fzpr | ⊢ (𝑀 ∈ ℤ → (𝑀...(𝑀 + 1)) = {𝑀, (𝑀 + 1)}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uzid 12750 | . . . . 5 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ≥‘𝑀)) | |
| 2 | elfzp1 13477 | . . . . 5 ⊢ (𝑀 ∈ (ℤ≥‘𝑀) → (𝑚 ∈ (𝑀...(𝑀 + 1)) ↔ (𝑚 ∈ (𝑀...𝑀) ∨ 𝑚 = (𝑀 + 1)))) | |
| 3 | 1, 2 | syl 17 | . . . 4 ⊢ (𝑀 ∈ ℤ → (𝑚 ∈ (𝑀...(𝑀 + 1)) ↔ (𝑚 ∈ (𝑀...𝑀) ∨ 𝑚 = (𝑀 + 1)))) |
| 4 | fzsn 13469 | . . . . . . 7 ⊢ (𝑀 ∈ ℤ → (𝑀...𝑀) = {𝑀}) | |
| 5 | 4 | eleq2d 2814 | . . . . . 6 ⊢ (𝑀 ∈ ℤ → (𝑚 ∈ (𝑀...𝑀) ↔ 𝑚 ∈ {𝑀})) |
| 6 | velsn 4593 | . . . . . 6 ⊢ (𝑚 ∈ {𝑀} ↔ 𝑚 = 𝑀) | |
| 7 | 5, 6 | bitrdi 287 | . . . . 5 ⊢ (𝑀 ∈ ℤ → (𝑚 ∈ (𝑀...𝑀) ↔ 𝑚 = 𝑀)) |
| 8 | 7 | orbi1d 916 | . . . 4 ⊢ (𝑀 ∈ ℤ → ((𝑚 ∈ (𝑀...𝑀) ∨ 𝑚 = (𝑀 + 1)) ↔ (𝑚 = 𝑀 ∨ 𝑚 = (𝑀 + 1)))) |
| 9 | 3, 8 | bitrd 279 | . . 3 ⊢ (𝑀 ∈ ℤ → (𝑚 ∈ (𝑀...(𝑀 + 1)) ↔ (𝑚 = 𝑀 ∨ 𝑚 = (𝑀 + 1)))) |
| 10 | vex 3440 | . . . 4 ⊢ 𝑚 ∈ V | |
| 11 | 10 | elpr 4602 | . . 3 ⊢ (𝑚 ∈ {𝑀, (𝑀 + 1)} ↔ (𝑚 = 𝑀 ∨ 𝑚 = (𝑀 + 1))) |
| 12 | 9, 11 | bitr4di 289 | . 2 ⊢ (𝑀 ∈ ℤ → (𝑚 ∈ (𝑀...(𝑀 + 1)) ↔ 𝑚 ∈ {𝑀, (𝑀 + 1)})) |
| 13 | 12 | eqrdv 2727 | 1 ⊢ (𝑀 ∈ ℤ → (𝑀...(𝑀 + 1)) = {𝑀, (𝑀 + 1)}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∨ wo 847 = wceq 1540 ∈ wcel 2109 {csn 4577 {cpr 4579 ‘cfv 6482 (class class class)co 7349 1c1 11010 + caddc 11012 ℤcz 12471 ℤ≥cuz 12735 ...cfz 13410 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 ax-cnex 11065 ax-resscn 11066 ax-1cn 11067 ax-icn 11068 ax-addcl 11069 ax-addrcl 11070 ax-mulcl 11071 ax-mulrcl 11072 ax-mulcom 11073 ax-addass 11074 ax-mulass 11075 ax-distr 11076 ax-i2m1 11077 ax-1ne0 11078 ax-1rid 11079 ax-rnegex 11080 ax-rrecex 11081 ax-cnre 11082 ax-pre-lttri 11083 ax-pre-lttrn 11084 ax-pre-ltadd 11085 ax-pre-mulgt0 11086 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6249 df-ord 6310 df-on 6311 df-lim 6312 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-riota 7306 df-ov 7352 df-oprab 7353 df-mpo 7354 df-om 7800 df-1st 7924 df-2nd 7925 df-frecs 8214 df-wrecs 8245 df-recs 8294 df-rdg 8332 df-er 8625 df-en 8873 df-dom 8874 df-sdom 8875 df-pnf 11151 df-mnf 11152 df-xr 11153 df-ltxr 11154 df-le 11155 df-sub 11349 df-neg 11350 df-nn 12129 df-n0 12385 df-z 12472 df-uz 12736 df-fz 13411 |
| This theorem is referenced by: fztp 13483 fz12pr 13484 fz0to3un2pr 13532 fz0to4untppr 13533 fzo13pr 13652 fzo0to2pr 13653 fz01pr 13654 fzo0to42pr 13656 bpoly2 15964 bpoly3 15965 prmreclem2 16829 gsumprval 18562 m2detleiblem2 22513 uhgrwkspthlem2 29699 poimirlem1 37611 poimirlem8 37618 31prm 47591 nnsum3primes4 47782 nnsum3primesgbe 47786 |
| Copyright terms: Public domain | W3C validator |