| 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 34175. (Contributed by Thierry Arnoux, 29-Oct-2017.) |
| Ref | Expression |
|---|---|
| elzdif0 | ⊢ (𝑀 ∈ (ℤ ∖ {0}) → (𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eldifsnneq 4725 | . 2 ⊢ (𝑀 ∈ (ℤ ∖ {0}) → ¬ 𝑀 = 0) | |
| 2 | eldifi 4062 | . . . . 5 ⊢ (𝑀 ∈ (ℤ ∖ {0}) → 𝑀 ∈ ℤ) | |
| 3 | elz 12518 | . . . . 5 ⊢ (𝑀 ∈ ℤ ↔ (𝑀 ∈ ℝ ∧ (𝑀 = 0 ∨ 𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ))) | |
| 4 | 2, 3 | sylib 219 | . . . 4 ⊢ (𝑀 ∈ (ℤ ∖ {0}) → (𝑀 ∈ ℝ ∧ (𝑀 = 0 ∨ 𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ))) |
| 5 | 4 | simprd 496 | . . 3 ⊢ (𝑀 ∈ (ℤ ∖ {0}) → (𝑀 = 0 ∨ 𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ)) |
| 6 | 3orass 1095 | . . 3 ⊢ ((𝑀 = 0 ∨ 𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ) ↔ (𝑀 = 0 ∨ (𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ))) | |
| 7 | 5, 6 | sylib 219 | . 2 ⊢ (𝑀 ∈ (ℤ ∖ {0}) → (𝑀 = 0 ∨ (𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ))) |
| 8 | orel1 894 | . 2 ⊢ (¬ 𝑀 = 0 → ((𝑀 = 0 ∨ (𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ)) → (𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ))) | |
| 9 | 1, 7, 8 | sylc 65 | 1 ⊢ (𝑀 ∈ (ℤ ∖ {0}) → (𝑀 ∈ ℕ ∨ -𝑀 ∈ ℕ)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∨ wo 853 ∨ w3o 1091 = wceq 1547 ∈ wcel 2119 ∖ cdif 3880 {csn 4556 ℝcr 11029 0cc0 11030 -cneg 11370 ℕcn 12166 ℤcz 12516 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-ne 2935 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-ss 3900 df-nul 4263 df-if 4456 df-sn 4557 df-pr 4559 df-op 4563 df-uni 4840 df-br 5074 df-iota 6442 df-fv 6494 df-ov 7360 df-neg 11372 df-z 12517 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |