| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > elzdif0 | Structured version Visualization version GIF version | ||
| Description: Lemma for qqhval2 34670. (Contributed by Thierry Arnoux, 29-Oct-2017.) |
| Ref | Expression |
|---|---|
| elzdif0 | ⊢ (𝑀 ∈ (ℤ ∖ {0}) → (𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eldifsnneq 4754 | . 2 ⊢ (𝑀 ∈ (ℤ ∖ {0}) → ¬ 𝑀 = 0) | |
| 2 | eldifi 4070 | . . . . 5 ⊢ (𝑀 ∈ (ℤ ∖ {0}) → 𝑀 ∈ ℤ) | |
| 3 | elz 12708 | . . . . 5 ⊢ (𝑀 ∈ ℤ ↔ (𝑀 ∈ ℝ ∧ (𝑀 = 0 ∨ 𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ))) | |
| 4 | 2, 3 | sylib 221 | . . . 4 ⊢ (𝑀 ∈ (ℤ ∖ {0}) → (𝑀 ∈ ℝ ∧ (𝑀 = 0 ∨ 𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ))) |
| 5 | 4 | simprd 501 | . . 3 ⊢ (𝑀 ∈ (ℤ ∖ {0}) → (𝑀 = 0 ∨ 𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ)) |
| 6 | 3orass 1106 | . . 3 ⊢ ((𝑀 = 0 ∨ 𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ) ↔ (𝑀 = 0 ∨ (𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ))) | |
| 7 | 5, 6 | sylib 221 | . 2 ⊢ (𝑀 ∈ (ℤ ∖ {0}) → (𝑀 = 0 ∨ (𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ))) |
| 8 | orel1 902 | . 2 ⊢ (¬ 𝑀 = 0 → ((𝑀 = 0 ∨ (𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ)) → (𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ))) | |
| 9 | 1, 7, 8 | sylc 66 | 1 ⊢ (𝑀 ∈ (ℤ ∖ {0}) → (𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∨ wo 861 ∨ w3o 1102 = wceq 1569 ∈ wcel 2146 ∖ cdif 4048 {csn 4588 ℝcr 11212 0cc0 11213 -cneg 11555 ℕcn 12348 ℤ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-ext 2735 |
| 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-sb 2101 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-iota 6501 df-fv 6555 df-ov 7433 df-neg 11557 df-z 12707 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |