|  Home | Metamath
Proof Explorer Theorem List (p. 125 of 494) | < 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: |  Metamath Proof Explorer (1-30938) |  Hilbert Space Explorer (30939-32461) |  Users' Mathboxes (32462-49379) | 
| Type | Label | Description | 
|---|---|---|
| Statement | ||
| Theorem | 9m1e8 12401 | 9 - 1 = 8. (Contributed by AV, 6-Sep-2021.) | 
| ⊢ (9 − 1) = 8 | ||
| Theorem | 2p2e4 12402 | Two plus two equals four. For more information, see "2+2=4 Trivia" on the Metamath Proof Explorer Home Page: mmset.html#trivia. This proof is simple, but it depends on many other proof steps because 2 and 4 are complex numbers and thus it depends on our construction of complex numbers. The proof o2p2e4 8580 is similar but proves 2 + 2 = 4 using ordinal natural numbers (finite integers starting at 0), so that proof depends on fewer intermediate steps. (Contributed by NM, 27-May-1999.) | 
| ⊢ (2 + 2) = 4 | ||
| Theorem | 2times 12403 | Two times a number. (Contributed by NM, 10-Oct-2004.) (Revised by Mario Carneiro, 27-May-2016.) (Proof shortened by AV, 26-Feb-2020.) | 
| ⊢ (𝐴 ∈ ℂ → (2 · 𝐴) = (𝐴 + 𝐴)) | ||
| Theorem | times2 12404 | A number times 2. (Contributed by NM, 16-Oct-2007.) | 
| ⊢ (𝐴 ∈ ℂ → (𝐴 · 2) = (𝐴 + 𝐴)) | ||
| Theorem | 2timesi 12405 | Two times a number. (Contributed by NM, 1-Aug-1999.) | 
| ⊢ 𝐴 ∈ ℂ ⇒ ⊢ (2 · 𝐴) = (𝐴 + 𝐴) | ||
| Theorem | times2i 12406 | A number times 2. (Contributed by NM, 11-May-2004.) | 
| ⊢ 𝐴 ∈ ℂ ⇒ ⊢ (𝐴 · 2) = (𝐴 + 𝐴) | ||
| Theorem | 2txmxeqx 12407 | Two times a complex number minus the number itself results in the number itself. (Contributed by Alexander van der Vekens, 8-Jun-2018.) | 
| ⊢ (𝑋 ∈ ℂ → ((2 · 𝑋) − 𝑋) = 𝑋) | ||
| Theorem | 2div2e1 12408 | 2 divided by 2 is 1. (Contributed by David A. Wheeler, 8-Dec-2018.) | 
| ⊢ (2 / 2) = 1 | ||
| Theorem | 2p1e3 12409 | 2 + 1 = 3. (Contributed by Mario Carneiro, 18-Apr-2015.) | 
| ⊢ (2 + 1) = 3 | ||
| Theorem | 1p2e3 12410 | 1 + 2 = 3. For a shorter proof using addcomli 11454, see 1p2e3ALT 12411. (Contributed by David A. Wheeler, 8-Dec-2018.) Reduce dependencies on axioms. (Revised by Steven Nguyen, 12-Dec-2022.) | 
| ⊢ (1 + 2) = 3 | ||
| Theorem | 1p2e3ALT 12411 | Alternate proof of 1p2e3 12410, shorter but using more axioms. (Contributed by David A. Wheeler, 8-Dec-2018.) (New usage is discouraged.) (Proof modification is discouraged.) | 
| ⊢ (1 + 2) = 3 | ||
| Theorem | 3p1e4 12412 | 3 + 1 = 4. (Contributed by Mario Carneiro, 18-Apr-2015.) | 
| ⊢ (3 + 1) = 4 | ||
| Theorem | 4p1e5 12413 | 4 + 1 = 5. (Contributed by Mario Carneiro, 18-Apr-2015.) | 
| ⊢ (4 + 1) = 5 | ||
| Theorem | 5p1e6 12414 | 5 + 1 = 6. (Contributed by Mario Carneiro, 18-Apr-2015.) | 
| ⊢ (5 + 1) = 6 | ||
| Theorem | 6p1e7 12415 | 6 + 1 = 7. (Contributed by Mario Carneiro, 18-Apr-2015.) | 
| ⊢ (6 + 1) = 7 | ||
| Theorem | 7p1e8 12416 | 7 + 1 = 8. (Contributed by Mario Carneiro, 18-Apr-2015.) | 
| ⊢ (7 + 1) = 8 | ||
| Theorem | 8p1e9 12417 | 8 + 1 = 9. (Contributed by Mario Carneiro, 18-Apr-2015.) | 
| ⊢ (8 + 1) = 9 | ||
| Theorem | 3p2e5 12418 | 3 + 2 = 5. (Contributed by NM, 11-May-2004.) | 
| ⊢ (3 + 2) = 5 | ||
| Theorem | 3p3e6 12419 | 3 + 3 = 6. (Contributed by NM, 11-May-2004.) | 
| ⊢ (3 + 3) = 6 | ||
| Theorem | 4p2e6 12420 | 4 + 2 = 6. (Contributed by NM, 11-May-2004.) | 
| ⊢ (4 + 2) = 6 | ||
| Theorem | 4p3e7 12421 | 4 + 3 = 7. (Contributed by NM, 11-May-2004.) | 
| ⊢ (4 + 3) = 7 | ||
| Theorem | 4p4e8 12422 | 4 + 4 = 8. (Contributed by NM, 11-May-2004.) | 
| ⊢ (4 + 4) = 8 | ||
| Theorem | 5p2e7 12423 | 5 + 2 = 7. (Contributed by NM, 11-May-2004.) | 
| ⊢ (5 + 2) = 7 | ||
| Theorem | 5p3e8 12424 | 5 + 3 = 8. (Contributed by NM, 11-May-2004.) | 
| ⊢ (5 + 3) = 8 | ||
| Theorem | 5p4e9 12425 | 5 + 4 = 9. (Contributed by NM, 11-May-2004.) | 
| ⊢ (5 + 4) = 9 | ||
| Theorem | 6p2e8 12426 | 6 + 2 = 8. (Contributed by NM, 11-May-2004.) | 
| ⊢ (6 + 2) = 8 | ||
| Theorem | 6p3e9 12427 | 6 + 3 = 9. (Contributed by NM, 11-May-2004.) | 
| ⊢ (6 + 3) = 9 | ||
| Theorem | 7p2e9 12428 | 7 + 2 = 9. (Contributed by NM, 11-May-2004.) | 
| ⊢ (7 + 2) = 9 | ||
| Theorem | 1t1e1 12429 | 1 times 1 equals 1. (Contributed by David A. Wheeler, 7-Jul-2016.) | 
| ⊢ (1 · 1) = 1 | ||
| Theorem | 2t1e2 12430 | 2 times 1 equals 2. (Contributed by David A. Wheeler, 6-Dec-2018.) | 
| ⊢ (2 · 1) = 2 | ||
| Theorem | 2t2e4 12431 | 2 times 2 equals 4. (Contributed by NM, 1-Aug-1999.) | 
| ⊢ (2 · 2) = 4 | ||
| Theorem | 3t1e3 12432 | 3 times 1 equals 3. (Contributed by David A. Wheeler, 8-Dec-2018.) | 
| ⊢ (3 · 1) = 3 | ||
| Theorem | 3t2e6 12433 | 3 times 2 equals 6. (Contributed by NM, 2-Aug-2004.) | 
| ⊢ (3 · 2) = 6 | ||
| Theorem | 3t3e9 12434 | 3 times 3 equals 9. (Contributed by NM, 11-May-2004.) | 
| ⊢ (3 · 3) = 9 | ||
| Theorem | 4t2e8 12435 | 4 times 2 equals 8. (Contributed by NM, 2-Aug-2004.) | 
| ⊢ (4 · 2) = 8 | ||
| Theorem | 2t0e0 12436 | 2 times 0 equals 0. (Contributed by David A. Wheeler, 8-Dec-2018.) | 
| ⊢ (2 · 0) = 0 | ||
| Theorem | 4d2e2 12437 | One half of four is two. (Contributed by NM, 3-Sep-1999.) | 
| ⊢ (4 / 2) = 2 | ||
| Theorem | 1lt2 12438 | 1 is less than 2. (Contributed by NM, 24-Feb-2005.) | 
| ⊢ 1 < 2 | ||
| Theorem | 2lt3 12439 | 2 is less than 3. (Contributed by NM, 26-Sep-2010.) | 
| ⊢ 2 < 3 | ||
| Theorem | 1lt3 12440 | 1 is less than 3. (Contributed by NM, 26-Sep-2010.) | 
| ⊢ 1 < 3 | ||
| Theorem | 3lt4 12441 | 3 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 3 < 4 | ||
| Theorem | 2lt4 12442 | 2 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 2 < 4 | ||
| Theorem | 1lt4 12443 | 1 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 1 < 4 | ||
| Theorem | 4lt5 12444 | 4 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 4 < 5 | ||
| Theorem | 3lt5 12445 | 3 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 3 < 5 | ||
| Theorem | 2lt5 12446 | 2 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 2 < 5 | ||
| Theorem | 1lt5 12447 | 1 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 1 < 5 | ||
| Theorem | 5lt6 12448 | 5 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 5 < 6 | ||
| Theorem | 4lt6 12449 | 4 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 4 < 6 | ||
| Theorem | 3lt6 12450 | 3 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 3 < 6 | ||
| Theorem | 2lt6 12451 | 2 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 2 < 6 | ||
| Theorem | 1lt6 12452 | 1 is less than 6. (Contributed by NM, 19-Oct-2012.) | 
| ⊢ 1 < 6 | ||
| Theorem | 6lt7 12453 | 6 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 6 < 7 | ||
| Theorem | 5lt7 12454 | 5 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 5 < 7 | ||
| Theorem | 4lt7 12455 | 4 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 4 < 7 | ||
| Theorem | 3lt7 12456 | 3 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 3 < 7 | ||
| Theorem | 2lt7 12457 | 2 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 2 < 7 | ||
| Theorem | 1lt7 12458 | 1 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 1 < 7 | ||
| Theorem | 7lt8 12459 | 7 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 7 < 8 | ||
| Theorem | 6lt8 12460 | 6 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 6 < 8 | ||
| Theorem | 5lt8 12461 | 5 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 5 < 8 | ||
| Theorem | 4lt8 12462 | 4 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 4 < 8 | ||
| Theorem | 3lt8 12463 | 3 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 3 < 8 | ||
| Theorem | 2lt8 12464 | 2 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 2 < 8 | ||
| Theorem | 1lt8 12465 | 1 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.) | 
| ⊢ 1 < 8 | ||
| Theorem | 8lt9 12466 | 8 is less than 9. (Contributed by Mario Carneiro, 19-Feb-2014.) | 
| ⊢ 8 < 9 | ||
| Theorem | 7lt9 12467 | 7 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.) | 
| ⊢ 7 < 9 | ||
| Theorem | 6lt9 12468 | 6 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.) | 
| ⊢ 6 < 9 | ||
| Theorem | 5lt9 12469 | 5 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.) | 
| ⊢ 5 < 9 | ||
| Theorem | 4lt9 12470 | 4 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.) | 
| ⊢ 4 < 9 | ||
| Theorem | 3lt9 12471 | 3 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.) | 
| ⊢ 3 < 9 | ||
| Theorem | 2lt9 12472 | 2 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.) | 
| ⊢ 2 < 9 | ||
| Theorem | 1lt9 12473 | 1 is less than 9. (Contributed by NM, 19-Oct-2012.) (Revised by Mario Carneiro, 9-Mar-2015.) | 
| ⊢ 1 < 9 | ||
| Theorem | 0ne2 12474 | 0 is not equal to 2. (Contributed by David A. Wheeler, 8-Dec-2018.) | 
| ⊢ 0 ≠ 2 | ||
| Theorem | 1ne2 12475 | 1 is not equal to 2. (Contributed by NM, 19-Oct-2012.) | 
| ⊢ 1 ≠ 2 | ||
| Theorem | 1le2 12476 | 1 is less than or equal to 2. (Contributed by David A. Wheeler, 8-Dec-2018.) | 
| ⊢ 1 ≤ 2 | ||
| Theorem | 2cnne0 12477 | 2 is a nonzero complex number. (Contributed by David A. Wheeler, 7-Dec-2018.) | 
| ⊢ (2 ∈ ℂ ∧ 2 ≠ 0) | ||
| Theorem | 2rene0 12478 | 2 is a nonzero real number. (Contributed by David A. Wheeler, 8-Dec-2018.) | 
| ⊢ (2 ∈ ℝ ∧ 2 ≠ 0) | ||
| Theorem | 1le3 12479 | 1 is less than or equal to 3. (Contributed by David A. Wheeler, 8-Dec-2018.) | 
| ⊢ 1 ≤ 3 | ||
| Theorem | neg1mulneg1e1 12480 | -1 · -1 is 1. (Contributed by David A. Wheeler, 8-Dec-2018.) | 
| ⊢ (-1 · -1) = 1 | ||
| Theorem | halfre 12481 | One-half is real. (Contributed by David A. Wheeler, 8-Dec-2018.) | 
| ⊢ (1 / 2) ∈ ℝ | ||
| Theorem | halfcn 12482 | One-half is a complex number. (Contributed by David A. Wheeler, 8-Dec-2018.) | 
| ⊢ (1 / 2) ∈ ℂ | ||
| Theorem | halfgt0 12483 | One-half is greater than zero. (Contributed by NM, 24-Feb-2005.) | 
| ⊢ 0 < (1 / 2) | ||
| Theorem | halfge0 12484 | One-half is not negative. (Contributed by AV, 7-Jun-2020.) | 
| ⊢ 0 ≤ (1 / 2) | ||
| Theorem | halflt1 12485 | One-half is less than one. (Contributed by NM, 24-Feb-2005.) | 
| ⊢ (1 / 2) < 1 | ||
| Theorem | 2halves 12486 | Two halves make a whole. (Contributed by NM, 11-Apr-2005.) | 
| ⊢ (𝐴 ∈ ℂ → ((𝐴 / 2) + (𝐴 / 2)) = 𝐴) | ||
| Theorem | 1mhlfehlf 12487 | Prove that 1 - 1/2 = 1/2. (Contributed by David A. Wheeler, 4-Jan-2017.) (Proof shortened by SN, 22-Oct-2025.) | 
| ⊢ (1 − (1 / 2)) = (1 / 2) | ||
| Theorem | 8th4div3 12488 | An eighth of four thirds is a sixth. (Contributed by Paul Chapman, 24-Nov-2007.) | 
| ⊢ ((1 / 8) · (4 / 3)) = (1 / 6) | ||
| Theorem | halfthird 12489 | Half minus a third. (Contributed by Scott Fenton, 8-Jul-2015.) | 
| ⊢ ((1 / 2) − (1 / 3)) = (1 / 6) | ||
| Theorem | halfpm6th 12490 | One half plus or minus one sixth. (Contributed by Paul Chapman, 17-Jan-2008.) (Proof shortened by SN, 22-Oct-2025.) | 
| ⊢ (((1 / 2) − (1 / 6)) = (1 / 3) ∧ ((1 / 2) + (1 / 6)) = (2 / 3)) | ||
| Theorem | it0e0 12491 | i times 0 equals 0. (Contributed by David A. Wheeler, 8-Dec-2018.) | 
| ⊢ (i · 0) = 0 | ||
| Theorem | 2mulicn 12492 | (2 · i) ∈ ℂ. (Contributed by David A. Wheeler, 8-Dec-2018.) | 
| ⊢ (2 · i) ∈ ℂ | ||
| Theorem | 2muline0 12493 | (2 · i) ≠ 0. (Contributed by David A. Wheeler, 8-Dec-2018.) | 
| ⊢ (2 · i) ≠ 0 | ||
| Theorem | halfcl 12494 | Closure of half of a number. (Contributed by NM, 1-Jan-2006.) | 
| ⊢ (𝐴 ∈ ℂ → (𝐴 / 2) ∈ ℂ) | ||
| Theorem | rehalfcl 12495 | Real closure of half. (Contributed by NM, 1-Jan-2006.) | 
| ⊢ (𝐴 ∈ ℝ → (𝐴 / 2) ∈ ℝ) | ||
| Theorem | half0 12496 | Half of a number is zero iff the number is zero. (Contributed by NM, 20-Apr-2006.) | 
| ⊢ (𝐴 ∈ ℂ → ((𝐴 / 2) = 0 ↔ 𝐴 = 0)) | ||
| Theorem | halfpos2 12497 | A number is positive iff its half is positive. (Contributed by NM, 10-Apr-2005.) | 
| ⊢ (𝐴 ∈ ℝ → (0 < 𝐴 ↔ 0 < (𝐴 / 2))) | ||
| Theorem | halfpos 12498 | 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 12499 | A number is nonnegative iff its half is nonnegative. (Contributed by NM, 9-Dec-2005.) | 
| ⊢ (𝐴 ∈ ℝ → (0 ≤ 𝐴 ↔ 0 ≤ (𝐴 / 2))) | ||
| Theorem | halfaddsubcl 12500 | Closure of half-sum and half-difference. (Contributed by Paul Chapman, 12-Oct-2007.) | 
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((𝐴 + 𝐵) / 2) ∈ ℂ ∧ ((𝐴 − 𝐵) / 2) ∈ ℂ)) | ||
| < Previous Next > | 
| Copyright terms: Public domain | < Previous Next > |