| 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 34372. (Contributed by Thierry Arnoux, 29-Oct-2017.) |
| Ref | Expression |
|---|---|
| elzdif0 | ⊢ (𝑀 ∈ (ℤ ∖ {0}) → (𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eldifsnneq 4759 | . 2 ⊢ (𝑀 ∈ (ℤ ∖ {0}) → ¬ 𝑀 = 0) | |
| 2 | eldifi 4085 | . . . . 5 ⊢ (𝑀 ∈ (ℤ ∖ {0}) → 𝑀 ∈ ℤ) | |
| 3 | elz 12588 | . . . . 5 ⊢ (𝑀 ∈ ℤ ↔ (𝑀 ∈ ℝ ∧ (𝑀 = 0 ∨ 𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ))) | |
| 4 | 2, 3 | sylib 221 | . . . 4 ⊢ (𝑀 ∈ (ℤ ∖ {0}) → (𝑀 ∈ ℝ ∧ (𝑀 = 0 ∨ 𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ))) |
| 5 | 4 | simprd 500 | . . 3 ⊢ (𝑀 ∈ (ℤ ∖ {0}) → (𝑀 = 0 ∨ 𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ)) |
| 6 | 3orass 1106 | . . 3 ⊢ ((𝑀 = 0 ∨ 𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ) ↔ (𝑀 = 0 ∨ (𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ))) | |
| 7 | 5, 6 | sylib 221 | . 2 ⊢ (𝑀 ∈ (ℤ ∖ {0}) → (𝑀 = 0 ∨ (𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ))) |
| 8 | orel1 901 | . 2 ⊢ (¬ 𝑀 = 0 → ((𝑀 = 0 ∨ (𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ)) → (𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ))) | |
| 9 | 1, 7, 8 | sylc 66 | 1 ⊢ (𝑀 ∈ (ℤ ∖ {0}) → (𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∨ wo 860 ∨ w3o 1102 = wceq 1570 ∈ wcel 2143 ∖ cdif 3902 {csn 4589 ℝcr 11094 0cc0 11095 -cneg 11437 ℕcn 12228 ℤcz 12586 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-iota 6492 df-fv 6544 df-ov 7413 df-neg 11439 df-z 12587 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |