| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > zle0orge1 | Structured version Visualization version GIF version | ||
| Description: There is no integer in the open unit interval, i.e., an integer is either less than or equal to 0 or greater than or equal to 1. (Contributed by AV, 4-Jun-2023.) |
| Ref | Expression |
|---|---|
| zle0orge1 | ⊢ (𝑍 ∈ ℤ → (𝑍 ≤ 0 ∨ 1 ≤ 𝑍)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elznn 12722 | . 2 ⊢ (𝑍 ∈ ℤ ↔ (𝑍 ∈ ℝ ∧ (𝑍 ∈ ℕ ∨ -𝑍 ∈ ℕ0))) | |
| 2 | nnge1 12379 | . . . . . 6 ⊢ (𝑍 ∈ ℕ → 1 ≤ 𝑍) | |
| 3 | 2 | a1i 11 | . . . . 5 ⊢ (𝑍 ∈ ℝ → (𝑍 ∈ ℕ → 1 ≤ 𝑍)) |
| 4 | elnn0z 12719 | . . . . . 6 ⊢ ( -𝑍 ∈ ℕ0 ↔ ( -𝑍 ∈ ℤ ∧ 0 ≤ -𝑍)) | |
| 5 | le0neg1 11837 | . . . . . . . 8 ⊢ (𝑍 ∈ ℝ → (𝑍 ≤ 0 ↔ 0 ≤ -𝑍)) | |
| 6 | 5 | biimprd 251 | . . . . . . 7 ⊢ (𝑍 ∈ ℝ → (0 ≤ -𝑍 → 𝑍 ≤ 0)) |
| 7 | 6 | adantld 496 | . . . . . 6 ⊢ (𝑍 ∈ ℝ → (( -𝑍 ∈ ℤ ∧ 0 ≤ -𝑍) → 𝑍 ≤ 0)) |
| 8 | 4, 7 | biimtrid 245 | . . . . 5 ⊢ (𝑍 ∈ ℝ → ( -𝑍 ∈ ℕ0 → 𝑍 ≤ 0)) |
| 9 | 3, 8 | orim12d 979 | . . . 4 ⊢ (𝑍 ∈ ℝ → ((𝑍 ∈ ℕ ∨ -𝑍 ∈ ℕ0) → (1 ≤ 𝑍 ∨ 𝑍 ≤ 0))) |
| 10 | 9 | imp 412 | . . 3 ⊢ ((𝑍 ∈ ℝ ∧ (𝑍 ∈ ℕ ∨ -𝑍 ∈ ℕ0)) → (1 ≤ 𝑍 ∨ 𝑍 ≤ 0)) |
| 11 | 10 | orcomd 885 | . 2 ⊢ ((𝑍 ∈ ℝ ∧ (𝑍 ∈ ℕ ∨ -𝑍 ∈ ℕ0)) → (𝑍 ≤ 0 ∨ 1 ≤ 𝑍)) |
| 12 | 1, 11 | sylbi 220 | 1 ⊢ (𝑍 ∈ ℤ → (𝑍 ≤ 0 ∨ 1 ≤ 𝑍)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ wo 861 ∈ wcel 2146 class class class wbr 5106 ℝcr 11212 0cc0 11213 1c1 11214 ≤ cle 11357 -cneg 11555 ℕcn 12348 ℕ0cn0 12619 ℤcz 12706 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7761 ax-resscn 11270 ax-1cn 11271 ax-icn 11272 ax-addcl 11273 ax-addrcl 11274 ax-mulcl 11275 ax-mulrcl 11276 ax-mulcom 11277 ax-addass 11278 ax-mulass 11279 ax-distr 11280 ax-i2m1 11281 ax-1ne0 11282 ax-1rid 11283 ax-rnegex 11284 ax-rrecex 11285 ax-cnre 11286 ax-pre-lttri 11287 ax-pre-lttrn 11288 ax-pre-ltadd 11289 ax-pre-mulgt0 11290 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6311 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6501 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-riota 7387 df-ov 7433 df-oprab 7434 df-mpo 7435 df-om 7888 df-2nd 8012 df-frecs 8313 df-wrecs 8344 df-recs 8393 df-rdg 8432 df-er 8731 df-en 8988 df-dom 8989 df-sdom 8990 df-pnf 11358 df-mnf 11359 df-xr 11360 df-ltxr 11361 df-le 11362 df-sub 11556 df-neg 11557 df-nn 12349 df-n0 12620 df-z 12707 |
| This theorem is used by: 2mulprm 16883 |
| Copyright terms: Public domain | W3C validator |