| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fzn | Structured version Visualization version GIF version | ||
| Description: A finite set of sequential integers is empty if the bounds are reversed. (Contributed by NM, 22-Aug-2005.) |
| Ref | Expression |
|---|---|
| fzn | ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝑀 ↔ (𝑀...𝑁) = ∅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fzn0 13468 | . . . 4 ⊢ ((𝑀...𝑁) ≠ ∅ ↔ 𝑁 ∈ (ℤ≥‘𝑀)) | |
| 2 | eluz 12779 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 ∈ (ℤ≥‘𝑀) ↔ 𝑀 ≤ 𝑁)) | |
| 3 | 1, 2 | bitrid 283 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀...𝑁) ≠ ∅ ↔ 𝑀 ≤ 𝑁)) |
| 4 | zre 12506 | . . . 4 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ) | |
| 5 | zre 12506 | . . . 4 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
| 6 | lenlt 11225 | . . . 4 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ) → (𝑀 ≤ 𝑁 ↔ ¬ 𝑁 < 𝑀)) | |
| 7 | 4, 5, 6 | syl2an 597 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 ≤ 𝑁 ↔ ¬ 𝑁 < 𝑀)) |
| 8 | 3, 7 | bitr2d 280 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (¬ 𝑁 < 𝑀 ↔ (𝑀...𝑁) ≠ ∅)) |
| 9 | 8 | necon4bbid 2974 | 1 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑁 < 𝑀 ↔ (𝑀...𝑁) = ∅)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∅c0 4287 class class class wbr 5100 ‘cfv 6502 (class class class)co 7370 ℝcr 11039 < clt 11180 ≤ cle 11181 ℤcz 12502 ℤ≥cuz 12765 ...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-pre-lttri 11114 ax-pre-lttrn 11115 |
| 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-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-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-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-neg 11381 df-z 12503 df-uz 12766 df-fz 13438 |
| This theorem is referenced by: fz1n 13472 fz10 13475 fzsuc2 13512 fzm1 13537 fzon 13610 hashfzp1 14368 isumsplit 15777 arisum2 15798 risefall0lem 15963 prmreclem4 16861 prmreclem5 16862 ppi1 27147 cht1 27148 ppiublem2 27187 lgsdir2lem3 27311 wlkv0 29741 chtvalz 34813 fz0n 35953 poimirlem10 37910 poimirlem23 37923 poimirlem28 37928 fdc 38025 mettrifi 38037 sticksstones11 42555 fzisoeu 45691 fzdifsuc2 45701 |
| Copyright terms: Public domain | W3C validator |