| 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 10263 | . . 3 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) → (𝑁 + 1) ≤ 𝑁) | |
| 2 | elfzel2 10258 | . . . 4 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) → 𝑁 ∈ ℤ) | |
| 3 | zre 9483 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
| 4 | 3 | ltp1d 9110 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 < (𝑁 + 1)) |
| 5 | peano2z 9515 | . . . . . 6 ⊢ (𝑁 ∈ ℤ → (𝑁 + 1) ∈ ℤ) | |
| 6 | zltnle 9525 | . . . . . 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 3731 | . 2 ⊢ (((𝑀...𝑁) ∩ {(𝑁 + 1)}) = ∅ ↔ ¬ (𝑁 + 1) ∈ (𝑀...𝑁)) | |
| 12 | 10, 11 | mpbir 146 | 1 ⊢ ((𝑀...𝑁) ∩ {(𝑁 + 1)}) = ∅ |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 ↔ wb 105 = wceq 1397 ∈ wcel 2202 ∩ cin 3199 ∅c0 3494 {csn 3669 class class class wbr 4088 (class class class)co 6018 1c1 8033 + caddc 8035 < clt 8214 ≤ cle 8215 ℤcz 9479 ...cfz 10243 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-addass 8134 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-0id 8140 ax-rnegex 8141 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-ltadd 8148 |
| This theorem depends on definitions: df-bi 117 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-inn 9144 df-n0 9403 df-z 9480 df-uz 9756 df-fz 10244 |
| This theorem is referenced by: fseq1p1m1 10329 frecfzennn 10688 zfz1isolem1 11104 gfsump1 16689 |
| Copyright terms: Public domain | W3C validator |