Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > elfznelfzob | Structured version Visualization version GIF version |
Description: A value in a finite set of sequential integers is a border value if and only if it is not contained in the half-open integer range contained in the finite set of sequential integers. (Contributed by Alexander van der Vekens, 17-Jan-2018.) |
Ref | Expression |
---|---|
elfznelfzob | ⊢ (𝑦 ∈ (0...𝐾) → (¬ 𝑦 ∈ (1..^𝐾) ↔ (𝑦 = 0 ∨ 𝑦 = 𝐾))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elfznelfzo 12439 | . . 3 ⊢ ((𝑦 ∈ (0...𝐾) ∧ ¬ 𝑦 ∈ (1..^𝐾)) → (𝑦 = 0 ∨ 𝑦 = 𝐾)) | |
2 | 1 | ex 449 | . 2 ⊢ (𝑦 ∈ (0...𝐾) → (¬ 𝑦 ∈ (1..^𝐾) → (𝑦 = 0 ∨ 𝑦 = 𝐾))) |
3 | elfzole1 12347 | . . . . . 6 ⊢ (𝑦 ∈ (1..^𝐾) → 1 ≤ 𝑦) | |
4 | elfzolt2 12348 | . . . . . . 7 ⊢ (𝑦 ∈ (1..^𝐾) → 𝑦 < 𝐾) | |
5 | elfzoel2 12338 | . . . . . . 7 ⊢ (𝑦 ∈ (1..^𝐾) → 𝐾 ∈ ℤ) | |
6 | elfzoelz 12339 | . . . . . . 7 ⊢ (𝑦 ∈ (1..^𝐾) → 𝑦 ∈ ℤ) | |
7 | 0lt1 10429 | . . . . . . . . . . 11 ⊢ 0 < 1 | |
8 | breq1 4586 | . . . . . . . . . . 11 ⊢ (𝑦 = 0 → (𝑦 < 1 ↔ 0 < 1)) | |
9 | 7, 8 | mpbiri 247 | . . . . . . . . . 10 ⊢ (𝑦 = 0 → 𝑦 < 1) |
10 | zre 11258 | . . . . . . . . . . . 12 ⊢ (𝑦 ∈ ℤ → 𝑦 ∈ ℝ) | |
11 | 10 | adantl 481 | . . . . . . . . . . 11 ⊢ (((𝑦 < 𝐾 ∧ 𝐾 ∈ ℤ) ∧ 𝑦 ∈ ℤ) → 𝑦 ∈ ℝ) |
12 | 1red 9934 | . . . . . . . . . . 11 ⊢ (((𝑦 < 𝐾 ∧ 𝐾 ∈ ℤ) ∧ 𝑦 ∈ ℤ) → 1 ∈ ℝ) | |
13 | 11, 12 | ltnled 10063 | . . . . . . . . . 10 ⊢ (((𝑦 < 𝐾 ∧ 𝐾 ∈ ℤ) ∧ 𝑦 ∈ ℤ) → (𝑦 < 1 ↔ ¬ 1 ≤ 𝑦)) |
14 | 9, 13 | syl5ib 233 | . . . . . . . . 9 ⊢ (((𝑦 < 𝐾 ∧ 𝐾 ∈ ℤ) ∧ 𝑦 ∈ ℤ) → (𝑦 = 0 → ¬ 1 ≤ 𝑦)) |
15 | 14 | con2d 128 | . . . . . . . 8 ⊢ (((𝑦 < 𝐾 ∧ 𝐾 ∈ ℤ) ∧ 𝑦 ∈ ℤ) → (1 ≤ 𝑦 → ¬ 𝑦 = 0)) |
16 | zre 11258 | . . . . . . . . . . . . . 14 ⊢ (𝐾 ∈ ℤ → 𝐾 ∈ ℝ) | |
17 | ltlen 10017 | . . . . . . . . . . . . . 14 ⊢ ((𝑦 ∈ ℝ ∧ 𝐾 ∈ ℝ) → (𝑦 < 𝐾 ↔ (𝑦 ≤ 𝐾 ∧ 𝐾 ≠ 𝑦))) | |
18 | 10, 16, 17 | syl2anr 494 | . . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑦 < 𝐾 ↔ (𝑦 ≤ 𝐾 ∧ 𝐾 ≠ 𝑦))) |
19 | necom 2835 | . . . . . . . . . . . . . . 15 ⊢ (𝐾 ≠ 𝑦 ↔ 𝑦 ≠ 𝐾) | |
20 | df-ne 2782 | . . . . . . . . . . . . . . 15 ⊢ (𝑦 ≠ 𝐾 ↔ ¬ 𝑦 = 𝐾) | |
21 | 19, 20 | sylbb 208 | . . . . . . . . . . . . . 14 ⊢ (𝐾 ≠ 𝑦 → ¬ 𝑦 = 𝐾) |
22 | 21 | adantl 481 | . . . . . . . . . . . . 13 ⊢ ((𝑦 ≤ 𝐾 ∧ 𝐾 ≠ 𝑦) → ¬ 𝑦 = 𝐾) |
23 | 18, 22 | syl6bi 242 | . . . . . . . . . . . 12 ⊢ ((𝐾 ∈ ℤ ∧ 𝑦 ∈ ℤ) → (𝑦 < 𝐾 → ¬ 𝑦 = 𝐾)) |
24 | 23 | ex 449 | . . . . . . . . . . 11 ⊢ (𝐾 ∈ ℤ → (𝑦 ∈ ℤ → (𝑦 < 𝐾 → ¬ 𝑦 = 𝐾))) |
25 | 24 | com23 84 | . . . . . . . . . 10 ⊢ (𝐾 ∈ ℤ → (𝑦 < 𝐾 → (𝑦 ∈ ℤ → ¬ 𝑦 = 𝐾))) |
26 | 25 | impcom 445 | . . . . . . . . 9 ⊢ ((𝑦 < 𝐾 ∧ 𝐾 ∈ ℤ) → (𝑦 ∈ ℤ → ¬ 𝑦 = 𝐾)) |
27 | 26 | imp 444 | . . . . . . . 8 ⊢ (((𝑦 < 𝐾 ∧ 𝐾 ∈ ℤ) ∧ 𝑦 ∈ ℤ) → ¬ 𝑦 = 𝐾) |
28 | 15, 27 | jctird 565 | . . . . . . 7 ⊢ (((𝑦 < 𝐾 ∧ 𝐾 ∈ ℤ) ∧ 𝑦 ∈ ℤ) → (1 ≤ 𝑦 → (¬ 𝑦 = 0 ∧ ¬ 𝑦 = 𝐾))) |
29 | 4, 5, 6, 28 | syl21anc 1317 | . . . . . 6 ⊢ (𝑦 ∈ (1..^𝐾) → (1 ≤ 𝑦 → (¬ 𝑦 = 0 ∧ ¬ 𝑦 = 𝐾))) |
30 | 3, 29 | mpd 15 | . . . . 5 ⊢ (𝑦 ∈ (1..^𝐾) → (¬ 𝑦 = 0 ∧ ¬ 𝑦 = 𝐾)) |
31 | ioran 510 | . . . . 5 ⊢ (¬ (𝑦 = 0 ∨ 𝑦 = 𝐾) ↔ (¬ 𝑦 = 0 ∧ ¬ 𝑦 = 𝐾)) | |
32 | 30, 31 | sylibr 223 | . . . 4 ⊢ (𝑦 ∈ (1..^𝐾) → ¬ (𝑦 = 0 ∨ 𝑦 = 𝐾)) |
33 | 32 | a1i 11 | . . 3 ⊢ (𝑦 ∈ (0...𝐾) → (𝑦 ∈ (1..^𝐾) → ¬ (𝑦 = 0 ∨ 𝑦 = 𝐾))) |
34 | 33 | con2d 128 | . 2 ⊢ (𝑦 ∈ (0...𝐾) → ((𝑦 = 0 ∨ 𝑦 = 𝐾) → ¬ 𝑦 ∈ (1..^𝐾))) |
35 | 2, 34 | impbid 201 | 1 ⊢ (𝑦 ∈ (0...𝐾) → (¬ 𝑦 ∈ (1..^𝐾) ↔ (𝑦 = 0 ∨ 𝑦 = 𝐾))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∨ wo 382 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 class class class wbr 4583 (class class class)co 6549 ℝcr 9814 0cc0 9815 1c1 9816 < clt 9953 ≤ cle 9954 ℤcz 11254 ...cfz 12197 ..^cfzo 12334 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-n0 11170 df-z 11255 df-uz 11564 df-fz 12198 df-fzo 12335 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |