| 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 13458 | . . 3 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) → (𝑁 + 1) ≤ 𝑁) | |
| 2 | elfzel2 13452 | . . . . 5 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) → 𝑁 ∈ ℤ) | |
| 3 | 2 | zred 12610 | . . . 4 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) → 𝑁 ∈ ℝ) |
| 4 | ltp1 11995 | . . . . 5 ⊢ (𝑁 ∈ ℝ → 𝑁 < (𝑁 + 1)) | |
| 5 | peano2re 11320 | . . . . . 6 ⊢ (𝑁 ∈ ℝ → (𝑁 + 1) ∈ ℝ) | |
| 6 | ltnle 11226 | . . . . . 6 ⊢ ((𝑁 ∈ ℝ ∧ (𝑁 + 1) ∈ ℝ) → (𝑁 < (𝑁 + 1) ↔ ¬ (𝑁 + 1) ≤ 𝑁)) | |
| 7 | 5, 6 | mpdan 688 | . . . . 5 ⊢ (𝑁 ∈ ℝ → (𝑁 < (𝑁 + 1) ↔ ¬ (𝑁 + 1) ≤ 𝑁)) |
| 8 | 4, 7 | mpbid 232 | . . . 4 ⊢ (𝑁 ∈ ℝ → ¬ (𝑁 + 1) ≤ 𝑁) |
| 9 | 3, 8 | syl 17 | . . 3 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) → ¬ (𝑁 + 1) ≤ 𝑁) |
| 10 | 1, 9 | pm2.65i 194 | . 2 ⊢ ¬ (𝑁 + 1) ∈ (𝑀...𝑁) |
| 11 | disjsn 4670 | . 2 ⊢ (((𝑀...𝑁) ∩ {(𝑁 + 1)}) = ∅ ↔ ¬ (𝑁 + 1) ∈ (𝑀...𝑁)) | |
| 12 | 10, 11 | mpbir 231 | 1 ⊢ ((𝑀...𝑁) ∩ {(𝑁 + 1)}) = ∅ |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 ↔ wb 206 = wceq 1542 ∈ wcel 2114 ∩ cin 3902 ∅c0 4287 {csn 4582 class class class wbr 5100 (class class class)co 7370 ℝcr 11039 1c1 11041 + caddc 11043 < clt 11180 ≤ cle 11181 ...cfz 13437 |
| 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 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 ax-pre-mulgt0 11117 |
| 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 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5529 df-po 5542 df-so 5543 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-1st 7945 df-2nd 7946 df-er 8647 df-en 8898 df-dom 8899 df-sdom 8900 df-pnf 11182 df-mnf 11183 df-xr 11184 df-ltxr 11185 df-le 11186 df-sub 11380 df-neg 11381 df-z 12503 df-uz 12766 df-fz 13438 |
| This theorem is referenced by: fzdifsuc 13514 fseq1p1m1 13528 fzennn 13905 gsummptfzsplit 19878 telgsumfzslem 19934 imasdsf1olem 24334 wlkp1 29771 esumfzf 34253 subfacp1lem6 35407 mapfzcons 43102 mapfzcons1 43103 mapfzcons2 43105 sge0p1 46801 |
| Copyright terms: Public domain | W3C validator |