P. 126 of Theorem List - Metamath Proof Explorer

Theorem List for Metamath Proof Explorer - 12501-12600   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	4m1e3 12501	4 - 1 = 3. (Contributed by AV, 8-Feb-2021.) (Proof shortened by AV, 6-Sep-2021.)
⊢ (4 − 1) = 3
Theorem	5m1e4 12502	5 - 1 = 4. (Contributed by AV, 6-Sep-2021.)
⊢ (5 − 1) = 4
Theorem	6m1e5 12503	6 - 1 = 5. (Contributed by AV, 6-Sep-2021.)
⊢ (6 − 1) = 5
Theorem	7m1e6 12504	7 - 1 = 6. (Contributed by AV, 6-Sep-2021.)
⊢ (7 − 1) = 6
Theorem	8m1e7 12505	8 - 1 = 7. (Contributed by AV, 6-Sep-2021.)
⊢ (8 − 1) = 7
Theorem	9m1e8 12506	9 - 1 = 8. (Contributed by AV, 6-Sep-2021.)
⊢ (9 − 1) = 8
Theorem	2p2e4 12507	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 12508	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 12509	A number times 2. (Contributed by NM, 16-Oct-2007.)
⊢ (𝐴 ∈ ℂ → (𝐴 · 2) = (𝐴 + 𝐴))
Theorem	2timesi 12510	Two times a number. (Contributed by NM, 1-Aug-1999.)
⊢ 𝐴 ∈ ℂ    ⇒   ⊢ (2 · 𝐴) = (𝐴 + 𝐴)
Theorem	times2i 12511	A number times 2. (Contributed by NM, 11-May-2004.)
⊢ 𝐴 ∈ ℂ    ⇒   ⊢ (𝐴 · 2) = (𝐴 + 𝐴)
Theorem	2txmxeqx 12512	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 12513	2 divided by 2 is 1. (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ (2 / 2) = 1
Theorem	2p1e3 12514	2 + 1 = 3. (Contributed by Mario Carneiro, 18-Apr-2015.)
⊢ (2 + 1) = 3
Theorem	1p2e3 12515	1 + 2 = 3. For a shorter proof using addcomli 11532, see 1p2e3ALT 12516. (Contributed by David A. Wheeler, 8-Dec-2018.) Reduce dependencies on axioms. (Revised by Steven Nguyen, 12-Dec-2022.)
⊢ (1 + 2) = 3
Theorem	1p2e3ALT 12516	Alternate proof of 1p2e3 12515, 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 12517	3 + 1 = 4. (Contributed by Mario Carneiro, 18-Apr-2015.)
⊢ (3 + 1) = 4
Theorem	4p1e5 12518	4 + 1 = 5. (Contributed by Mario Carneiro, 18-Apr-2015.)
⊢ (4 + 1) = 5
Theorem	5p1e6 12519	5 + 1 = 6. (Contributed by Mario Carneiro, 18-Apr-2015.)
⊢ (5 + 1) = 6
Theorem	6p1e7 12520	6 + 1 = 7. (Contributed by Mario Carneiro, 18-Apr-2015.)
⊢ (6 + 1) = 7
Theorem	7p1e8 12521	7 + 1 = 8. (Contributed by Mario Carneiro, 18-Apr-2015.)
⊢ (7 + 1) = 8
Theorem	8p1e9 12522	8 + 1 = 9. (Contributed by Mario Carneiro, 18-Apr-2015.)
⊢ (8 + 1) = 9
Theorem	3p2e5 12523	3 + 2 = 5. (Contributed by NM, 11-May-2004.)
⊢ (3 + 2) = 5
Theorem	3p3e6 12524	3 + 3 = 6. (Contributed by NM, 11-May-2004.)
⊢ (3 + 3) = 6
Theorem	4p2e6 12525	4 + 2 = 6. (Contributed by NM, 11-May-2004.)
⊢ (4 + 2) = 6
Theorem	4p3e7 12526	4 + 3 = 7. (Contributed by NM, 11-May-2004.)
⊢ (4 + 3) = 7
Theorem	4p4e8 12527	4 + 4 = 8. (Contributed by NM, 11-May-2004.)
⊢ (4 + 4) = 8
Theorem	5p2e7 12528	5 + 2 = 7. (Contributed by NM, 11-May-2004.)
⊢ (5 + 2) = 7
Theorem	5p3e8 12529	5 + 3 = 8. (Contributed by NM, 11-May-2004.)
⊢ (5 + 3) = 8
Theorem	5p4e9 12530	5 + 4 = 9. (Contributed by NM, 11-May-2004.)
⊢ (5 + 4) = 9
Theorem	6p2e8 12531	6 + 2 = 8. (Contributed by NM, 11-May-2004.)
⊢ (6 + 2) = 8
Theorem	6p3e9 12532	6 + 3 = 9. (Contributed by NM, 11-May-2004.)
⊢ (6 + 3) = 9
Theorem	7p2e9 12533	7 + 2 = 9. (Contributed by NM, 11-May-2004.)
⊢ (7 + 2) = 9
Theorem	1t1e1 12534	1 times 1 equals 1. (Contributed by David A. Wheeler, 7-Jul-2016.)
⊢ (1 · 1) = 1
Theorem	2t1e2 12535	2 times 1 equals 2. (Contributed by David A. Wheeler, 6-Dec-2018.)
⊢ (2 · 1) = 2
Theorem	2t2e4 12536	2 times 2 equals 4. (Contributed by NM, 1-Aug-1999.)
⊢ (2 · 2) = 4
Theorem	3t1e3 12537	3 times 1 equals 3. (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ (3 · 1) = 3
Theorem	3t2e6 12538	3 times 2 equals 6. (Contributed by NM, 2-Aug-2004.)
⊢ (3 · 2) = 6
Theorem	2t3e6 12539	2 times 3 equals 6. (Contributed by Umit Teoman Dogan, 10-Jun-2026.)
⊢ (2 · 3) = 6
Theorem	3t3e9 12540	3 times 3 equals 9. (Contributed by NM, 11-May-2004.)
⊢ (3 · 3) = 9
Theorem	4t2e8 12541	4 times 2 equals 8. (Contributed by NM, 2-Aug-2004.)
⊢ (4 · 2) = 8
Theorem	2t4e8 12542	2 times 4 equals 8. (Contributed by Umit Teoman Dogan, 10-Jun-2026.)
⊢ (2 · 4) = 8
Theorem	2t0e0 12543	2 times 0 equals 0. (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ (2 · 0) = 0
Theorem	4div2e2 12544	One half of four is two. (Contributed by NM, 3-Sep-1999.)
⊢ (4 / 2) = 2
Theorem	1lt2 12545	1 is less than 2. (Contributed by NM, 24-Feb-2005.)
⊢ 1 < 2
Theorem	2lt3 12546	2 is less than 3. (Contributed by NM, 26-Sep-2010.)
⊢ 2 < 3
Theorem	2le3 12547	2 is less than or equal to 3. (Contributed by Umit Teoman Dogan, 10-Jun-2026.)
⊢ 2 ≤ 3
Theorem	1lt3 12548	1 is less than 3. (Contributed by NM, 26-Sep-2010.)
⊢ 1 < 3
Theorem	3lt4 12549	3 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 3 < 4
Theorem	2lt4 12550	2 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 2 < 4
Theorem	1lt4 12551	1 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 1 < 4
Theorem	4lt5 12552	4 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 4 < 5
Theorem	3lt5 12553	3 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 3 < 5
Theorem	2lt5 12554	2 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 2 < 5
Theorem	1lt5 12555	1 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 1 < 5
Theorem	5lt6 12556	5 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 5 < 6
Theorem	4lt6 12557	4 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 4 < 6
Theorem	3lt6 12558	3 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 3 < 6
Theorem	2lt6 12559	2 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 2 < 6
Theorem	1lt6 12560	1 is less than 6. (Contributed by NM, 19-Oct-2012.)
⊢ 1 < 6
Theorem	6lt7 12561	6 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 6 < 7
Theorem	5lt7 12562	5 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 5 < 7
Theorem	4lt7 12563	4 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 4 < 7
Theorem	3lt7 12564	3 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 3 < 7
Theorem	2lt7 12565	2 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 2 < 7
Theorem	1lt7 12566	1 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 1 < 7
Theorem	7lt8 12567	7 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 7 < 8
Theorem	6lt8 12568	6 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 6 < 8
Theorem	5lt8 12569	5 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 5 < 8
Theorem	4lt8 12570	4 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 4 < 8
Theorem	3lt8 12571	3 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 3 < 8
Theorem	2lt8 12572	2 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 2 < 8
Theorem	1lt8 12573	1 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 1 < 8
Theorem	8lt9 12574	8 is less than 9. (Contributed by Mario Carneiro, 19-Feb-2014.)
⊢ 8 < 9
Theorem	7lt9 12575	7 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
⊢ 7 < 9
Theorem	6lt9 12576	6 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
⊢ 6 < 9
Theorem	5lt9 12577	5 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
⊢ 5 < 9
Theorem	4lt9 12578	4 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
⊢ 4 < 9
Theorem	3lt9 12579	3 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
⊢ 3 < 9
Theorem	2lt9 12580	2 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
⊢ 2 < 9
Theorem	1lt9 12581	1 is less than 9. (Contributed by NM, 19-Oct-2012.) (Revised by Mario Carneiro, 9-Mar-2015.)
⊢ 1 < 9
Theorem	0ne2 12582	0 is not equal to 2. (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ 0 ≠ 2
Theorem	1ne2 12583	1 is not equal to 2. (Contributed by NM, 19-Oct-2012.)
⊢ 1 ≠ 2
Theorem	1le2 12584	1 is less than or equal to 2. (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ 1 ≤ 2
Theorem	2cnne0 12585	2 is a nonzero complex number. (Contributed by David A. Wheeler, 7-Dec-2018.)
⊢ (2 ∈ ℂ ∧ 2 ≠ 0)
Theorem	2rene0 12586	2 is a nonzero real number. (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ (2 ∈ ℝ ∧ 2 ≠ 0)
Theorem	1le3 12587	1 is less than or equal to 3. (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ 1 ≤ 3
Theorem	neg1mulneg1e1 12588	-1 · -1 is 1. (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ ( -1 · -1) = 1
Theorem	halfre 12589	One-half is real. (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ (1 / 2) ∈ ℝ
Theorem	halfcn 12590	One-half is a complex number. (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ (1 / 2) ∈ ℂ
Theorem	halfgt0 12591	One-half is greater than zero. (Contributed by NM, 24-Feb-2005.)
⊢ 0 < (1 / 2)
Theorem	halfge0 12592	One-half is not negative. (Contributed by AV, 7-Jun-2020.)
⊢ 0 ≤ (1 / 2)
Theorem	halflt1 12593	One-half is less than one. (Contributed by NM, 24-Feb-2005.)
⊢ (1 / 2) < 1
Theorem	2halves 12594	Two halves make a whole. (Contributed by NM, 11-Apr-2005.)
⊢ (𝐴 ∈ ℂ → ((𝐴 / 2) + (𝐴 / 2)) = 𝐴)
Theorem	1mhlfehlf 12595	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 12596	An eighth of four thirds is a sixth. (Contributed by Paul Chapman, 24-Nov-2007.)
⊢ ((1 / 8) · (4 / 3)) = (1 / 6)
Theorem	halfthird 12597	Half minus a third. (Contributed by Scott Fenton, 8-Jul-2015.)
⊢ ((1 / 2) − (1 / 3)) = (1 / 6)
Theorem	halfpm6th 12598	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 12599	i times 0 equals 0. (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ (i · 0) = 0
Theorem	2mulicn 12600	(2 · i) ∈ ℂ. (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ (2 · i) ∈ ℂ