Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fzp1nel | Structured version Visualization version GIF version |
Description: One plus the upper bound of a finite set of integers is not a member of that set. (Contributed by Scott Fenton, 16-Dec-2017.) |
Ref | Expression |
---|---|
fzp1nel | ⊢ ¬ (𝑁 + 1) ∈ (𝑀...𝑁) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | zre 12180 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
2 | ltp1 11672 | . . . . . 6 ⊢ (𝑁 ∈ ℝ → 𝑁 < (𝑁 + 1)) | |
3 | id 22 | . . . . . . 7 ⊢ (𝑁 ∈ ℝ → 𝑁 ∈ ℝ) | |
4 | peano2re 11005 | . . . . . . 7 ⊢ (𝑁 ∈ ℝ → (𝑁 + 1) ∈ ℝ) | |
5 | 3, 4 | ltnled 10979 | . . . . . 6 ⊢ (𝑁 ∈ ℝ → (𝑁 < (𝑁 + 1) ↔ ¬ (𝑁 + 1) ≤ 𝑁)) |
6 | 2, 5 | mpbid 235 | . . . . 5 ⊢ (𝑁 ∈ ℝ → ¬ (𝑁 + 1) ≤ 𝑁) |
7 | 1, 6 | syl 17 | . . . 4 ⊢ (𝑁 ∈ ℤ → ¬ (𝑁 + 1) ≤ 𝑁) |
8 | 7 | intnand 492 | . . 3 ⊢ (𝑁 ∈ ℤ → ¬ (𝑀 ≤ (𝑁 + 1) ∧ (𝑁 + 1) ≤ 𝑁)) |
9 | 8 | 3ad2ant2 1136 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ (𝑁 + 1) ∈ ℤ) → ¬ (𝑀 ≤ (𝑁 + 1) ∧ (𝑁 + 1) ≤ 𝑁)) |
10 | elfz2 13102 | . . . 4 ⊢ ((𝑁 + 1) ∈ (𝑀...𝑁) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ (𝑁 + 1) ∈ ℤ) ∧ (𝑀 ≤ (𝑁 + 1) ∧ (𝑁 + 1) ≤ 𝑁))) | |
11 | 10 | notbii 323 | . . 3 ⊢ (¬ (𝑁 + 1) ∈ (𝑀...𝑁) ↔ ¬ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ (𝑁 + 1) ∈ ℤ) ∧ (𝑀 ≤ (𝑁 + 1) ∧ (𝑁 + 1) ≤ 𝑁))) |
12 | imnan 403 | . . 3 ⊢ (((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ (𝑁 + 1) ∈ ℤ) → ¬ (𝑀 ≤ (𝑁 + 1) ∧ (𝑁 + 1) ≤ 𝑁)) ↔ ¬ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ (𝑁 + 1) ∈ ℤ) ∧ (𝑀 ≤ (𝑁 + 1) ∧ (𝑁 + 1) ≤ 𝑁))) | |
13 | 11, 12 | bitr4i 281 | . 2 ⊢ (¬ (𝑁 + 1) ∈ (𝑀...𝑁) ↔ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ (𝑁 + 1) ∈ ℤ) → ¬ (𝑀 ≤ (𝑁 + 1) ∧ (𝑁 + 1) ≤ 𝑁))) |
14 | 9, 13 | mpbir 234 | 1 ⊢ ¬ (𝑁 + 1) ∈ (𝑀...𝑁) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 ∧ w3a 1089 ∈ wcel 2110 class class class wbr 5053 (class class class)co 7213 ℝcr 10728 1c1 10730 + caddc 10732 < clt 10867 ≤ cle 10868 ℤcz 12176 ...cfz 13095 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 ax-sep 5192 ax-nul 5199 ax-pow 5258 ax-pr 5322 ax-un 7523 ax-cnex 10785 ax-resscn 10786 ax-1cn 10787 ax-icn 10788 ax-addcl 10789 ax-addrcl 10790 ax-mulcl 10791 ax-mulrcl 10792 ax-mulcom 10793 ax-addass 10794 ax-mulass 10795 ax-distr 10796 ax-i2m1 10797 ax-1ne0 10798 ax-1rid 10799 ax-rnegex 10800 ax-rrecex 10801 ax-cnre 10802 ax-pre-lttri 10803 ax-pre-lttrn 10804 ax-pre-ltadd 10805 ax-pre-mulgt0 10806 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2886 df-ne 2941 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rab 3070 df-v 3410 df-sbc 3695 df-csb 3812 df-dif 3869 df-un 3871 df-in 3873 df-ss 3883 df-nul 4238 df-if 4440 df-pw 4515 df-sn 4542 df-pr 4544 df-op 4548 df-uni 4820 df-iun 4906 df-br 5054 df-opab 5116 df-mpt 5136 df-id 5455 df-po 5468 df-so 5469 df-xp 5557 df-rel 5558 df-cnv 5559 df-co 5560 df-dm 5561 df-rn 5562 df-res 5563 df-ima 5564 df-iota 6338 df-fun 6382 df-fn 6383 df-f 6384 df-f1 6385 df-fo 6386 df-f1o 6387 df-fv 6388 df-riota 7170 df-ov 7216 df-oprab 7217 df-mpo 7218 df-1st 7761 df-2nd 7762 df-er 8391 df-en 8627 df-dom 8628 df-sdom 8629 df-pnf 10869 df-mnf 10870 df-xr 10871 df-ltxr 10872 df-le 10873 df-sub 11064 df-neg 11065 df-z 12177 df-fz 13096 |
This theorem is referenced by: fprodm1 15529 gsumzaddlem 19306 wlkp1lem1 27761 wlkp1lem5 27765 fwddifnp1 34204 caratheodorylem1 43739 |
Copyright terms: Public domain | W3C validator |