![]() |
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 13559 | . . 3 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) → (𝑁 + 1) ≤ 𝑁) | |
2 | elfzel2 13553 | . . . . 5 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) → 𝑁 ∈ ℤ) | |
3 | 2 | zred 12718 | . . . 4 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) → 𝑁 ∈ ℝ) |
4 | ltp1 12105 | . . . . 5 ⊢ (𝑁 ∈ ℝ → 𝑁 < (𝑁 + 1)) | |
5 | peano2re 11437 | . . . . . 6 ⊢ (𝑁 ∈ ℝ → (𝑁 + 1) ∈ ℝ) | |
6 | ltnle 11343 | . . . . . 6 ⊢ ((𝑁 ∈ ℝ ∧ (𝑁 + 1) ∈ ℝ) → (𝑁 < (𝑁 + 1) ↔ ¬ (𝑁 + 1) ≤ 𝑁)) | |
7 | 5, 6 | mpdan 685 | . . . . 5 ⊢ (𝑁 ∈ ℝ → (𝑁 < (𝑁 + 1) ↔ ¬ (𝑁 + 1) ≤ 𝑁)) |
8 | 4, 7 | mpbid 231 | . . . 4 ⊢ (𝑁 ∈ ℝ → ¬ (𝑁 + 1) ≤ 𝑁) |
9 | 3, 8 | syl 17 | . . 3 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) → ¬ (𝑁 + 1) ≤ 𝑁) |
10 | 1, 9 | pm2.65i 193 | . 2 ⊢ ¬ (𝑁 + 1) ∈ (𝑀...𝑁) |
11 | disjsn 4720 | . 2 ⊢ (((𝑀...𝑁) ∩ {(𝑁 + 1)}) = ∅ ↔ ¬ (𝑁 + 1) ∈ (𝑀...𝑁)) | |
12 | 10, 11 | mpbir 230 | 1 ⊢ ((𝑀...𝑁) ∩ {(𝑁 + 1)}) = ∅ |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 205 = wceq 1534 ∈ wcel 2099 ∩ cin 3946 ∅c0 4325 {csn 4633 class class class wbr 5153 (class class class)co 7424 ℝcr 11157 1c1 11159 + caddc 11161 < clt 11298 ≤ cle 11299 ...cfz 13538 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2697 ax-sep 5304 ax-nul 5311 ax-pow 5369 ax-pr 5433 ax-un 7746 ax-cnex 11214 ax-resscn 11215 ax-1cn 11216 ax-icn 11217 ax-addcl 11218 ax-addrcl 11219 ax-mulcl 11220 ax-mulrcl 11221 ax-mulcom 11222 ax-addass 11223 ax-mulass 11224 ax-distr 11225 ax-i2m1 11226 ax-1ne0 11227 ax-1rid 11228 ax-rnegex 11229 ax-rrecex 11230 ax-cnre 11231 ax-pre-lttri 11232 ax-pre-lttrn 11233 ax-pre-ltadd 11234 ax-pre-mulgt0 11235 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2704 df-cleq 2718 df-clel 2803 df-nfc 2878 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-reu 3365 df-rab 3420 df-v 3464 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4326 df-if 4534 df-pw 4609 df-sn 4634 df-pr 4636 df-op 4640 df-uni 4914 df-iun 5003 df-br 5154 df-opab 5216 df-mpt 5237 df-id 5580 df-po 5594 df-so 5595 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-iota 6506 df-fun 6556 df-fn 6557 df-f 6558 df-f1 6559 df-fo 6560 df-f1o 6561 df-fv 6562 df-riota 7380 df-ov 7427 df-oprab 7428 df-mpo 7429 df-1st 8003 df-2nd 8004 df-er 8734 df-en 8975 df-dom 8976 df-sdom 8977 df-pnf 11300 df-mnf 11301 df-xr 11302 df-ltxr 11303 df-le 11304 df-sub 11496 df-neg 11497 df-z 12611 df-uz 12875 df-fz 13539 |
This theorem is referenced by: fzdifsuc 13615 fseq1p1m1 13629 fzennn 13988 gsummptfzsplit 19930 telgsumfzslem 19986 imasdsf1olem 24370 wlkp1 29618 esumfzf 33902 subfacp1lem6 35013 mapfzcons 42373 mapfzcons1 42374 mapfzcons2 42376 sge0p1 46035 |
Copyright terms: Public domain | W3C validator |