| Intuitionistic Logic Explorer Theorem List (p. 95 of 168) | < Previous Next > | |
| Bad symbols? Try the
GIF version. |
||
|
Mirrors > Metamath Home Page > ILE Home Page > Theorem List Contents > Recent Proofs This page: Page List |
||
| Type | Label | Description |
|---|---|---|
| Statement | ||
| Theorem | bndndx 9401* | A bounded real sequence 𝐴(𝑘) is less than or equal to at least one of its indices. (Contributed by NM, 18-Jan-2008.) |
| ⊢ (∃𝑥 ∈ ℝ ∀𝑘 ∈ ℕ (𝐴 ∈ ℝ ∧ 𝐴 ≤ 𝑥) → ∃𝑘 ∈ ℕ 𝐴 ≤ 𝑘) | ||
| Syntax | cn0 9402 | Extend class notation to include the class of nonnegative integers. |
| class ℕ0 | ||
| Definition | df-n0 9403 | Define the set of nonnegative integers. (Contributed by Raph Levien, 10-Dec-2002.) |
| ⊢ ℕ0 = (ℕ ∪ {0}) | ||
| Theorem | elnn0 9404 | Nonnegative integers expressed in terms of naturals and zero. (Contributed by Raph Levien, 10-Dec-2002.) |
| ⊢ (𝐴 ∈ ℕ0 ↔ (𝐴 ∈ ℕ ∨ 𝐴 = 0)) | ||
| Theorem | nnssnn0 9405 | Positive naturals are a subset of nonnegative integers. (Contributed by Raph Levien, 10-Dec-2002.) |
| ⊢ ℕ ⊆ ℕ0 | ||
| Theorem | nn0ssre 9406 | Nonnegative integers are a subset of the reals. (Contributed by Raph Levien, 10-Dec-2002.) |
| ⊢ ℕ0 ⊆ ℝ | ||
| Theorem | nn0sscn 9407 | Nonnegative integers are a subset of the complex numbers.) (Contributed by NM, 9-May-2004.) |
| ⊢ ℕ0 ⊆ ℂ | ||
| Theorem | nn0ex 9408 | The set of nonnegative integers exists. (Contributed by NM, 18-Jul-2004.) |
| ⊢ ℕ0 ∈ V | ||
| Theorem | nnnn0 9409 | A positive integer is a nonnegative integer. (Contributed by NM, 9-May-2004.) |
| ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℕ0) | ||
| Theorem | nnnn0i 9410 | A positive integer is a nonnegative integer. (Contributed by NM, 20-Jun-2005.) |
| ⊢ 𝑁 ∈ ℕ ⇒ ⊢ 𝑁 ∈ ℕ0 | ||
| Theorem | nn0re 9411 | A nonnegative integer is a real number. (Contributed by NM, 9-May-2004.) |
| ⊢ (𝐴 ∈ ℕ0 → 𝐴 ∈ ℝ) | ||
| Theorem | nn0cn 9412 | A nonnegative integer is a complex number. (Contributed by NM, 9-May-2004.) |
| ⊢ (𝐴 ∈ ℕ0 → 𝐴 ∈ ℂ) | ||
| Theorem | nn0rei 9413 | A nonnegative integer is a real number. (Contributed by NM, 14-May-2003.) |
| ⊢ 𝐴 ∈ ℕ0 ⇒ ⊢ 𝐴 ∈ ℝ | ||
| Theorem | nn0cni 9414 | A nonnegative integer is a complex number. (Contributed by NM, 14-May-2003.) |
| ⊢ 𝐴 ∈ ℕ0 ⇒ ⊢ 𝐴 ∈ ℂ | ||
| Theorem | dfn2 9415 | The set of positive integers defined in terms of nonnegative integers. (Contributed by NM, 23-Sep-2007.) (Proof shortened by Mario Carneiro, 13-Feb-2013.) |
| ⊢ ℕ = (ℕ0 ∖ {0}) | ||
| Theorem | elnnne0 9416 | The positive integer property expressed in terms of difference from zero. (Contributed by Stefan O'Rear, 12-Sep-2015.) |
| ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℕ0 ∧ 𝑁 ≠ 0)) | ||
| Theorem | 0nn0 9417 | 0 is a nonnegative integer. (Contributed by Raph Levien, 10-Dec-2002.) |
| ⊢ 0 ∈ ℕ0 | ||
| Theorem | 1nn0 9418 | 1 is a nonnegative integer. (Contributed by Raph Levien, 10-Dec-2002.) |
| ⊢ 1 ∈ ℕ0 | ||
| Theorem | 2nn0 9419 | 2 is a nonnegative integer. (Contributed by Raph Levien, 10-Dec-2002.) |
| ⊢ 2 ∈ ℕ0 | ||
| Theorem | 3nn0 9420 | 3 is a nonnegative integer. (Contributed by Mario Carneiro, 18-Feb-2014.) |
| ⊢ 3 ∈ ℕ0 | ||
| Theorem | 4nn0 9421 | 4 is a nonnegative integer. (Contributed by Mario Carneiro, 18-Feb-2014.) |
| ⊢ 4 ∈ ℕ0 | ||
| Theorem | 5nn0 9422 | 5 is a nonnegative integer. (Contributed by Mario Carneiro, 19-Apr-2015.) |
| ⊢ 5 ∈ ℕ0 | ||
| Theorem | 6nn0 9423 | 6 is a nonnegative integer. (Contributed by Mario Carneiro, 19-Apr-2015.) |
| ⊢ 6 ∈ ℕ0 | ||
| Theorem | 7nn0 9424 | 7 is a nonnegative integer. (Contributed by Mario Carneiro, 19-Apr-2015.) |
| ⊢ 7 ∈ ℕ0 | ||
| Theorem | 8nn0 9425 | 8 is a nonnegative integer. (Contributed by Mario Carneiro, 19-Apr-2015.) |
| ⊢ 8 ∈ ℕ0 | ||
| Theorem | 9nn0 9426 | 9 is a nonnegative integer. (Contributed by Mario Carneiro, 19-Apr-2015.) |
| ⊢ 9 ∈ ℕ0 | ||
| Theorem | nn0ge0 9427 | A nonnegative integer is greater than or equal to zero. (Contributed by NM, 9-May-2004.) (Revised by Mario Carneiro, 16-May-2014.) |
| ⊢ (𝑁 ∈ ℕ0 → 0 ≤ 𝑁) | ||
| Theorem | nn0nlt0 9428 | A nonnegative integer is not less than zero. (Contributed by NM, 9-May-2004.) (Revised by Mario Carneiro, 27-May-2016.) |
| ⊢ (𝐴 ∈ ℕ0 → ¬ 𝐴 < 0) | ||
| Theorem | nn0ge0i 9429 | Nonnegative integers are nonnegative. (Contributed by Raph Levien, 10-Dec-2002.) |
| ⊢ 𝑁 ∈ ℕ0 ⇒ ⊢ 0 ≤ 𝑁 | ||
| Theorem | nn0le0eq0 9430 | A nonnegative integer is less than or equal to zero iff it is equal to zero. (Contributed by NM, 9-Dec-2005.) |
| ⊢ (𝑁 ∈ ℕ0 → (𝑁 ≤ 0 ↔ 𝑁 = 0)) | ||
| Theorem | nn0p1gt0 9431 | A nonnegative integer increased by 1 is greater than 0. (Contributed by Alexander van der Vekens, 3-Oct-2018.) |
| ⊢ (𝑁 ∈ ℕ0 → 0 < (𝑁 + 1)) | ||
| Theorem | nnnn0addcl 9432 | A positive integer plus a nonnegative integer is a positive integer. (Contributed by NM, 20-Apr-2005.) (Proof shortened by Mario Carneiro, 16-May-2014.) |
| ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ0) → (𝑀 + 𝑁) ∈ ℕ) | ||
| Theorem | nn0nnaddcl 9433 | A nonnegative integer plus a positive integer is a positive integer. (Contributed by NM, 22-Dec-2005.) |
| ⊢ ((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) → (𝑀 + 𝑁) ∈ ℕ) | ||
| Theorem | 0mnnnnn0 9434 | The result of subtracting a positive integer from 0 is not a nonnegative integer. (Contributed by Alexander van der Vekens, 19-Mar-2018.) |
| ⊢ (𝑁 ∈ ℕ → (0 − 𝑁) ∉ ℕ0) | ||
| Theorem | un0addcl 9435 | If 𝑆 is closed under addition, then so is 𝑆 ∪ {0}. (Contributed by Mario Carneiro, 17-Jul-2014.) |
| ⊢ (𝜑 → 𝑆 ⊆ ℂ) & ⊢ 𝑇 = (𝑆 ∪ {0}) & ⊢ ((𝜑 ∧ (𝑀 ∈ 𝑆 ∧ 𝑁 ∈ 𝑆)) → (𝑀 + 𝑁) ∈ 𝑆) ⇒ ⊢ ((𝜑 ∧ (𝑀 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇)) → (𝑀 + 𝑁) ∈ 𝑇) | ||
| Theorem | un0mulcl 9436 | If 𝑆 is closed under multiplication, then so is 𝑆 ∪ {0}. (Contributed by Mario Carneiro, 17-Jul-2014.) |
| ⊢ (𝜑 → 𝑆 ⊆ ℂ) & ⊢ 𝑇 = (𝑆 ∪ {0}) & ⊢ ((𝜑 ∧ (𝑀 ∈ 𝑆 ∧ 𝑁 ∈ 𝑆)) → (𝑀 · 𝑁) ∈ 𝑆) ⇒ ⊢ ((𝜑 ∧ (𝑀 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇)) → (𝑀 · 𝑁) ∈ 𝑇) | ||
| Theorem | nn0addcl 9437 | Closure of addition of nonnegative integers. (Contributed by Raph Levien, 10-Dec-2002.) (Proof shortened by Mario Carneiro, 17-Jul-2014.) |
| ⊢ ((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (𝑀 + 𝑁) ∈ ℕ0) | ||
| Theorem | nn0mulcl 9438 | Closure of multiplication of nonnegative integers. (Contributed by NM, 22-Jul-2004.) (Proof shortened by Mario Carneiro, 17-Jul-2014.) |
| ⊢ ((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (𝑀 · 𝑁) ∈ ℕ0) | ||
| Theorem | nn0addcli 9439 | Closure of addition of nonnegative integers, inference form. (Contributed by Raph Levien, 10-Dec-2002.) |
| ⊢ 𝑀 ∈ ℕ0 & ⊢ 𝑁 ∈ ℕ0 ⇒ ⊢ (𝑀 + 𝑁) ∈ ℕ0 | ||
| Theorem | nn0mulcli 9440 | Closure of multiplication of nonnegative integers, inference form. (Contributed by Raph Levien, 10-Dec-2002.) |
| ⊢ 𝑀 ∈ ℕ0 & ⊢ 𝑁 ∈ ℕ0 ⇒ ⊢ (𝑀 · 𝑁) ∈ ℕ0 | ||
| Theorem | nn0p1nn 9441 | A nonnegative integer plus 1 is a positive integer. (Contributed by Raph Levien, 30-Jun-2006.) (Revised by Mario Carneiro, 16-May-2014.) |
| ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ) | ||
| Theorem | peano2nn0 9442 | Second Peano postulate for nonnegative integers. (Contributed by NM, 9-May-2004.) |
| ⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0) | ||
| Theorem | nnm1nn0 9443 | A positive integer minus 1 is a nonnegative integer. (Contributed by Jason Orendorff, 24-Jan-2007.) (Revised by Mario Carneiro, 16-May-2014.) |
| ⊢ (𝑁 ∈ ℕ → (𝑁 − 1) ∈ ℕ0) | ||
| Theorem | elnn0nn 9444 | The nonnegative integer property expressed in terms of positive integers. (Contributed by NM, 10-May-2004.) (Proof shortened by Mario Carneiro, 16-May-2014.) |
| ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℂ ∧ (𝑁 + 1) ∈ ℕ)) | ||
| Theorem | elnnnn0 9445 | The positive integer property expressed in terms of nonnegative integers. (Contributed by NM, 10-May-2004.) |
| ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℂ ∧ (𝑁 − 1) ∈ ℕ0)) | ||
| Theorem | elnnnn0b 9446 | The positive integer property expressed in terms of nonnegative integers. (Contributed by NM, 1-Sep-2005.) |
| ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℕ0 ∧ 0 < 𝑁)) | ||
| Theorem | elnnnn0c 9447 | The positive integer property expressed in terms of nonnegative integers. (Contributed by NM, 10-Jan-2006.) |
| ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℕ0 ∧ 1 ≤ 𝑁)) | ||
| Theorem | nn0addge1 9448 | A number is less than or equal to itself plus a nonnegative integer. (Contributed by NM, 10-Mar-2005.) |
| ⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℕ0) → 𝐴 ≤ (𝐴 + 𝑁)) | ||
| Theorem | nn0addge2 9449 | A number is less than or equal to itself plus a nonnegative integer. (Contributed by NM, 10-Mar-2005.) |
| ⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℕ0) → 𝐴 ≤ (𝑁 + 𝐴)) | ||
| Theorem | nn0addge1i 9450 | A number is less than or equal to itself plus a nonnegative integer. (Contributed by NM, 10-Mar-2005.) |
| ⊢ 𝐴 ∈ ℝ & ⊢ 𝑁 ∈ ℕ0 ⇒ ⊢ 𝐴 ≤ (𝐴 + 𝑁) | ||
| Theorem | nn0addge2i 9451 | A number is less than or equal to itself plus a nonnegative integer. (Contributed by NM, 10-Mar-2005.) |
| ⊢ 𝐴 ∈ ℝ & ⊢ 𝑁 ∈ ℕ0 ⇒ ⊢ 𝐴 ≤ (𝑁 + 𝐴) | ||
| Theorem | nn0le2xi 9452 | A nonnegative integer is less than or equal to twice itself. (Contributed by Raph Levien, 10-Dec-2002.) |
| ⊢ 𝑁 ∈ ℕ0 ⇒ ⊢ 𝑁 ≤ (2 · 𝑁) | ||
| Theorem | nn0lele2xi 9453 | 'Less than or equal to' implies 'less than or equal to twice' for nonnegative integers. (Contributed by Raph Levien, 10-Dec-2002.) |
| ⊢ 𝑀 ∈ ℕ0 & ⊢ 𝑁 ∈ ℕ0 ⇒ ⊢ (𝑁 ≤ 𝑀 → 𝑁 ≤ (2 · 𝑀)) | ||
| Theorem | nn0supp 9454 | Two ways to write the support of a function on ℕ0. (Contributed by Mario Carneiro, 29-Dec-2014.) |
| ⊢ (𝐹:𝐼⟶ℕ0 → (◡𝐹 “ (V ∖ {0})) = (◡𝐹 “ ℕ)) | ||
| Theorem | nnnn0d 9455 | A positive integer is a nonnegative integer. (Contributed by Mario Carneiro, 27-May-2016.) |
| ⊢ (𝜑 → 𝐴 ∈ ℕ) ⇒ ⊢ (𝜑 → 𝐴 ∈ ℕ0) | ||
| Theorem | nn0red 9456 | A nonnegative integer is a real number. (Contributed by Mario Carneiro, 27-May-2016.) |
| ⊢ (𝜑 → 𝐴 ∈ ℕ0) ⇒ ⊢ (𝜑 → 𝐴 ∈ ℝ) | ||
| Theorem | nn0cnd 9457 | A nonnegative integer is a complex number. (Contributed by Mario Carneiro, 27-May-2016.) |
| ⊢ (𝜑 → 𝐴 ∈ ℕ0) ⇒ ⊢ (𝜑 → 𝐴 ∈ ℂ) | ||
| Theorem | nn0ge0d 9458 | A nonnegative integer is greater than or equal to zero. (Contributed by Mario Carneiro, 27-May-2016.) |
| ⊢ (𝜑 → 𝐴 ∈ ℕ0) ⇒ ⊢ (𝜑 → 0 ≤ 𝐴) | ||
| Theorem | nn0addcld 9459 | Closure of addition of nonnegative integers, inference form. (Contributed by Mario Carneiro, 27-May-2016.) |
| ⊢ (𝜑 → 𝐴 ∈ ℕ0) & ⊢ (𝜑 → 𝐵 ∈ ℕ0) ⇒ ⊢ (𝜑 → (𝐴 + 𝐵) ∈ ℕ0) | ||
| Theorem | nn0mulcld 9460 | Closure of multiplication of nonnegative integers, inference form. (Contributed by Mario Carneiro, 27-May-2016.) |
| ⊢ (𝜑 → 𝐴 ∈ ℕ0) & ⊢ (𝜑 → 𝐵 ∈ ℕ0) ⇒ ⊢ (𝜑 → (𝐴 · 𝐵) ∈ ℕ0) | ||
| Theorem | nn0readdcl 9461 | Closure law for addition of reals, restricted to nonnegative integers. (Contributed by Alexander van der Vekens, 6-Apr-2018.) |
| ⊢ ((𝐴 ∈ ℕ0 ∧ 𝐵 ∈ ℕ0) → (𝐴 + 𝐵) ∈ ℝ) | ||
| Theorem | nn0ge2m1nn 9462 | If a nonnegative integer is greater than or equal to two, the integer decreased by 1 is a positive integer. (Contributed by Alexander van der Vekens, 1-Aug-2018.) (Revised by AV, 4-Jan-2020.) |
| ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 − 1) ∈ ℕ) | ||
| Theorem | nn0ge2m1nn0 9463 | If a nonnegative integer is greater than or equal to two, the integer decreased by 1 is also a nonnegative integer. (Contributed by Alexander van der Vekens, 1-Aug-2018.) |
| ⊢ ((𝑁 ∈ ℕ0 ∧ 2 ≤ 𝑁) → (𝑁 − 1) ∈ ℕ0) | ||
| Theorem | nn0nndivcl 9464 | Closure law for dividing of a nonnegative integer by a positive integer. (Contributed by Alexander van der Vekens, 14-Apr-2018.) |
| ⊢ ((𝐾 ∈ ℕ0 ∧ 𝐿 ∈ ℕ) → (𝐾 / 𝐿) ∈ ℝ) | ||
The function values of the hash (set size) function are either nonnegative integers or positive infinity. To avoid the need to distinguish between finite and infinite sets (and therefore if the set size is a nonnegative integer or positive infinity), it is useful to provide a definition of the set of nonnegative integers extended by positive infinity, analogously to the extension of the real numbers ℝ*, see df-xr 8218. | ||
| Syntax | cxnn0 9465 | The set of extended nonnegative integers. |
| class ℕ0* | ||
| Definition | df-xnn0 9466 | Define the set of extended nonnegative integers that includes positive infinity. Analogue of the extension of the real numbers ℝ*, see df-xr 8218. If we assumed excluded middle, this would be essentially the same as ℕ∞ as defined at df-nninf 7319 but in its absence the relationship between the two is more complicated. (Contributed by AV, 10-Dec-2020.) |
| ⊢ ℕ0* = (ℕ0 ∪ {+∞}) | ||
| Theorem | elxnn0 9467 | An extended nonnegative integer is either a standard nonnegative integer or positive infinity. (Contributed by AV, 10-Dec-2020.) |
| ⊢ (𝐴 ∈ ℕ0* ↔ (𝐴 ∈ ℕ0 ∨ 𝐴 = +∞)) | ||
| Theorem | nn0ssxnn0 9468 | The standard nonnegative integers are a subset of the extended nonnegative integers. (Contributed by AV, 10-Dec-2020.) |
| ⊢ ℕ0 ⊆ ℕ0* | ||
| Theorem | nn0xnn0 9469 | A standard nonnegative integer is an extended nonnegative integer. (Contributed by AV, 10-Dec-2020.) |
| ⊢ (𝐴 ∈ ℕ0 → 𝐴 ∈ ℕ0*) | ||
| Theorem | xnn0xr 9470 | An extended nonnegative integer is an extended real. (Contributed by AV, 10-Dec-2020.) |
| ⊢ (𝐴 ∈ ℕ0* → 𝐴 ∈ ℝ*) | ||
| Theorem | 0xnn0 9471 | Zero is an extended nonnegative integer. (Contributed by AV, 10-Dec-2020.) |
| ⊢ 0 ∈ ℕ0* | ||
| Theorem | pnf0xnn0 9472 | Positive infinity is an extended nonnegative integer. (Contributed by AV, 10-Dec-2020.) |
| ⊢ +∞ ∈ ℕ0* | ||
| Theorem | nn0nepnf 9473 | No standard nonnegative integer equals positive infinity. (Contributed by AV, 10-Dec-2020.) |
| ⊢ (𝐴 ∈ ℕ0 → 𝐴 ≠ +∞) | ||
| Theorem | nn0xnn0d 9474 | A standard nonnegative integer is an extended nonnegative integer, deduction form. (Contributed by AV, 10-Dec-2020.) |
| ⊢ (𝜑 → 𝐴 ∈ ℕ0) ⇒ ⊢ (𝜑 → 𝐴 ∈ ℕ0*) | ||
| Theorem | nn0nepnfd 9475 | No standard nonnegative integer equals positive infinity, deduction form. (Contributed by AV, 10-Dec-2020.) |
| ⊢ (𝜑 → 𝐴 ∈ ℕ0) ⇒ ⊢ (𝜑 → 𝐴 ≠ +∞) | ||
| Theorem | xnn0nemnf 9476 | No extended nonnegative integer equals negative infinity. (Contributed by AV, 10-Dec-2020.) |
| ⊢ (𝐴 ∈ ℕ0* → 𝐴 ≠ -∞) | ||
| Theorem | xnn0xrnemnf 9477 | The extended nonnegative integers are extended reals without negative infinity. (Contributed by AV, 10-Dec-2020.) |
| ⊢ (𝐴 ∈ ℕ0* → (𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞)) | ||
| Theorem | xnn0nnn0pnf 9478 | An extended nonnegative integer which is not a standard nonnegative integer is positive infinity. (Contributed by AV, 10-Dec-2020.) |
| ⊢ ((𝑁 ∈ ℕ0* ∧ ¬ 𝑁 ∈ ℕ0) → 𝑁 = +∞) | ||
| Syntax | cz 9479 | Extend class notation to include the class of integers. |
| class ℤ | ||
| Definition | df-z 9480 | Define the set of integers, which are the positive and negative integers together with zero. Definition of integers in [Apostol] p. 22. The letter Z abbreviates the German word Zahlen meaning "numbers." (Contributed by NM, 8-Jan-2002.) |
| ⊢ ℤ = {𝑛 ∈ ℝ ∣ (𝑛 = 0 ∨ 𝑛 ∈ ℕ ∨ -𝑛 ∈ ℕ)} | ||
| Theorem | elz 9481 | Membership in the set of integers. (Contributed by NM, 8-Jan-2002.) |
| ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) | ||
| Theorem | nnnegz 9482 | The negative of a positive integer is an integer. (Contributed by NM, 12-Jan-2002.) |
| ⊢ (𝑁 ∈ ℕ → -𝑁 ∈ ℤ) | ||
| Theorem | zre 9483 | An integer is a real. (Contributed by NM, 8-Jan-2002.) |
| ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | ||
| Theorem | zcn 9484 | An integer is a complex number. (Contributed by NM, 9-May-2004.) |
| ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | ||
| Theorem | zrei 9485 | An integer is a real number. (Contributed by NM, 14-Jul-2005.) |
| ⊢ 𝐴 ∈ ℤ ⇒ ⊢ 𝐴 ∈ ℝ | ||
| Theorem | zssre 9486 | The integers are a subset of the reals. (Contributed by NM, 2-Aug-2004.) |
| ⊢ ℤ ⊆ ℝ | ||
| Theorem | zsscn 9487 | The integers are a subset of the complex numbers. (Contributed by NM, 2-Aug-2004.) |
| ⊢ ℤ ⊆ ℂ | ||
| Theorem | zex 9488 | The set of integers exists. (Contributed by NM, 30-Jul-2004.) (Revised by Mario Carneiro, 17-Nov-2014.) |
| ⊢ ℤ ∈ V | ||
| Theorem | elnnz 9489 | Positive integer property expressed in terms of integers. (Contributed by NM, 8-Jan-2002.) |
| ⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℤ ∧ 0 < 𝑁)) | ||
| Theorem | 0z 9490 | Zero is an integer. (Contributed by NM, 12-Jan-2002.) |
| ⊢ 0 ∈ ℤ | ||
| Theorem | 0zd 9491 | Zero is an integer, deductive form (common case). (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ (𝜑 → 0 ∈ ℤ) | ||
| Theorem | elnn0z 9492 | Nonnegative integer property expressed in terms of integers. (Contributed by NM, 9-May-2004.) |
| ⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℤ ∧ 0 ≤ 𝑁)) | ||
| Theorem | elznn0nn 9493 | Integer property expressed in terms nonnegative integers and positive integers. (Contributed by NM, 10-May-2004.) |
| ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℕ0 ∨ (𝑁 ∈ ℝ ∧ -𝑁 ∈ ℕ))) | ||
| Theorem | elznn0 9494 | Integer property expressed in terms of nonnegative integers. (Contributed by NM, 9-May-2004.) |
| ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 ∈ ℕ0 ∨ -𝑁 ∈ ℕ0))) | ||
| Theorem | elznn 9495 | Integer property expressed in terms of positive integers and nonnegative integers. (Contributed by NM, 12-Jul-2005.) |
| ⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ0))) | ||
| Theorem | nnssz 9496 | Positive integers are a subset of integers. (Contributed by NM, 9-Jan-2002.) |
| ⊢ ℕ ⊆ ℤ | ||
| Theorem | nn0ssz 9497 | Nonnegative integers are a subset of the integers. (Contributed by NM, 9-May-2004.) |
| ⊢ ℕ0 ⊆ ℤ | ||
| Theorem | nnz 9498 | A positive integer is an integer. (Contributed by NM, 9-May-2004.) |
| ⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℤ) | ||
| Theorem | nn0z 9499 | A nonnegative integer is an integer. (Contributed by NM, 9-May-2004.) |
| ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | ||
| Theorem | nnzi 9500 | A positive integer is an integer. (Contributed by Mario Carneiro, 18-Feb-2014.) |
| ⊢ 𝑁 ∈ ℕ ⇒ ⊢ 𝑁 ∈ ℤ | ||
| < Previous Next > |
| Copyright terms: Public domain | < Previous Next > |