![]() |
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 13445 | . . 3 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) → (𝑁 + 1) ≤ 𝑁) | |
2 | elfzel2 13439 | . . . . 5 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) → 𝑁 ∈ ℤ) | |
3 | 2 | zred 12607 | . . . 4 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) → 𝑁 ∈ ℝ) |
4 | ltp1 11995 | . . . . 5 ⊢ (𝑁 ∈ ℝ → 𝑁 < (𝑁 + 1)) | |
5 | peano2re 11328 | . . . . . 6 ⊢ (𝑁 ∈ ℝ → (𝑁 + 1) ∈ ℝ) | |
6 | ltnle 11234 | . . . . . 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 4672 | . 2 ⊢ (((𝑀...𝑁) ∩ {(𝑁 + 1)}) = ∅ ↔ ¬ (𝑁 + 1) ∈ (𝑀...𝑁)) | |
12 | 10, 11 | mpbir 230 | 1 ⊢ ((𝑀...𝑁) ∩ {(𝑁 + 1)}) = ∅ |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 205 = wceq 1541 ∈ wcel 2106 ∩ cin 3909 ∅c0 4282 {csn 4586 class class class wbr 5105 (class class class)co 7357 ℝcr 11050 1c1 11052 + caddc 11054 < clt 11189 ≤ cle 11190 ...cfz 13424 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7672 ax-cnex 11107 ax-resscn 11108 ax-1cn 11109 ax-icn 11110 ax-addcl 11111 ax-addrcl 11112 ax-mulcl 11113 ax-mulrcl 11114 ax-mulcom 11115 ax-addass 11116 ax-mulass 11117 ax-distr 11118 ax-i2m1 11119 ax-1ne0 11120 ax-1rid 11121 ax-rnegex 11122 ax-rrecex 11123 ax-cnre 11124 ax-pre-lttri 11125 ax-pre-lttrn 11126 ax-pre-ltadd 11127 ax-pre-mulgt0 11128 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3065 df-rex 3074 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-id 5531 df-po 5545 df-so 5546 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-riota 7313 df-ov 7360 df-oprab 7361 df-mpo 7362 df-1st 7921 df-2nd 7922 df-er 8648 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11191 df-mnf 11192 df-xr 11193 df-ltxr 11194 df-le 11195 df-sub 11387 df-neg 11388 df-z 12500 df-uz 12764 df-fz 13425 |
This theorem is referenced by: fzdifsuc 13501 fseq1p1m1 13515 fzennn 13873 gsummptfzsplit 19709 telgsumfzslem 19765 imasdsf1olem 23726 wlkp1 28629 esumfzf 32668 subfacp1lem6 33779 mapfzcons 41025 mapfzcons1 41026 mapfzcons2 41028 sge0p1 44645 |
Copyright terms: Public domain | W3C validator |