![]() |
Metamath
Proof Explorer Theorem List (p. 125 of 486) | < 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-30846) |
![]() (30847-32369) |
![]() (32370-48587) |
Type | Label | Description |
---|---|---|
Statement | ||
Theorem | 3p1e4 12401 | 3 + 1 = 4. (Contributed by Mario Carneiro, 18-Apr-2015.) |
⊢ (3 + 1) = 4 | ||
Theorem | 4p1e5 12402 | 4 + 1 = 5. (Contributed by Mario Carneiro, 18-Apr-2015.) |
⊢ (4 + 1) = 5 | ||
Theorem | 5p1e6 12403 | 5 + 1 = 6. (Contributed by Mario Carneiro, 18-Apr-2015.) |
⊢ (5 + 1) = 6 | ||
Theorem | 6p1e7 12404 | 6 + 1 = 7. (Contributed by Mario Carneiro, 18-Apr-2015.) |
⊢ (6 + 1) = 7 | ||
Theorem | 7p1e8 12405 | 7 + 1 = 8. (Contributed by Mario Carneiro, 18-Apr-2015.) |
⊢ (7 + 1) = 8 | ||
Theorem | 8p1e9 12406 | 8 + 1 = 9. (Contributed by Mario Carneiro, 18-Apr-2015.) |
⊢ (8 + 1) = 9 | ||
Theorem | 3p2e5 12407 | 3 + 2 = 5. (Contributed by NM, 11-May-2004.) |
⊢ (3 + 2) = 5 | ||
Theorem | 3p3e6 12408 | 3 + 3 = 6. (Contributed by NM, 11-May-2004.) |
⊢ (3 + 3) = 6 | ||
Theorem | 4p2e6 12409 | 4 + 2 = 6. (Contributed by NM, 11-May-2004.) |
⊢ (4 + 2) = 6 | ||
Theorem | 4p3e7 12410 | 4 + 3 = 7. (Contributed by NM, 11-May-2004.) |
⊢ (4 + 3) = 7 | ||
Theorem | 4p4e8 12411 | 4 + 4 = 8. (Contributed by NM, 11-May-2004.) |
⊢ (4 + 4) = 8 | ||
Theorem | 5p2e7 12412 | 5 + 2 = 7. (Contributed by NM, 11-May-2004.) |
⊢ (5 + 2) = 7 | ||
Theorem | 5p3e8 12413 | 5 + 3 = 8. (Contributed by NM, 11-May-2004.) |
⊢ (5 + 3) = 8 | ||
Theorem | 5p4e9 12414 | 5 + 4 = 9. (Contributed by NM, 11-May-2004.) |
⊢ (5 + 4) = 9 | ||
Theorem | 6p2e8 12415 | 6 + 2 = 8. (Contributed by NM, 11-May-2004.) |
⊢ (6 + 2) = 8 | ||
Theorem | 6p3e9 12416 | 6 + 3 = 9. (Contributed by NM, 11-May-2004.) |
⊢ (6 + 3) = 9 | ||
Theorem | 7p2e9 12417 | 7 + 2 = 9. (Contributed by NM, 11-May-2004.) |
⊢ (7 + 2) = 9 | ||
Theorem | 1t1e1 12418 | 1 times 1 equals 1. (Contributed by David A. Wheeler, 7-Jul-2016.) |
⊢ (1 · 1) = 1 | ||
Theorem | 2t1e2 12419 | 2 times 1 equals 2. (Contributed by David A. Wheeler, 6-Dec-2018.) |
⊢ (2 · 1) = 2 | ||
Theorem | 2t2e4 12420 | 2 times 2 equals 4. (Contributed by NM, 1-Aug-1999.) |
⊢ (2 · 2) = 4 | ||
Theorem | 3t1e3 12421 | 3 times 1 equals 3. (Contributed by David A. Wheeler, 8-Dec-2018.) |
⊢ (3 · 1) = 3 | ||
Theorem | 3t2e6 12422 | 3 times 2 equals 6. (Contributed by NM, 2-Aug-2004.) |
⊢ (3 · 2) = 6 | ||
Theorem | 3t3e9 12423 | 3 times 3 equals 9. (Contributed by NM, 11-May-2004.) |
⊢ (3 · 3) = 9 | ||
Theorem | 4t2e8 12424 | 4 times 2 equals 8. (Contributed by NM, 2-Aug-2004.) |
⊢ (4 · 2) = 8 | ||
Theorem | 2t0e0 12425 | 2 times 0 equals 0. (Contributed by David A. Wheeler, 8-Dec-2018.) |
⊢ (2 · 0) = 0 | ||
Theorem | 4d2e2 12426 | One half of four is two. (Contributed by NM, 3-Sep-1999.) |
⊢ (4 / 2) = 2 | ||
Theorem | 1lt2 12427 | 1 is less than 2. (Contributed by NM, 24-Feb-2005.) |
⊢ 1 < 2 | ||
Theorem | 2lt3 12428 | 2 is less than 3. (Contributed by NM, 26-Sep-2010.) |
⊢ 2 < 3 | ||
Theorem | 1lt3 12429 | 1 is less than 3. (Contributed by NM, 26-Sep-2010.) |
⊢ 1 < 3 | ||
Theorem | 3lt4 12430 | 3 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 3 < 4 | ||
Theorem | 2lt4 12431 | 2 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 2 < 4 | ||
Theorem | 1lt4 12432 | 1 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 1 < 4 | ||
Theorem | 4lt5 12433 | 4 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 4 < 5 | ||
Theorem | 3lt5 12434 | 3 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 3 < 5 | ||
Theorem | 2lt5 12435 | 2 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 2 < 5 | ||
Theorem | 1lt5 12436 | 1 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 1 < 5 | ||
Theorem | 5lt6 12437 | 5 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 5 < 6 | ||
Theorem | 4lt6 12438 | 4 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 4 < 6 | ||
Theorem | 3lt6 12439 | 3 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 3 < 6 | ||
Theorem | 2lt6 12440 | 2 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 2 < 6 | ||
Theorem | 1lt6 12441 | 1 is less than 6. (Contributed by NM, 19-Oct-2012.) |
⊢ 1 < 6 | ||
Theorem | 6lt7 12442 | 6 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 6 < 7 | ||
Theorem | 5lt7 12443 | 5 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 5 < 7 | ||
Theorem | 4lt7 12444 | 4 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 4 < 7 | ||
Theorem | 3lt7 12445 | 3 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 3 < 7 | ||
Theorem | 2lt7 12446 | 2 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 2 < 7 | ||
Theorem | 1lt7 12447 | 1 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 1 < 7 | ||
Theorem | 7lt8 12448 | 7 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 7 < 8 | ||
Theorem | 6lt8 12449 | 6 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 6 < 8 | ||
Theorem | 5lt8 12450 | 5 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 5 < 8 | ||
Theorem | 4lt8 12451 | 4 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 4 < 8 | ||
Theorem | 3lt8 12452 | 3 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 3 < 8 | ||
Theorem | 2lt8 12453 | 2 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 2 < 8 | ||
Theorem | 1lt8 12454 | 1 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.) |
⊢ 1 < 8 | ||
Theorem | 8lt9 12455 | 8 is less than 9. (Contributed by Mario Carneiro, 19-Feb-2014.) |
⊢ 8 < 9 | ||
Theorem | 7lt9 12456 | 7 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.) |
⊢ 7 < 9 | ||
Theorem | 6lt9 12457 | 6 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.) |
⊢ 6 < 9 | ||
Theorem | 5lt9 12458 | 5 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.) |
⊢ 5 < 9 | ||
Theorem | 4lt9 12459 | 4 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.) |
⊢ 4 < 9 | ||
Theorem | 3lt9 12460 | 3 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.) |
⊢ 3 < 9 | ||
Theorem | 2lt9 12461 | 2 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.) |
⊢ 2 < 9 | ||
Theorem | 1lt9 12462 | 1 is less than 9. (Contributed by NM, 19-Oct-2012.) (Revised by Mario Carneiro, 9-Mar-2015.) |
⊢ 1 < 9 | ||
Theorem | 0ne2 12463 | 0 is not equal to 2. (Contributed by David A. Wheeler, 8-Dec-2018.) |
⊢ 0 ≠ 2 | ||
Theorem | 1ne2 12464 | 1 is not equal to 2. (Contributed by NM, 19-Oct-2012.) |
⊢ 1 ≠ 2 | ||
Theorem | 1le2 12465 | 1 is less than or equal to 2. (Contributed by David A. Wheeler, 8-Dec-2018.) |
⊢ 1 ≤ 2 | ||
Theorem | 2cnne0 12466 | 2 is a nonzero complex number. (Contributed by David A. Wheeler, 7-Dec-2018.) |
⊢ (2 ∈ ℂ ∧ 2 ≠ 0) | ||
Theorem | 2rene0 12467 | 2 is a nonzero real number. (Contributed by David A. Wheeler, 8-Dec-2018.) |
⊢ (2 ∈ ℝ ∧ 2 ≠ 0) | ||
Theorem | 1le3 12468 | 1 is less than or equal to 3. (Contributed by David A. Wheeler, 8-Dec-2018.) |
⊢ 1 ≤ 3 | ||
Theorem | neg1mulneg1e1 12469 | -1 · -1 is 1. (Contributed by David A. Wheeler, 8-Dec-2018.) |
⊢ (-1 · -1) = 1 | ||
Theorem | halfre 12470 | One-half is real. (Contributed by David A. Wheeler, 8-Dec-2018.) |
⊢ (1 / 2) ∈ ℝ | ||
Theorem | halfcn 12471 | One-half is a complex number. (Contributed by David A. Wheeler, 8-Dec-2018.) |
⊢ (1 / 2) ∈ ℂ | ||
Theorem | halfgt0 12472 | One-half is greater than zero. (Contributed by NM, 24-Feb-2005.) |
⊢ 0 < (1 / 2) | ||
Theorem | halfge0 12473 | One-half is not negative. (Contributed by AV, 7-Jun-2020.) |
⊢ 0 ≤ (1 / 2) | ||
Theorem | halflt1 12474 | One-half is less than one. (Contributed by NM, 24-Feb-2005.) |
⊢ (1 / 2) < 1 | ||
Theorem | 1mhlfehlf 12475 | Prove that 1 - 1/2 = 1/2. (Contributed by David A. Wheeler, 4-Jan-2017.) |
⊢ (1 − (1 / 2)) = (1 / 2) | ||
Theorem | 8th4div3 12476 | An eighth of four thirds is a sixth. (Contributed by Paul Chapman, 24-Nov-2007.) |
⊢ ((1 / 8) · (4 / 3)) = (1 / 6) | ||
Theorem | halfpm6th 12477 | One half plus or minus one sixth. (Contributed by Paul Chapman, 17-Jan-2008.) |
⊢ (((1 / 2) − (1 / 6)) = (1 / 3) ∧ ((1 / 2) + (1 / 6)) = (2 / 3)) | ||
Theorem | it0e0 12478 | i times 0 equals 0. (Contributed by David A. Wheeler, 8-Dec-2018.) |
⊢ (i · 0) = 0 | ||
Theorem | 2mulicn 12479 | (2 · i) ∈ ℂ. (Contributed by David A. Wheeler, 8-Dec-2018.) |
⊢ (2 · i) ∈ ℂ | ||
Theorem | 2muline0 12480 | (2 · i) ≠ 0. (Contributed by David A. Wheeler, 8-Dec-2018.) |
⊢ (2 · i) ≠ 0 | ||
Theorem | halfcl 12481 | Closure of half of a number. (Contributed by NM, 1-Jan-2006.) |
⊢ (𝐴 ∈ ℂ → (𝐴 / 2) ∈ ℂ) | ||
Theorem | rehalfcl 12482 | Real closure of half. (Contributed by NM, 1-Jan-2006.) |
⊢ (𝐴 ∈ ℝ → (𝐴 / 2) ∈ ℝ) | ||
Theorem | half0 12483 | Half of a number is zero iff the number is zero. (Contributed by NM, 20-Apr-2006.) |
⊢ (𝐴 ∈ ℂ → ((𝐴 / 2) = 0 ↔ 𝐴 = 0)) | ||
Theorem | 2halves 12484 | Two halves make a whole. (Contributed by NM, 11-Apr-2005.) |
⊢ (𝐴 ∈ ℂ → ((𝐴 / 2) + (𝐴 / 2)) = 𝐴) | ||
Theorem | halfpos2 12485 | A number is positive iff its half is positive. (Contributed by NM, 10-Apr-2005.) |
⊢ (𝐴 ∈ ℝ → (0 < 𝐴 ↔ 0 < (𝐴 / 2))) | ||
Theorem | halfpos 12486 | A positive number is greater than its half. (Contributed by NM, 28-Oct-2004.) (Proof shortened by Mario Carneiro, 27-May-2016.) |
⊢ (𝐴 ∈ ℝ → (0 < 𝐴 ↔ (𝐴 / 2) < 𝐴)) | ||
Theorem | halfnneg2 12487 | A number is nonnegative iff its half is nonnegative. (Contributed by NM, 9-Dec-2005.) |
⊢ (𝐴 ∈ ℝ → (0 ≤ 𝐴 ↔ 0 ≤ (𝐴 / 2))) | ||
Theorem | halfaddsubcl 12488 | Closure of half-sum and half-difference. (Contributed by Paul Chapman, 12-Oct-2007.) |
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((𝐴 + 𝐵) / 2) ∈ ℂ ∧ ((𝐴 − 𝐵) / 2) ∈ ℂ)) | ||
Theorem | halfaddsub 12489 | Sum and difference of half-sum and half-difference. (Contributed by Paul Chapman, 12-Oct-2007.) |
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((((𝐴 + 𝐵) / 2) + ((𝐴 − 𝐵) / 2)) = 𝐴 ∧ (((𝐴 + 𝐵) / 2) − ((𝐴 − 𝐵) / 2)) = 𝐵)) | ||
Theorem | subhalfhalf 12490 | Subtracting the half of a number from the number yields the half of the number. (Contributed by AV, 28-Jun-2021.) |
⊢ (𝐴 ∈ ℂ → (𝐴 − (𝐴 / 2)) = (𝐴 / 2)) | ||
Theorem | lt2halves 12491 | A sum is less than the whole if each term is less than half. (Contributed by NM, 13-Dec-2006.) |
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < (𝐶 / 2) ∧ 𝐵 < (𝐶 / 2)) → (𝐴 + 𝐵) < 𝐶)) | ||
Theorem | addltmul 12492 | Sum is less than product for numbers greater than 2. (Contributed by Stefan Allan, 24-Sep-2010.) |
⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (2 < 𝐴 ∧ 2 < 𝐵)) → (𝐴 + 𝐵) < (𝐴 · 𝐵)) | ||
Theorem | nominpos 12493* | There is no smallest positive real number. (Contributed by NM, 28-Oct-2004.) |
⊢ ¬ ∃𝑥 ∈ ℝ (0 < 𝑥 ∧ ¬ ∃𝑦 ∈ ℝ (0 < 𝑦 ∧ 𝑦 < 𝑥)) | ||
Theorem | avglt1 12494 | Ordering property for average. (Contributed by Mario Carneiro, 28-May-2014.) |
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 ↔ 𝐴 < ((𝐴 + 𝐵) / 2))) | ||
Theorem | avglt2 12495 | Ordering property for average. (Contributed by Mario Carneiro, 28-May-2014.) |
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 ↔ ((𝐴 + 𝐵) / 2) < 𝐵)) | ||
Theorem | avgle1 12496 | Ordering property for average. (Contributed by Mario Carneiro, 28-May-2014.) |
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ 𝐴 ≤ ((𝐴 + 𝐵) / 2))) | ||
Theorem | avgle2 12497 | Ordering property for average. (Contributed by Jeff Hankins, 15-Sep-2013.) (Revised by Mario Carneiro, 28-May-2014.) |
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ ((𝐴 + 𝐵) / 2) ≤ 𝐵)) | ||
Theorem | avgle 12498 | The average of two numbers is less than or equal to at least one of them. (Contributed by NM, 9-Dec-2005.) (Revised by Mario Carneiro, 28-May-2014.) |
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (((𝐴 + 𝐵) / 2) ≤ 𝐴 ∨ ((𝐴 + 𝐵) / 2) ≤ 𝐵)) | ||
Theorem | 2timesd 12499 | Two times a number. (Contributed by Mario Carneiro, 27-May-2016.) |
⊢ (𝜑 → 𝐴 ∈ ℂ) ⇒ ⊢ (𝜑 → (2 · 𝐴) = (𝐴 + 𝐴)) | ||
Theorem | times2d 12500 | A number times 2. (Contributed by Mario Carneiro, 27-May-2016.) |
⊢ (𝜑 → 𝐴 ∈ ℂ) ⇒ ⊢ (𝜑 → (𝐴 · 2) = (𝐴 + 𝐴)) |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |