| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fzp1disj | Structured version Visualization version GIF version | ||
| Description: (𝑀...(𝑁 + 1)) is the disjoint union of (𝑀...𝑁) with {(𝑁 + 1)}. (Contributed by Mario Carneiro, 7-Mar-2014.) |
| Ref | Expression |
|---|---|
| fzp1disj | ⊢ ((𝑀...𝑁) ∩ {(𝑁 + 1)}) = ∅ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elfzle2 13629 | . . 3 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) → (𝑁 + 1) ≤ 𝑁) | |
| 2 | elfzel2 13623 | . . . . 5 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) → 𝑁 ∈ ℤ) | |
| 3 | 2 | zred 12772 | . . . 4 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) → 𝑁 ∈ ℝ) |
| 4 | ltp1 12126 | . . . . 5 ⊢ (𝑁 ∈ ℝ → 𝑁 < (𝑁 + 1)) | |
| 5 | peano2re 11454 | . . . . . 6 ⊢ (𝑁 ∈ ℝ → (𝑁 + 1) ∈ ℝ) | |
| 6 | ltnle 11360 | . . . . . 6 ⊢ ((𝑁 ∈ ℝ ∧ (𝑁 + 1) ∈ ℝ) → (𝑁 < (𝑁 + 1) ↔ ¬ (𝑁 + 1) ≤ 𝑁)) | |
| 7 | 5, 6 | mpdan 700 | . . . . 5 ⊢ (𝑁 ∈ ℝ → (𝑁 < (𝑁 + 1) ↔ ¬ (𝑁 + 1) ≤ 𝑁)) |
| 8 | 4, 7 | mpbid 235 | . . . 4 ⊢ (𝑁 ∈ ℝ → ¬ (𝑁 + 1) ≤ 𝑁) |
| 9 | 3, 8 | syl 18 | . . 3 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) → ¬ (𝑁 + 1) ≤ 𝑁) |
| 10 | 1, 9 | pm2.65i 196 | . 2 ⊢ ¬ (𝑁 + 1) ∈ (𝑀...𝑁) |
| 11 | disjsn 4671 | . 2 ⊢ (((𝑀...𝑁) ∩ {(𝑁 + 1)}) = ∅ ↔ ¬ (𝑁 + 1) ∈ (𝑀...𝑁)) | |
| 12 | 10, 11 | mpbir 234 | 1 ⊢ ((𝑀...𝑁) ∩ {(𝑁 + 1)}) = ∅ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 = wceq 1570 ∈ wcel 2145 ∩ cin 3897 ∅c0 4278 {csn 4583 class class class wbr 5102 (class class class)co 7408 ℝcr 11170 1c1 11172 + caddc 11174 < clt 11314 ≤ cle 11315 ...cfz 13608 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7734 ax-cnex 11227 ax-resscn 11228 ax-1cn 11229 ax-icn 11230 ax-addcl 11231 ax-addrcl 11232 ax-mulcl 11233 ax-mulrcl 11234 ax-mulcom 11235 ax-addass 11236 ax-mulass 11237 ax-distr 11238 ax-i2m1 11239 ax-1ne0 11240 ax-1rid 11241 ax-rnegex 11242 ax-rrecex 11243 ax-cnre 11244 ax-pre-lttri 11245 ax-pre-lttrn 11246 ax-pre-ltadd 11247 ax-pre-mulgt0 11248 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-po 5555 df-so 5556 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-1st 7984 df-2nd 7985 df-er 8695 df-en 8952 df-dom 8953 df-sdom 8954 df-pnf 11316 df-mnf 11317 df-xr 11318 df-ltxr 11319 df-le 11320 df-sub 11514 df-neg 11515 df-z 12663 df-uz 12935 df-fz 13609 |
| This theorem is used by: fzdifsuc 13686 fseq1p1m1 13700 fzennn 14079 gsummptfzsplit 20107 telgsumfzslem 20163 imasdsf1olem 24653 wlkp1 30193 esumfzf 34634 subfacp1lem6 35871 mapfzcons 43665 mapfzcons1 43666 mapfzcons2 43668 sge0p1 47346 |
| Copyright terms: Public domain | W3C validator |