| Metamath
Proof Explorer Theorem List (p. 487 of 509) | < Previous Next > | |
| Bad symbols? Try the
GIF version. |
||
|
Mirrors > Metamath Home Page > MPE Home Page > Theorem List Contents > Recent Proofs This page: Page List |
||
| Color key: | (1-31431) |
(31432-32954) |
(32955-50888) |
| Type | Label | Description |
|---|---|---|
| Statement | ||
| Theorem | quad1 48601* | A condition for a quadratic equation with complex coefficients to have (exactly) one complex solution. (Contributed by AV, 23-Jan-2023.) |
| ⊢ (𝜑 → 𝐴 ∈ ℂ) & ⊢ (𝜑 → 𝐴 ≠ 0) & ⊢ (𝜑 → 𝐵 ∈ ℂ) & ⊢ (𝜑 → 𝐶 ∈ ℂ) & ⊢ (𝜑 → 𝐷 = ((𝐵↑2) − (4 · (𝐴 · 𝐶)))) ⇒ ⊢ (𝜑 → (∃!𝑥 ∈ ℂ ((𝐴 · (𝑥↑2)) + ((𝐵 · 𝑥) + 𝐶)) = 0 ↔ 𝐷 = 0)) | ||
| Theorem | requad01 48602* | A condition for a quadratic equation with real coefficients to have (at least) one real solution. (Contributed by AV, 23-Jan-2023.) |
| ⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 𝐴 ≠ 0) & ⊢ (𝜑 → 𝐵 ∈ ℝ) & ⊢ (𝜑 → 𝐶 ∈ ℝ) & ⊢ (𝜑 → 𝐷 = ((𝐵↑2) − (4 · (𝐴 · 𝐶)))) ⇒ ⊢ (𝜑 → (∃𝑥 ∈ ℝ ((𝐴 · (𝑥↑2)) + ((𝐵 · 𝑥) + 𝐶)) = 0 ↔ 0 ≤ 𝐷)) | ||
| Theorem | requad1 48603* | A condition for a quadratic equation with real coefficients to have (exactly) one real solution. (Contributed by AV, 26-Jan-2023.) |
| ⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 𝐴 ≠ 0) & ⊢ (𝜑 → 𝐵 ∈ ℝ) & ⊢ (𝜑 → 𝐶 ∈ ℝ) & ⊢ (𝜑 → 𝐷 = ((𝐵↑2) − (4 · (𝐴 · 𝐶)))) ⇒ ⊢ (𝜑 → (∃!𝑥 ∈ ℝ ((𝐴 · (𝑥↑2)) + ((𝐵 · 𝑥) + 𝐶)) = 0 ↔ 𝐷 = 0)) | ||
| Theorem | requad2 48604* | A condition for a quadratic equation with real coefficients to have (exactly) two different real solutions. (Contributed by AV, 28-Jan-2023.) |
| ⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 𝐴 ≠ 0) & ⊢ (𝜑 → 𝐵 ∈ ℝ) & ⊢ (𝜑 → 𝐶 ∈ ℝ) & ⊢ (𝜑 → 𝐷 = ((𝐵↑2) − (4 · (𝐴 · 𝐶)))) ⇒ ⊢ (𝜑 → (∃!𝑝 ∈ 𝒫 ℝ((♯‘𝑝) = 2 ∧ ∀𝑥 ∈ 𝑝 ((𝐴 · (𝑥↑2)) + ((𝐵 · 𝑥) + 𝐶)) = 0) ↔ 0 < 𝐷)) | ||
Even and odd numbers can be characterized in many different ways. In the following, the definition of even and odd numbers is based on the fact that dividing an even number (resp. an odd number increased by 1) by 2 is an integer, see df-even 48607 and df-odd 48608. Alternate definitions resp. characterizations are provided in dfeven2 48630, dfeven3 48639, dfeven4 48619 and in dfodd2 48617, dfodd3 48631, dfodd4 48640, dfodd5 48641, dfodd6 48618. Each characterization can be useful (and used) in an appropriate context, e.g. dfodd6 48618 in opoeALTV 48664 and dfodd3 48631 in oddprmALTV 48668. Having a fixed definition for even and odd numbers, and alternate characterizations as theorems, advanced theorems about even and/or odd numbers can be expressed more explicitly, and the appropriate characterization can be chosen for their proof, which may become clearer and sometimes also shorter (see, for example, divgcdoddALTV 48663 and divgcdodd 16826). | ||
| Syntax | ceven 48605 | Extend the definition of a class to include the set of even numbers. |
| class Even | ||
| Syntax | codd 48606 | Extend the definition of a class to include the set of odd numbers. |
| class Odd | ||
| Definition | df-even 48607 | Define the set of even numbers. (Contributed by AV, 14-Jun-2020.) |
| ⊢ Even = {𝑧 ∈ ℤ ∣ (𝑧 / 2) ∈ ℤ} | ||
| Definition | df-odd 48608 | Define the set of odd numbers. (Contributed by AV, 14-Jun-2020.) |
| ⊢ Odd = {𝑧 ∈ ℤ ∣ ((𝑧 + 1) / 2) ∈ ℤ} | ||
| Theorem | iseven 48609 | The predicate "is an even number". An even number is an integer which is divisible by 2, i.e. the result of dividing the even integer by 2 is still an integer. (Contributed by AV, 14-Jun-2020.) |
| ⊢ (𝑍 ∈ Even ↔ (𝑍 ∈ ℤ ∧ (𝑍 / 2) ∈ ℤ)) | ||
| Theorem | isodd 48610 | The predicate "is an odd number". An odd number is an integer which is not divisible by 2, i.e. the result of dividing the odd integer increased by 1 and then divided by 2 is still an integer. (Contributed by AV, 14-Jun-2020.) |
| ⊢ (𝑍 ∈ Odd ↔ (𝑍 ∈ ℤ ∧ ((𝑍 + 1) / 2) ∈ ℤ)) | ||
| Theorem | evenz 48611 | An even number is an integer. (Contributed by AV, 14-Jun-2020.) |
| ⊢ (𝑍 ∈ Even → 𝑍 ∈ ℤ) | ||
| Theorem | oddz 48612 | An odd number is an integer. (Contributed by AV, 14-Jun-2020.) |
| ⊢ (𝑍 ∈ Odd → 𝑍 ∈ ℤ) | ||
| Theorem | evendiv2z 48613 | The result of dividing an even number by 2 is an integer. (Contributed by AV, 15-Jun-2020.) |
| ⊢ (𝑍 ∈ Even → (𝑍 / 2) ∈ ℤ) | ||
| Theorem | oddp1div2z 48614 | The result of dividing an odd number increased by 1 and then divided by 2 is an integer. (Contributed by AV, 15-Jun-2020.) |
| ⊢ (𝑍 ∈ Odd → ((𝑍 + 1) / 2) ∈ ℤ) | ||
| Theorem | oddm1div2z 48615 | The result of dividing an odd number decreased by 1 and then divided by 2 is an integer. (Contributed by AV, 15-Jun-2020.) |
| ⊢ (𝑍 ∈ Odd → ((𝑍 − 1) / 2) ∈ ℤ) | ||
| Theorem | isodd2 48616 | The predicate "is an odd number". An odd number is an integer which is not divisible by 2, i.e. the result of dividing the odd number decreased by 1 and then divided by 2 is still an integer. (Contributed by AV, 15-Jun-2020.) |
| ⊢ (𝑍 ∈ Odd ↔ (𝑍 ∈ ℤ ∧ ((𝑍 − 1) / 2) ∈ ℤ)) | ||
| Theorem | dfodd2 48617 | Alternate definition for odd numbers. (Contributed by AV, 15-Jun-2020.) |
| ⊢ Odd = {𝑧 ∈ ℤ ∣ ((𝑧 − 1) / 2) ∈ ℤ} | ||
| Theorem | dfodd6 48618* | Alternate definition for odd numbers. (Contributed by AV, 18-Jun-2020.) |
| ⊢ Odd = {𝑧 ∈ ℤ ∣ ∃𝑖 ∈ ℤ 𝑧 = ((2 · 𝑖) + 1)} | ||
| Theorem | dfeven4 48619* | Alternate definition for even numbers. (Contributed by AV, 18-Jun-2020.) |
| ⊢ Even = {𝑧 ∈ ℤ ∣ ∃𝑖 ∈ ℤ 𝑧 = (2 · 𝑖)} | ||
| Theorem | evenm1odd 48620 | The predecessor of an even number is odd. (Contributed by AV, 16-Jun-2020.) |
| ⊢ (𝑍 ∈ Even → (𝑍 − 1) ∈ Odd ) | ||
| Theorem | evenp1odd 48621 | The successor of an even number is odd. (Contributed by AV, 16-Jun-2020.) |
| ⊢ (𝑍 ∈ Even → (𝑍 + 1) ∈ Odd ) | ||
| Theorem | oddp1eveni 48622 | The successor of an odd number is even. (Contributed by AV, 16-Jun-2020.) |
| ⊢ (𝑍 ∈ Odd → (𝑍 + 1) ∈ Even ) | ||
| Theorem | oddm1eveni 48623 | The predecessor of an odd number is even. (Contributed by AV, 6-Jul-2020.) |
| ⊢ (𝑍 ∈ Odd → (𝑍 − 1) ∈ Even ) | ||
| Theorem | evennodd 48624 | An even number is not an odd number. (Contributed by AV, 16-Jun-2020.) |
| ⊢ (𝑍 ∈ Even → ¬ 𝑍 ∈ Odd ) | ||
| Theorem | oddneven 48625 | An odd number is not an even number. (Contributed by AV, 16-Jun-2020.) |
| ⊢ (𝑍 ∈ Odd → ¬ 𝑍 ∈ Even ) | ||
| Theorem | enege 48626 | The negative of an even number is even. (Contributed by AV, 20-Jun-2020.) |
| ⊢ (𝐴 ∈ Even → -𝐴 ∈ Even ) | ||
| Theorem | onego 48627 | The negative of an odd number is odd. (Contributed by AV, 20-Jun-2020.) |
| ⊢ (𝐴 ∈ Odd → -𝐴 ∈ Odd ) | ||
| Theorem | m1expevenALTV 48628 | Exponentiation of -1 by an even power. (Contributed by Glauco Siliprandi, 29-Jun-2017.) (Revised by AV, 6-Jul-2020.) |
| ⊢ (𝑁 ∈ Even → (-1↑𝑁) = 1) | ||
| Theorem | m1expoddALTV 48629 | Exponentiation of -1 by an odd power. (Contributed by AV, 6-Jul-2020.) |
| ⊢ (𝑁 ∈ Odd → (-1↑𝑁) = -1) | ||
| Theorem | dfeven2 48630 | Alternate definition for even numbers. (Contributed by AV, 18-Jun-2020.) |
| ⊢ Even = {𝑧 ∈ ℤ ∣ 2 ∥ 𝑧} | ||
| Theorem | dfodd3 48631 | Alternate definition for odd numbers. (Contributed by AV, 18-Jun-2020.) |
| ⊢ Odd = {𝑧 ∈ ℤ ∣ ¬ 2 ∥ 𝑧} | ||
| Theorem | iseven2 48632 | The predicate "is an even number". An even number is an integer which is divisible by 2. (Contributed by AV, 18-Jun-2020.) |
| ⊢ (𝑍 ∈ Even ↔ (𝑍 ∈ ℤ ∧ 2 ∥ 𝑍)) | ||
| Theorem | isodd3 48633 | The predicate "is an odd number". An odd number is an integer which is not divisible by 2. (Contributed by AV, 18-Jun-2020.) |
| ⊢ (𝑍 ∈ Odd ↔ (𝑍 ∈ ℤ ∧ ¬ 2 ∥ 𝑍)) | ||
| Theorem | 2dvdseven 48634 | 2 divides an even number. (Contributed by AV, 18-Jun-2020.) |
| ⊢ (𝑍 ∈ Even → 2 ∥ 𝑍) | ||
| Theorem | m2even 48635 | A multiple of 2 is an even number. (Contributed by AV, 5-Jun-2023.) |
| ⊢ (𝑍 ∈ ℤ → (2 · 𝑍) ∈ Even ) | ||
| Theorem | 2ndvdsodd 48636 | 2 does not divide an odd number. (Contributed by AV, 18-Jun-2020.) |
| ⊢ (𝑍 ∈ Odd → ¬ 2 ∥ 𝑍) | ||
| Theorem | 2dvdsoddp1 48637 | 2 divides an odd number increased by 1. (Contributed by AV, 18-Jun-2020.) |
| ⊢ (𝑍 ∈ Odd → 2 ∥ (𝑍 + 1)) | ||
| Theorem | 2dvdsoddm1 48638 | 2 divides an odd number decreased by 1. (Contributed by AV, 18-Jun-2020.) |
| ⊢ (𝑍 ∈ Odd → 2 ∥ (𝑍 − 1)) | ||
| Theorem | dfeven3 48639 | Alternate definition for even numbers. (Contributed by AV, 18-Jun-2020.) |
| ⊢ Even = {𝑧 ∈ ℤ ∣ (𝑧 mod 2) = 0} | ||
| Theorem | dfodd4 48640 | Alternate definition for odd numbers. (Contributed by AV, 18-Jun-2020.) |
| ⊢ Odd = {𝑧 ∈ ℤ ∣ (𝑧 mod 2) = 1} | ||
| Theorem | dfodd5 48641 | Alternate definition for odd numbers. (Contributed by AV, 18-Jun-2020.) |
| ⊢ Odd = {𝑧 ∈ ℤ ∣ (𝑧 mod 2) ≠ 0} | ||
| Theorem | zefldiv2ALTV 48642 | The floor of an even number divided by 2 is equal to the even number divided by 2. (Contributed by AV, 7-Jun-2020.) (Revised by AV, 18-Jun-2020.) |
| ⊢ (𝑁 ∈ Even → (⌊‘(𝑁 / 2)) = (𝑁 / 2)) | ||
| Theorem | zofldiv2ALTV 48643 | The floor of an odd number divided by 2 is equal to the odd number first decreased by 1 and then divided by 2. (Contributed by AV, 7-Jun-2020.) (Revised by AV, 18-Jun-2020.) |
| ⊢ (𝑁 ∈ Odd → (⌊‘(𝑁 / 2)) = ((𝑁 − 1) / 2)) | ||
| Theorem | oddflALTV 48644 | Odd number representation by using the floor function. (Contributed by Glauco Siliprandi, 11-Dec-2019.) (Revised by AV, 18-Jun-2020.) |
| ⊢ (𝐾 ∈ Odd → 𝐾 = ((2 · (⌊‘(𝐾 / 2))) + 1)) | ||
| Theorem | iseven5 48645 | The predicate "is an even number". An even number and 2 have 2 as greatest common divisor. (Contributed by AV, 1-Jul-2020.) |
| ⊢ (𝑍 ∈ Even ↔ (𝑍 ∈ ℤ ∧ (2 gcd 𝑍) = 2)) | ||
| Theorem | isodd7 48646 | The predicate "is an odd number". An odd number and 2 have 1 as greatest common divisor. (Contributed by AV, 1-Jul-2020.) |
| ⊢ (𝑍 ∈ Odd ↔ (𝑍 ∈ ℤ ∧ (2 gcd 𝑍) = 1)) | ||
| Theorem | dfeven5 48647 | Alternate definition for even numbers. (Contributed by AV, 1-Jul-2020.) |
| ⊢ Even = {𝑧 ∈ ℤ ∣ (2 gcd 𝑧) = 2} | ||
| Theorem | dfodd7 48648 | Alternate definition for odd numbers. (Contributed by AV, 1-Jul-2020.) |
| ⊢ Odd = {𝑧 ∈ ℤ ∣ (2 gcd 𝑧) = 1} | ||
| Theorem | gcd2odd1 48649 | The greatest common divisor of an odd number and 2 is 1, i.e., 2 and any odd number are coprime. Remark: The proof using dfodd7 48648 is longer (see proof in comment)! (Contributed by AV, 5-Jun-2023.) |
| ⊢ (𝑍 ∈ Odd → (𝑍 gcd 2) = 1) | ||
| Theorem | zneoALTV 48650 | No even integer equals an odd integer (i.e. no integer can be both even and odd). Exercise 10(a) of [Apostol] p. 28. (Contributed by NM, 31-Jul-2004.) (Revised by AV, 16-Jun-2020.) |
| ⊢ ((𝐴 ∈ Even ∧ 𝐵 ∈ Odd ) → 𝐴 ≠ 𝐵) | ||
| Theorem | zeoALTV 48651 | An integer is even or odd. (Contributed by NM, 1-Jan-2006.) (Revised by AV, 16-Jun-2020.) |
| ⊢ (𝑍 ∈ ℤ → (𝑍 ∈ Even ∨ 𝑍 ∈ Odd )) | ||
| Theorem | zeo2ALTV 48652 | An integer is even or odd but not both. (Contributed by Mario Carneiro, 12-Sep-2015.) (Revised by AV, 16-Jun-2020.) |
| ⊢ (𝑍 ∈ ℤ → (𝑍 ∈ Even ↔ ¬ 𝑍 ∈ Odd )) | ||
| Theorem | nneoALTV 48653 | A positive integer is even or odd but not both. (Contributed by NM, 1-Jan-2006.) (Revised by AV, 19-Jun-2020.) |
| ⊢ (𝑁 ∈ ℕ → (𝑁 ∈ Even ↔ ¬ 𝑁 ∈ Odd )) | ||
| Theorem | nneoiALTV 48654 | A positive integer is even or odd but not both. (Contributed by NM, 20-Aug-2001.) (Revised by AV, 19-Jun-2020.) |
| ⊢ 𝑁 ∈ ℕ ⇒ ⊢ (𝑁 ∈ Even ↔ ¬ 𝑁 ∈ Odd ) | ||
| Theorem | odd2np1ALTV 48655* | An integer is odd iff it is one plus twice another integer. (Contributed by Scott Fenton, 3-Apr-2014.) (Revised by AV, 19-Jun-2020.) |
| ⊢ (𝑁 ∈ ℤ → (𝑁 ∈ Odd ↔ ∃𝑛 ∈ ℤ ((2 · 𝑛) + 1) = 𝑁)) | ||
| Theorem | oddm1evenALTV 48656 | An integer is odd iff its predecessor is even. (Contributed by Mario Carneiro, 5-Sep-2016.) (Revised by AV, 19-Jun-2020.) |
| ⊢ (𝑁 ∈ ℤ → (𝑁 ∈ Odd ↔ (𝑁 − 1) ∈ Even )) | ||
| Theorem | oddp1evenALTV 48657 | An integer is odd iff its successor is even. (Contributed by Mario Carneiro, 5-Sep-2016.) (Revised by AV, 19-Jun-2020.) |
| ⊢ (𝑁 ∈ ℤ → (𝑁 ∈ Odd ↔ (𝑁 + 1) ∈ Even )) | ||
| Theorem | oexpnegALTV 48658 | The exponential of the negative of a number, when the exponent is odd. (Contributed by Mario Carneiro, 25-Apr-2015.) (Revised by AV, 19-Jun-2020.) (Proof shortened by AV, 10-Jul-2022.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ ∧ 𝑁 ∈ Odd ) → (-𝐴↑𝑁) = -(𝐴↑𝑁)) | ||
| Theorem | oexpnegnz 48659 | The exponential of the negative of a number not being 0, when the exponent is odd. (Contributed by AV, 19-Jun-2020.) |
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ≠ 0 ∧ 𝑁 ∈ Odd ) → (-𝐴↑𝑁) = -(𝐴↑𝑁)) | ||
| Theorem | bits0ALTV 48660 | Value of the zeroth bit. (Contributed by Mario Carneiro, 5-Sep-2016.) (Revised by AV, 19-Jun-2020.) |
| ⊢ (𝑁 ∈ ℤ → (0 ∈ (bits‘𝑁) ↔ 𝑁 ∈ Odd )) | ||
| Theorem | bits0eALTV 48661 | The zeroth bit of an even number is zero. (Contributed by Mario Carneiro, 5-Sep-2016.) (Revised by AV, 19-Jun-2020.) |
| ⊢ (𝑁 ∈ Even → ¬ 0 ∈ (bits‘𝑁)) | ||
| Theorem | bits0oALTV 48662 | The zeroth bit of an odd number is zero. (Contributed by Mario Carneiro, 5-Sep-2016.) (Revised by AV, 19-Jun-2020.) |
| ⊢ (𝑁 ∈ Odd → 0 ∈ (bits‘𝑁)) | ||
| Theorem | divgcdoddALTV 48663 | Either 𝐴 / (𝐴 gcd 𝐵) is odd or 𝐵 / (𝐴 gcd 𝐵) is odd. (Contributed by Scott Fenton, 19-Apr-2014.) (Revised by AV, 21-Jun-2020.) |
| ⊢ ((𝐴 ∈ ℕ ∧ 𝐵 ∈ ℕ) → ((𝐴 / (𝐴 gcd 𝐵)) ∈ Odd ∨ (𝐵 / (𝐴 gcd 𝐵)) ∈ Odd )) | ||
| Theorem | opoeALTV 48664 | The sum of two odds is even. (Contributed by Scott Fenton, 7-Apr-2014.) (Revised by AV, 20-Jun-2020.) |
| ⊢ ((𝐴 ∈ Odd ∧ 𝐵 ∈ Odd ) → (𝐴 + 𝐵) ∈ Even ) | ||
| Theorem | opeoALTV 48665 | The sum of an odd and an even is odd. (Contributed by Scott Fenton, 7-Apr-2014.) (Revised by AV, 20-Jun-2020.) |
| ⊢ ((𝐴 ∈ Odd ∧ 𝐵 ∈ Even ) → (𝐴 + 𝐵) ∈ Odd ) | ||
| Theorem | omoeALTV 48666 | The difference of two odds is even. (Contributed by Scott Fenton, 7-Apr-2014.) (Revised by AV, 20-Jun-2020.) |
| ⊢ ((𝐴 ∈ Odd ∧ 𝐵 ∈ Odd ) → (𝐴 − 𝐵) ∈ Even ) | ||
| Theorem | omeoALTV 48667 | The difference of an odd and an even is odd. (Contributed by Scott Fenton, 7-Apr-2014.) (Revised by AV, 20-Jun-2020.) |
| ⊢ ((𝐴 ∈ Odd ∧ 𝐵 ∈ Even ) → (𝐴 − 𝐵) ∈ Odd ) | ||
| Theorem | oddprmALTV 48668 | A prime not equal to 2 is odd. (Contributed by Mario Carneiro, 4-Feb-2015.) (Revised by AV, 21-Jun-2020.) |
| ⊢ (𝑁 ∈ (ℙ ∖ {2}) → 𝑁 ∈ Odd ) | ||
| Theorem | 0evenALTV 48669 | 0 is an even number. (Contributed by AV, 11-Feb-2020.) (Revised by AV, 17-Jun-2020.) |
| ⊢ 0 ∈ Even | ||
| Theorem | 0noddALTV 48670 | 0 is not an odd number. (Contributed by AV, 3-Feb-2020.) (Revised by AV, 17-Jun-2020.) |
| ⊢ 0 ∉ Odd | ||
| Theorem | 1oddALTV 48671 | 1 is an odd number. (Contributed by AV, 3-Feb-2020.) (Revised by AV, 18-Jun-2020.) |
| ⊢ 1 ∈ Odd | ||
| Theorem | 1nevenALTV 48672 | 1 is not an even number. (Contributed by AV, 12-Feb-2020.) (Revised by AV, 18-Jun-2020.) |
| ⊢ 1 ∉ Even | ||
| Theorem | 2evenALTV 48673 | 2 is an even number. (Contributed by AV, 12-Feb-2020.) (Revised by AV, 18-Jun-2020.) |
| ⊢ 2 ∈ Even | ||
| Theorem | 2noddALTV 48674 | 2 is not an odd number. (Contributed by AV, 3-Feb-2020.) (Revised by AV, 18-Jun-2020.) |
| ⊢ 2 ∉ Odd | ||
| Theorem | nn0o1gt2ALTV 48675 | An odd nonnegative integer is either 1 or greater than 2. (Contributed by AV, 2-Jun-2020.) (Revised by AV, 21-Jun-2020.) |
| ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ∈ Odd ) → (𝑁 = 1 ∨ 2 < 𝑁)) | ||
| Theorem | nnoALTV 48676 | An alternate characterization of an odd number greater than 1. (Contributed by AV, 2-Jun-2020.) (Revised by AV, 21-Jun-2020.) |
| ⊢ ((𝑁 ∈ (ℤ≥‘2) ∧ 𝑁 ∈ Odd ) → ((𝑁 − 1) / 2) ∈ ℕ) | ||
| Theorem | nn0oALTV 48677 | An alternate characterization of an odd nonnegative integer. (Contributed by AV, 28-May-2020.) (Revised by AV, 21-Jun-2020.) |
| ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ∈ Odd ) → ((𝑁 − 1) / 2) ∈ ℕ0) | ||
| Theorem | nn0e 48678 | An alternate characterization of an even nonnegative integer. (Contributed by AV, 22-Jun-2020.) |
| ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ∈ Even ) → (𝑁 / 2) ∈ ℕ0) | ||
| Theorem | nneven 48679 | An alternate characterization of an even positive integer. (Contributed by AV, 5-Jun-2023.) |
| ⊢ ((𝑁 ∈ ℕ ∧ 𝑁 ∈ Even ) → (𝑁 / 2) ∈ ℕ) | ||
| Theorem | nn0onn0exALTV 48680* | For each odd nonnegative integer there is a nonnegative integer which, multiplied by 2 and increased by 1, results in the odd nonnegative integer. (Contributed by AV, 30-May-2020.) (Revised by AV, 22-Jun-2020.) |
| ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ∈ Odd ) → ∃𝑚 ∈ ℕ0 𝑁 = ((2 · 𝑚) + 1)) | ||
| Theorem | nn0enn0exALTV 48681* | For each even nonnegative integer there is a nonnegative integer which, multiplied by 2, results in the even nonnegative integer. (Contributed by AV, 30-May-2020.) (Revised by AV, 22-Jun-2020.) |
| ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑁 ∈ Even ) → ∃𝑚 ∈ ℕ0 𝑁 = (2 · 𝑚)) | ||
| Theorem | nnennexALTV 48682* | For each even positive integer there is a positive integer which, multiplied by 2, results in the even positive integer. (Contributed by AV, 5-Jun-2023.) |
| ⊢ ((𝑁 ∈ ℕ ∧ 𝑁 ∈ Even ) → ∃𝑚 ∈ ℕ 𝑁 = (2 · 𝑚)) | ||
| Theorem | nnpw2evenALTV 48683 | 2 to the power of a positive integer is even. (Contributed by AV, 2-Jun-2020.) (Revised by AV, 20-Jun-2020.) |
| ⊢ (𝑁 ∈ ℕ → (2↑𝑁) ∈ Even ) | ||
| Theorem | epoo 48684 | The sum of an even and an odd is odd. (Contributed by AV, 24-Jul-2020.) |
| ⊢ ((𝐴 ∈ Even ∧ 𝐵 ∈ Odd ) → (𝐴 + 𝐵) ∈ Odd ) | ||
| Theorem | emoo 48685 | The difference of an even and an odd is odd. (Contributed by AV, 24-Jul-2020.) |
| ⊢ ((𝐴 ∈ Even ∧ 𝐵 ∈ Odd ) → (𝐴 − 𝐵) ∈ Odd ) | ||
| Theorem | epee 48686 | The sum of two even numbers is even. (Contributed by AV, 21-Jul-2020.) |
| ⊢ ((𝐴 ∈ Even ∧ 𝐵 ∈ Even ) → (𝐴 + 𝐵) ∈ Even ) | ||
| Theorem | emee 48687 | The difference of two even numbers is even. (Contributed by AV, 21-Jul-2020.) |
| ⊢ ((𝐴 ∈ Even ∧ 𝐵 ∈ Even ) → (𝐴 − 𝐵) ∈ Even ) | ||
| Theorem | evensumeven 48688 | If a summand is even, the other summand is even iff the sum is even. (Contributed by AV, 21-Jul-2020.) |
| ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ Even ) → (𝐴 ∈ Even ↔ (𝐴 + 𝐵) ∈ Even )) | ||
| Theorem | 3odd 48689 | 3 is an odd number. (Contributed by AV, 20-Jul-2020.) |
| ⊢ 3 ∈ Odd | ||
| Theorem | 4even 48690 | 4 is an even number. (Contributed by AV, 23-Jul-2020.) |
| ⊢ 4 ∈ Even | ||
| Theorem | 5odd 48691 | 5 is an odd number. (Contributed by AV, 23-Jul-2020.) |
| ⊢ 5 ∈ Odd | ||
| Theorem | 6even 48692 | 6 is an even number. (Contributed by AV, 20-Jul-2020.) |
| ⊢ 6 ∈ Even | ||
| Theorem | 7odd 48693 | 7 is an odd number. (Contributed by AV, 20-Jul-2020.) |
| ⊢ 7 ∈ Odd | ||
| Theorem | 8even 48694 | 8 is an even number. (Contributed by AV, 23-Jul-2020.) |
| ⊢ 8 ∈ Even | ||
| Theorem | evenprm2 48695 | A prime number is even iff it is 2. (Contributed by AV, 21-Jul-2020.) |
| ⊢ (𝑃 ∈ ℙ → (𝑃 ∈ Even ↔ 𝑃 = 2)) | ||
| Theorem | oddprmne2 48696 | Every prime number not being 2 is an odd prime number. (Contributed by AV, 21-Aug-2021.) |
| ⊢ ((𝑃 ∈ ℙ ∧ 𝑃 ∈ Odd ) ↔ 𝑃 ∈ (ℙ ∖ {2})) | ||
| Theorem | oddprmuzge3 48697 | A prime number which is odd is an integer greater than or equal to 3. (Contributed by AV, 20-Jul-2020.) (Proof shortened by AV, 21-Aug-2021.) |
| ⊢ ((𝑃 ∈ ℙ ∧ 𝑃 ∈ Odd ) → 𝑃 ∈ (ℤ≥‘3)) | ||
| Theorem | evenltle 48698 | If an even number is greater than another even number, then it is greater than or equal to the other even number plus 2. (Contributed by AV, 25-Dec-2021.) |
| ⊢ ((𝑁 ∈ Even ∧ 𝑀 ∈ Even ∧ 𝑀 < 𝑁) → (𝑀 + 2) ≤ 𝑁) | ||
| Theorem | odd2prm2 48699 | If an odd number is the sum of two prime numbers, one of the prime numbers must be 2. (Contributed by AV, 26-Dec-2021.) |
| ⊢ ((𝑁 ∈ Odd ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ) ∧ 𝑁 = (𝑃 + 𝑄)) → (𝑃 = 2 ∨ 𝑄 = 2)) | ||
| Theorem | even3prm2 48700 | If an even number is the sum of three prime numbers, one of the prime numbers must be 2. (Contributed by AV, 25-Dec-2021.) |
| ⊢ ((𝑁 ∈ Even ∧ (𝑃 ∈ ℙ ∧ 𝑄 ∈ ℙ ∧ 𝑅 ∈ ℙ) ∧ 𝑁 = ((𝑃 + 𝑄) + 𝑅)) → (𝑃 = 2 ∨ 𝑄 = 2 ∨ 𝑅 = 2)) | ||
| < Previous Next > |
| Copyright terms: Public domain | < Previous Next > |