| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fzp1disj | 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 10368 | . . 3 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) → (𝑁 + 1) ≤ 𝑁) | |
| 2 | elfzel2 10363 | . . . 4 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) → 𝑁 ∈ ℤ) | |
| 3 | zre 9586 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
| 4 | 3 | ltp1d 9209 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 < (𝑁 + 1)) |
| 5 | peano2z 9618 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → (𝑁 + 1) ∈ ℤ) | |
| 6 | zltnle 9628 | . . . . . 6 ⊢ ((𝑁 ∈ ℤ ∧ (𝑁 + 1) ∈ ℤ) → (𝑁 < (𝑁 + 1) ↔ ¬ (𝑁 + 1) ≤ 𝑁)) | |
| 7 | 5, 6 | mpdan 421 | . . . . 5 ⊢ (𝑁 ∈ ℤ → (𝑁 < (𝑁 + 1) ↔ ¬ (𝑁 + 1) ≤ 𝑁)) |
| 8 | 4, 7 | mpbid 147 | . . . 4 ⊢ (𝑁 ∈ ℤ → ¬ (𝑁 + 1) ≤ 𝑁) |
| 9 | 2, 8 | syl 14 | . . 3 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) → ¬ (𝑁 + 1) ≤ 𝑁) |
| 10 | 1, 9 | pm2.65i 644 | . 2 ⊢ ¬ (𝑁 + 1) ∈ (𝑀...𝑁) |
| 11 | disjsn 3753 | . 2 ⊢ (((𝑀...𝑁) ∩ {(𝑁 + 1)}) = ∅ ↔ ¬ (𝑁 + 1) ∈ (𝑀...𝑁)) | |
| 12 | 10, 11 | mpbir 146 | 1 ⊢ ((𝑀...𝑁) ∩ {(𝑁 + 1)}) = ∅ |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 ↔ wb 105 = wceq 1398 ∈ wcel 2205 ∩ cin 3212 ∅c0 3510 {csn 3691 class class class wbr 4111 (class class class)co 6052 1c1 8133 + caddc 8135 < clt 8313 ≤ cle 8314 ℤcz 9582 ...cfz 10348 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4230 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-cnex 8223 ax-resscn 8224 ax-1cn 8225 ax-1re 8226 ax-icn 8227 ax-addcl 8228 ax-addrcl 8229 ax-mulcl 8230 ax-addcom 8232 ax-addass 8234 ax-distr 8236 ax-i2m1 8237 ax-0lt1 8238 ax-0id 8240 ax-rnegex 8241 ax-cnre 8243 ax-pre-ltirr 8244 ax-pre-ltwlin 8245 ax-pre-lttrn 8246 ax-pre-ltadd 8248 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3045 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-nul 3511 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-br 4112 df-opab 4174 df-mpt 4175 df-id 4416 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-fv 5362 df-riota 6005 df-ov 6055 df-oprab 6056 df-mpo 6057 df-pnf 8315 df-mnf 8316 df-xr 8317 df-ltxr 8318 df-le 8319 df-sub 8451 df-neg 8452 df-inn 9243 df-n0 9502 df-z 9583 df-uz 9860 df-fz 10349 |
| This theorem is referenced by: fseq1p1m1 10435 frecfzennn 10795 zfz1isolem1 11220 gfsump1 16917 |
| Copyright terms: Public domain | W3C validator |