Home | Intuitionistic Logic Explorer Theorem List (p. 91 of 133) | < 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 | 9nn0 9001 | 9 is a nonnegative integer. (Contributed by Mario Carneiro, 19-Apr-2015.) |
⊢ 9 ∈ ℕ0 | ||
Theorem | nn0ge0 9002 | 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 9003 | 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 9004 | Nonnegative integers are nonnegative. (Contributed by Raph Levien, 10-Dec-2002.) |
⊢ 𝑁 ∈ ℕ0 ⇒ ⊢ 0 ≤ 𝑁 | ||
Theorem | nn0le0eq0 9005 | 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 9006 | A nonnegative integer increased by 1 is greater than 0. (Contributed by Alexander van der Vekens, 3-Oct-2018.) |
⊢ (𝑁 ∈ ℕ0 → 0 < (𝑁 + 1)) | ||
Theorem | nnnn0addcl 9007 | 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 9008 | A nonnegative integer plus a positive integer is a positive integer. (Contributed by NM, 22-Dec-2005.) |
⊢ ((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ) → (𝑀 + 𝑁) ∈ ℕ) | ||
Theorem | 0mnnnnn0 9009 | 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 9010 | If 𝑆 is closed under addition, then so is 𝑆 ∪ {0}. (Contributed by Mario Carneiro, 17-Jul-2014.) |
⊢ (𝜑 → 𝑆 ⊆ ℂ) & ⊢ 𝑇 = (𝑆 ∪ {0}) & ⊢ ((𝜑 ∧ (𝑀 ∈ 𝑆 ∧ 𝑁 ∈ 𝑆)) → (𝑀 + 𝑁) ∈ 𝑆) ⇒ ⊢ ((𝜑 ∧ (𝑀 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇)) → (𝑀 + 𝑁) ∈ 𝑇) | ||
Theorem | un0mulcl 9011 | If 𝑆 is closed under multiplication, then so is 𝑆 ∪ {0}. (Contributed by Mario Carneiro, 17-Jul-2014.) |
⊢ (𝜑 → 𝑆 ⊆ ℂ) & ⊢ 𝑇 = (𝑆 ∪ {0}) & ⊢ ((𝜑 ∧ (𝑀 ∈ 𝑆 ∧ 𝑁 ∈ 𝑆)) → (𝑀 · 𝑁) ∈ 𝑆) ⇒ ⊢ ((𝜑 ∧ (𝑀 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇)) → (𝑀 · 𝑁) ∈ 𝑇) | ||
Theorem | nn0addcl 9012 | 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 9013 | 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 9014 | Closure of addition of nonnegative integers, inference form. (Contributed by Raph Levien, 10-Dec-2002.) |
⊢ 𝑀 ∈ ℕ0 & ⊢ 𝑁 ∈ ℕ0 ⇒ ⊢ (𝑀 + 𝑁) ∈ ℕ0 | ||
Theorem | nn0mulcli 9015 | Closure of multiplication of nonnegative integers, inference form. (Contributed by Raph Levien, 10-Dec-2002.) |
⊢ 𝑀 ∈ ℕ0 & ⊢ 𝑁 ∈ ℕ0 ⇒ ⊢ (𝑀 · 𝑁) ∈ ℕ0 | ||
Theorem | nn0p1nn 9016 | 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 9017 | Second Peano postulate for nonnegative integers. (Contributed by NM, 9-May-2004.) |
⊢ (𝑁 ∈ ℕ0 → (𝑁 + 1) ∈ ℕ0) | ||
Theorem | nnm1nn0 9018 | 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 9019 | 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 9020 | The positive integer property expressed in terms of nonnegative integers. (Contributed by NM, 10-May-2004.) |
⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℂ ∧ (𝑁 − 1) ∈ ℕ0)) | ||
Theorem | elnnnn0b 9021 | The positive integer property expressed in terms of nonnegative integers. (Contributed by NM, 1-Sep-2005.) |
⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℕ0 ∧ 0 < 𝑁)) | ||
Theorem | elnnnn0c 9022 | The positive integer property expressed in terms of nonnegative integers. (Contributed by NM, 10-Jan-2006.) |
⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℕ0 ∧ 1 ≤ 𝑁)) | ||
Theorem | nn0addge1 9023 | A number is less than or equal to itself plus a nonnegative integer. (Contributed by NM, 10-Mar-2005.) |
⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℕ0) → 𝐴 ≤ (𝐴 + 𝑁)) | ||
Theorem | nn0addge2 9024 | A number is less than or equal to itself plus a nonnegative integer. (Contributed by NM, 10-Mar-2005.) |
⊢ ((𝐴 ∈ ℝ ∧ 𝑁 ∈ ℕ0) → 𝐴 ≤ (𝑁 + 𝐴)) | ||
Theorem | nn0addge1i 9025 | A number is less than or equal to itself plus a nonnegative integer. (Contributed by NM, 10-Mar-2005.) |
⊢ 𝐴 ∈ ℝ & ⊢ 𝑁 ∈ ℕ0 ⇒ ⊢ 𝐴 ≤ (𝐴 + 𝑁) | ||
Theorem | nn0addge2i 9026 | A number is less than or equal to itself plus a nonnegative integer. (Contributed by NM, 10-Mar-2005.) |
⊢ 𝐴 ∈ ℝ & ⊢ 𝑁 ∈ ℕ0 ⇒ ⊢ 𝐴 ≤ (𝑁 + 𝐴) | ||
Theorem | nn0le2xi 9027 | A nonnegative integer is less than or equal to twice itself. (Contributed by Raph Levien, 10-Dec-2002.) |
⊢ 𝑁 ∈ ℕ0 ⇒ ⊢ 𝑁 ≤ (2 · 𝑁) | ||
Theorem | nn0lele2xi 9028 | '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 9029 | Two ways to write the support of a function on ℕ0. (Contributed by Mario Carneiro, 29-Dec-2014.) |
⊢ (𝐹:𝐼⟶ℕ0 → (◡𝐹 “ (V ∖ {0})) = (◡𝐹 “ ℕ)) | ||
Theorem | nnnn0d 9030 | A positive integer is a nonnegative integer. (Contributed by Mario Carneiro, 27-May-2016.) |
⊢ (𝜑 → 𝐴 ∈ ℕ) ⇒ ⊢ (𝜑 → 𝐴 ∈ ℕ0) | ||
Theorem | nn0red 9031 | A nonnegative integer is a real number. (Contributed by Mario Carneiro, 27-May-2016.) |
⊢ (𝜑 → 𝐴 ∈ ℕ0) ⇒ ⊢ (𝜑 → 𝐴 ∈ ℝ) | ||
Theorem | nn0cnd 9032 | A nonnegative integer is a complex number. (Contributed by Mario Carneiro, 27-May-2016.) |
⊢ (𝜑 → 𝐴 ∈ ℕ0) ⇒ ⊢ (𝜑 → 𝐴 ∈ ℂ) | ||
Theorem | nn0ge0d 9033 | A nonnegative integer is greater than or equal to zero. (Contributed by Mario Carneiro, 27-May-2016.) |
⊢ (𝜑 → 𝐴 ∈ ℕ0) ⇒ ⊢ (𝜑 → 0 ≤ 𝐴) | ||
Theorem | nn0addcld 9034 | Closure of addition of nonnegative integers, inference form. (Contributed by Mario Carneiro, 27-May-2016.) |
⊢ (𝜑 → 𝐴 ∈ ℕ0) & ⊢ (𝜑 → 𝐵 ∈ ℕ0) ⇒ ⊢ (𝜑 → (𝐴 + 𝐵) ∈ ℕ0) | ||
Theorem | nn0mulcld 9035 | Closure of multiplication of nonnegative integers, inference form. (Contributed by Mario Carneiro, 27-May-2016.) |
⊢ (𝜑 → 𝐴 ∈ ℕ0) & ⊢ (𝜑 → 𝐵 ∈ ℕ0) ⇒ ⊢ (𝜑 → (𝐴 · 𝐵) ∈ ℕ0) | ||
Theorem | nn0readdcl 9036 | Closure law for addition of reals, restricted to nonnegative integers. (Contributed by Alexander van der Vekens, 6-Apr-2018.) |
⊢ ((𝐴 ∈ ℕ0 ∧ 𝐵 ∈ ℕ0) → (𝐴 + 𝐵) ∈ ℝ) | ||
Theorem | nn0ge2m1nn 9037 | 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 9038 | 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 9039 | 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 7804. | ||
Syntax | cxnn0 9040 | The set of extended nonnegative integers. |
class ℕ0* | ||
Definition | df-xnn0 9041 | Define the set of extended nonnegative integers that includes positive infinity. Analogue of the extension of the real numbers ℝ*, see df-xr 7804. If we assumed excluded middle, this would be essentially the same as ℕ∞ as defined at df-nninf 7007 but in its absence the relationship between the two is more complicated. (Contributed by AV, 10-Dec-2020.) |
⊢ ℕ0* = (ℕ0 ∪ {+∞}) | ||
Theorem | elxnn0 9042 | An extended nonnegative integer is either a standard nonnegative integer or positive infinity. (Contributed by AV, 10-Dec-2020.) |
⊢ (𝐴 ∈ ℕ0* ↔ (𝐴 ∈ ℕ0 ∨ 𝐴 = +∞)) | ||
Theorem | nn0ssxnn0 9043 | The standard nonnegative integers are a subset of the extended nonnegative integers. (Contributed by AV, 10-Dec-2020.) |
⊢ ℕ0 ⊆ ℕ0* | ||
Theorem | nn0xnn0 9044 | A standard nonnegative integer is an extended nonnegative integer. (Contributed by AV, 10-Dec-2020.) |
⊢ (𝐴 ∈ ℕ0 → 𝐴 ∈ ℕ0*) | ||
Theorem | xnn0xr 9045 | An extended nonnegative integer is an extended real. (Contributed by AV, 10-Dec-2020.) |
⊢ (𝐴 ∈ ℕ0* → 𝐴 ∈ ℝ*) | ||
Theorem | 0xnn0 9046 | Zero is an extended nonnegative integer. (Contributed by AV, 10-Dec-2020.) |
⊢ 0 ∈ ℕ0* | ||
Theorem | pnf0xnn0 9047 | Positive infinity is an extended nonnegative integer. (Contributed by AV, 10-Dec-2020.) |
⊢ +∞ ∈ ℕ0* | ||
Theorem | nn0nepnf 9048 | No standard nonnegative integer equals positive infinity. (Contributed by AV, 10-Dec-2020.) |
⊢ (𝐴 ∈ ℕ0 → 𝐴 ≠ +∞) | ||
Theorem | nn0xnn0d 9049 | A standard nonnegative integer is an extended nonnegative integer, deduction form. (Contributed by AV, 10-Dec-2020.) |
⊢ (𝜑 → 𝐴 ∈ ℕ0) ⇒ ⊢ (𝜑 → 𝐴 ∈ ℕ0*) | ||
Theorem | nn0nepnfd 9050 | No standard nonnegative integer equals positive infinity, deduction form. (Contributed by AV, 10-Dec-2020.) |
⊢ (𝜑 → 𝐴 ∈ ℕ0) ⇒ ⊢ (𝜑 → 𝐴 ≠ +∞) | ||
Theorem | xnn0nemnf 9051 | No extended nonnegative integer equals negative infinity. (Contributed by AV, 10-Dec-2020.) |
⊢ (𝐴 ∈ ℕ0* → 𝐴 ≠ -∞) | ||
Theorem | xnn0xrnemnf 9052 | The extended nonnegative integers are extended reals without negative infinity. (Contributed by AV, 10-Dec-2020.) |
⊢ (𝐴 ∈ ℕ0* → (𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞)) | ||
Theorem | xnn0nnn0pnf 9053 | An extended nonnegative integer which is not a standard nonnegative integer is positive infinity. (Contributed by AV, 10-Dec-2020.) |
⊢ ((𝑁 ∈ ℕ0* ∧ ¬ 𝑁 ∈ ℕ0) → 𝑁 = +∞) | ||
Syntax | cz 9054 | Extend class notation to include the class of integers. |
class ℤ | ||
Definition | df-z 9055 | 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 9056 | Membership in the set of integers. (Contributed by NM, 8-Jan-2002.) |
⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 = 0 ∨ 𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ))) | ||
Theorem | nnnegz 9057 | The negative of a positive integer is an integer. (Contributed by NM, 12-Jan-2002.) |
⊢ (𝑁 ∈ ℕ → -𝑁 ∈ ℤ) | ||
Theorem | zre 9058 | An integer is a real. (Contributed by NM, 8-Jan-2002.) |
⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | ||
Theorem | zcn 9059 | An integer is a complex number. (Contributed by NM, 9-May-2004.) |
⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ) | ||
Theorem | zrei 9060 | An integer is a real number. (Contributed by NM, 14-Jul-2005.) |
⊢ 𝐴 ∈ ℤ ⇒ ⊢ 𝐴 ∈ ℝ | ||
Theorem | zssre 9061 | The integers are a subset of the reals. (Contributed by NM, 2-Aug-2004.) |
⊢ ℤ ⊆ ℝ | ||
Theorem | zsscn 9062 | The integers are a subset of the complex numbers. (Contributed by NM, 2-Aug-2004.) |
⊢ ℤ ⊆ ℂ | ||
Theorem | zex 9063 | The set of integers exists. (Contributed by NM, 30-Jul-2004.) (Revised by Mario Carneiro, 17-Nov-2014.) |
⊢ ℤ ∈ V | ||
Theorem | elnnz 9064 | Positive integer property expressed in terms of integers. (Contributed by NM, 8-Jan-2002.) |
⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℤ ∧ 0 < 𝑁)) | ||
Theorem | 0z 9065 | Zero is an integer. (Contributed by NM, 12-Jan-2002.) |
⊢ 0 ∈ ℤ | ||
Theorem | 0zd 9066 | Zero is an integer, deductive form (common case). (Contributed by David A. Wheeler, 8-Dec-2018.) |
⊢ (𝜑 → 0 ∈ ℤ) | ||
Theorem | elnn0z 9067 | Nonnegative integer property expressed in terms of integers. (Contributed by NM, 9-May-2004.) |
⊢ (𝑁 ∈ ℕ0 ↔ (𝑁 ∈ ℤ ∧ 0 ≤ 𝑁)) | ||
Theorem | elznn0nn 9068 | Integer property expressed in terms nonnegative integers and positive integers. (Contributed by NM, 10-May-2004.) |
⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℕ0 ∨ (𝑁 ∈ ℝ ∧ -𝑁 ∈ ℕ))) | ||
Theorem | elznn0 9069 | Integer property expressed in terms of nonnegative integers. (Contributed by NM, 9-May-2004.) |
⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 ∈ ℕ0 ∨ -𝑁 ∈ ℕ0))) | ||
Theorem | elznn 9070 | Integer property expressed in terms of positive integers and nonnegative integers. (Contributed by NM, 12-Jul-2005.) |
⊢ (𝑁 ∈ ℤ ↔ (𝑁 ∈ ℝ ∧ (𝑁 ∈ ℕ ∨ -𝑁 ∈ ℕ0))) | ||
Theorem | nnssz 9071 | Positive integers are a subset of integers. (Contributed by NM, 9-Jan-2002.) |
⊢ ℕ ⊆ ℤ | ||
Theorem | nn0ssz 9072 | Nonnegative integers are a subset of the integers. (Contributed by NM, 9-May-2004.) |
⊢ ℕ0 ⊆ ℤ | ||
Theorem | nnz 9073 | A positive integer is an integer. (Contributed by NM, 9-May-2004.) |
⊢ (𝑁 ∈ ℕ → 𝑁 ∈ ℤ) | ||
Theorem | nn0z 9074 | A nonnegative integer is an integer. (Contributed by NM, 9-May-2004.) |
⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℤ) | ||
Theorem | nnzi 9075 | A positive integer is an integer. (Contributed by Mario Carneiro, 18-Feb-2014.) |
⊢ 𝑁 ∈ ℕ ⇒ ⊢ 𝑁 ∈ ℤ | ||
Theorem | nn0zi 9076 | A nonnegative integer is an integer. (Contributed by Mario Carneiro, 18-Feb-2014.) |
⊢ 𝑁 ∈ ℕ0 ⇒ ⊢ 𝑁 ∈ ℤ | ||
Theorem | elnnz1 9077 | Positive integer property expressed in terms of integers. (Contributed by NM, 10-May-2004.) (Proof shortened by Mario Carneiro, 16-May-2014.) |
⊢ (𝑁 ∈ ℕ ↔ (𝑁 ∈ ℤ ∧ 1 ≤ 𝑁)) | ||
Theorem | nnzrab 9078 | Positive integers expressed as a subset of integers. (Contributed by NM, 3-Oct-2004.) |
⊢ ℕ = {𝑥 ∈ ℤ ∣ 1 ≤ 𝑥} | ||
Theorem | nn0zrab 9079 | Nonnegative integers expressed as a subset of integers. (Contributed by NM, 3-Oct-2004.) |
⊢ ℕ0 = {𝑥 ∈ ℤ ∣ 0 ≤ 𝑥} | ||
Theorem | 1z 9080 | One is an integer. (Contributed by NM, 10-May-2004.) |
⊢ 1 ∈ ℤ | ||
Theorem | 1zzd 9081 | 1 is an integer, deductive form (common case). (Contributed by David A. Wheeler, 6-Dec-2018.) |
⊢ (𝜑 → 1 ∈ ℤ) | ||
Theorem | 2z 9082 | Two is an integer. (Contributed by NM, 10-May-2004.) |
⊢ 2 ∈ ℤ | ||
Theorem | 3z 9083 | 3 is an integer. (Contributed by David A. Wheeler, 8-Dec-2018.) |
⊢ 3 ∈ ℤ | ||
Theorem | 4z 9084 | 4 is an integer. (Contributed by BJ, 26-Mar-2020.) |
⊢ 4 ∈ ℤ | ||
Theorem | znegcl 9085 | Closure law for negative integers. (Contributed by NM, 9-May-2004.) |
⊢ (𝑁 ∈ ℤ → -𝑁 ∈ ℤ) | ||
Theorem | neg1z 9086 | -1 is an integer (common case). (Contributed by David A. Wheeler, 5-Dec-2018.) |
⊢ -1 ∈ ℤ | ||
Theorem | znegclb 9087 | A number is an integer iff its negative is. (Contributed by Stefan O'Rear, 13-Sep-2014.) |
⊢ (𝐴 ∈ ℂ → (𝐴 ∈ ℤ ↔ -𝐴 ∈ ℤ)) | ||
Theorem | nn0negz 9088 | The negative of a nonnegative integer is an integer. (Contributed by NM, 9-May-2004.) |
⊢ (𝑁 ∈ ℕ0 → -𝑁 ∈ ℤ) | ||
Theorem | nn0negzi 9089 | The negative of a nonnegative integer is an integer. (Contributed by Mario Carneiro, 18-Feb-2014.) |
⊢ 𝑁 ∈ ℕ0 ⇒ ⊢ -𝑁 ∈ ℤ | ||
Theorem | peano2z 9090 | Second Peano postulate generalized to integers. (Contributed by NM, 13-Feb-2005.) |
⊢ (𝑁 ∈ ℤ → (𝑁 + 1) ∈ ℤ) | ||
Theorem | zaddcllempos 9091 | Lemma for zaddcl 9094. Special case in which 𝑁 is a positive integer. (Contributed by Jim Kingdon, 14-Mar-2020.) |
⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℕ) → (𝑀 + 𝑁) ∈ ℤ) | ||
Theorem | peano2zm 9092 | "Reverse" second Peano postulate for integers. (Contributed by NM, 12-Sep-2005.) |
⊢ (𝑁 ∈ ℤ → (𝑁 − 1) ∈ ℤ) | ||
Theorem | zaddcllemneg 9093 | Lemma for zaddcl 9094. Special case in which -𝑁 is a positive integer. (Contributed by Jim Kingdon, 14-Mar-2020.) |
⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℝ ∧ -𝑁 ∈ ℕ) → (𝑀 + 𝑁) ∈ ℤ) | ||
Theorem | zaddcl 9094 | Closure of addition of integers. (Contributed by NM, 9-May-2004.) (Proof shortened by Mario Carneiro, 16-May-2014.) |
⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 + 𝑁) ∈ ℤ) | ||
Theorem | zsubcl 9095 | Closure of subtraction of integers. (Contributed by NM, 11-May-2004.) |
⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 − 𝑁) ∈ ℤ) | ||
Theorem | ztri3or0 9096 | Integer trichotomy (with zero). (Contributed by Jim Kingdon, 14-Mar-2020.) |
⊢ (𝑁 ∈ ℤ → (𝑁 < 0 ∨ 𝑁 = 0 ∨ 0 < 𝑁)) | ||
Theorem | ztri3or 9097 | Integer trichotomy. (Contributed by Jim Kingdon, 14-Mar-2020.) |
⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 ∨ 𝑀 = 𝑁 ∨ 𝑁 < 𝑀)) | ||
Theorem | zletric 9098 | Trichotomy law. (Contributed by Jim Kingdon, 27-Mar-2020.) |
⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 ≤ 𝐵 ∨ 𝐵 ≤ 𝐴)) | ||
Theorem | zlelttric 9099 | Trichotomy law. (Contributed by Jim Kingdon, 17-Apr-2020.) |
⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 ≤ 𝐵 ∨ 𝐵 < 𝐴)) | ||
Theorem | zltnle 9100 | 'Less than' expressed in terms of 'less than or equal to'. (Contributed by Jim Kingdon, 14-Mar-2020.) |
⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 < 𝐵 ↔ ¬ 𝐵 ≤ 𝐴)) |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |