P. 91 of Theorem List - Intuitionistic Logic Explorer

Theorem List for Intuitionistic Logic Explorer - 9001-9100   *Has distinct variable group(s)

Type	Label	Description
Statement
Theorem	4p3e7 9001	4 + 3 = 7. (Contributed by NM, 11-May-2004.)
⊢ (4 + 3) = 7
Theorem	4p4e8 9002	4 + 4 = 8. (Contributed by NM, 11-May-2004.)
⊢ (4 + 4) = 8
Theorem	5p2e7 9003	5 + 2 = 7. (Contributed by NM, 11-May-2004.)
⊢ (5 + 2) = 7
Theorem	5p3e8 9004	5 + 3 = 8. (Contributed by NM, 11-May-2004.)
⊢ (5 + 3) = 8
Theorem	5p4e9 9005	5 + 4 = 9. (Contributed by NM, 11-May-2004.)
⊢ (5 + 4) = 9
Theorem	6p2e8 9006	6 + 2 = 8. (Contributed by NM, 11-May-2004.)
⊢ (6 + 2) = 8
Theorem	6p3e9 9007	6 + 3 = 9. (Contributed by NM, 11-May-2004.)
⊢ (6 + 3) = 9
Theorem	7p2e9 9008	7 + 2 = 9. (Contributed by NM, 11-May-2004.)
⊢ (7 + 2) = 9
Theorem	1t1e1 9009	1 times 1 equals 1. (Contributed by David A. Wheeler, 7-Jul-2016.)
⊢ (1 · 1) = 1
Theorem	2t1e2 9010	2 times 1 equals 2. (Contributed by David A. Wheeler, 6-Dec-2018.)
⊢ (2 · 1) = 2
Theorem	2t2e4 9011	2 times 2 equals 4. (Contributed by NM, 1-Aug-1999.)
⊢ (2 · 2) = 4
Theorem	3t1e3 9012	3 times 1 equals 3. (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ (3 · 1) = 3
Theorem	3t2e6 9013	3 times 2 equals 6. (Contributed by NM, 2-Aug-2004.)
⊢ (3 · 2) = 6
Theorem	3t3e9 9014	3 times 3 equals 9. (Contributed by NM, 11-May-2004.)
⊢ (3 · 3) = 9
Theorem	4t2e8 9015	4 times 2 equals 8. (Contributed by NM, 2-Aug-2004.)
⊢ (4 · 2) = 8
Theorem	2t0e0 9016	2 times 0 equals 0. (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ (2 · 0) = 0
Theorem	4d2e2 9017	One half of four is two. (Contributed by NM, 3-Sep-1999.)
⊢ (4 / 2) = 2
Theorem	2nn 9018	2 is a positive integer. (Contributed by NM, 20-Aug-2001.)
⊢ 2 ∈ ℕ
Theorem	3nn 9019	3 is a positive integer. (Contributed by NM, 8-Jan-2006.)
⊢ 3 ∈ ℕ
Theorem	4nn 9020	4 is a positive integer. (Contributed by NM, 8-Jan-2006.)
⊢ 4 ∈ ℕ
Theorem	5nn 9021	5 is a positive integer. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 5 ∈ ℕ
Theorem	6nn 9022	6 is a positive integer. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 6 ∈ ℕ
Theorem	7nn 9023	7 is a positive integer. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 7 ∈ ℕ
Theorem	8nn 9024	8 is a positive integer. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 8 ∈ ℕ
Theorem	9nn 9025	9 is a positive integer. (Contributed by NM, 21-Oct-2012.)
⊢ 9 ∈ ℕ
Theorem	1lt2 9026	1 is less than 2. (Contributed by NM, 24-Feb-2005.)
⊢ 1 < 2
Theorem	2lt3 9027	2 is less than 3. (Contributed by NM, 26-Sep-2010.)
⊢ 2 < 3
Theorem	1lt3 9028	1 is less than 3. (Contributed by NM, 26-Sep-2010.)
⊢ 1 < 3
Theorem	3lt4 9029	3 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 3 < 4
Theorem	2lt4 9030	2 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 2 < 4
Theorem	1lt4 9031	1 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 1 < 4
Theorem	4lt5 9032	4 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 4 < 5
Theorem	3lt5 9033	3 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 3 < 5
Theorem	2lt5 9034	2 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 2 < 5
Theorem	1lt5 9035	1 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 1 < 5
Theorem	5lt6 9036	5 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 5 < 6
Theorem	4lt6 9037	4 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 4 < 6
Theorem	3lt6 9038	3 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 3 < 6
Theorem	2lt6 9039	2 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 2 < 6
Theorem	1lt6 9040	1 is less than 6. (Contributed by NM, 19-Oct-2012.)
⊢ 1 < 6
Theorem	6lt7 9041	6 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 6 < 7
Theorem	5lt7 9042	5 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 5 < 7
Theorem	4lt7 9043	4 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 4 < 7
Theorem	3lt7 9044	3 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 3 < 7
Theorem	2lt7 9045	2 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 2 < 7
Theorem	1lt7 9046	1 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 1 < 7
Theorem	7lt8 9047	7 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 7 < 8
Theorem	6lt8 9048	6 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 6 < 8
Theorem	5lt8 9049	5 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 5 < 8
Theorem	4lt8 9050	4 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 4 < 8
Theorem	3lt8 9051	3 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 3 < 8
Theorem	2lt8 9052	2 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 2 < 8
Theorem	1lt8 9053	1 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
⊢ 1 < 8
Theorem	8lt9 9054	8 is less than 9. (Contributed by Mario Carneiro, 19-Feb-2014.)
⊢ 8 < 9
Theorem	7lt9 9055	7 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
⊢ 7 < 9
Theorem	6lt9 9056	6 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
⊢ 6 < 9
Theorem	5lt9 9057	5 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
⊢ 5 < 9
Theorem	4lt9 9058	4 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
⊢ 4 < 9
Theorem	3lt9 9059	3 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
⊢ 3 < 9
Theorem	2lt9 9060	2 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
⊢ 2 < 9
Theorem	1lt9 9061	1 is less than 9. (Contributed by NM, 19-Oct-2012.) (Revised by Mario Carneiro, 9-Mar-2015.)
⊢ 1 < 9
Theorem	0ne2 9062	0 is not equal to 2. (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ 0 ≠ 2
Theorem	1ne2 9063	1 is not equal to 2. (Contributed by NM, 19-Oct-2012.)
⊢ 1 ≠ 2
Theorem	1ap2 9064	1 is apart from 2. (Contributed by Jim Kingdon, 29-Oct-2022.)
⊢ 1 # 2
Theorem	1le2 9065	1 is less than or equal to 2 (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ 1 ≤ 2
Theorem	2cnne0 9066	2 is a nonzero complex number (common case). (Contributed by David A. Wheeler, 7-Dec-2018.)
⊢ (2 ∈ ℂ ∧ 2 ≠ 0)
Theorem	2rene0 9067	2 is a nonzero real number (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ (2 ∈ ℝ ∧ 2 ≠ 0)
Theorem	1le3 9068	1 is less than or equal to 3. (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ 1 ≤ 3
Theorem	neg1mulneg1e1 9069	-1 · -1 is 1 (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ (-1 · -1) = 1
Theorem	halfre 9070	One-half is real. (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ (1 / 2) ∈ ℝ
Theorem	halfcn 9071	One-half is complex. (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ (1 / 2) ∈ ℂ
Theorem	halfgt0 9072	One-half is greater than zero. (Contributed by NM, 24-Feb-2005.)
⊢ 0 < (1 / 2)
Theorem	halfge0 9073	One-half is not negative. (Contributed by AV, 7-Jun-2020.)
⊢ 0 ≤ (1 / 2)
Theorem	halflt1 9074	One-half is less than one. (Contributed by NM, 24-Feb-2005.)
⊢ (1 / 2) < 1
Theorem	1mhlfehlf 9075	Prove that 1 - 1/2 = 1/2. (Contributed by David A. Wheeler, 4-Jan-2017.)
⊢ (1 − (1 / 2)) = (1 / 2)
Theorem	8th4div3 9076	An eighth of four thirds is a sixth. (Contributed by Paul Chapman, 24-Nov-2007.)
⊢ ((1 / 8) · (4 / 3)) = (1 / 6)
Theorem	halfpm6th 9077	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 9078	i times 0 equals 0 (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ (i · 0) = 0
Theorem	2mulicn 9079	(2 · i) ∈ ℂ (common case). (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ (2 · i) ∈ ℂ
Theorem	iap0 9080	The imaginary unit i is apart from zero. (Contributed by Jim Kingdon, 9-Mar-2020.)
⊢ i # 0
Theorem	2muliap0 9081	2 · i is apart from zero. (Contributed by Jim Kingdon, 9-Mar-2020.)
⊢ (2 · i) # 0
Theorem	2muline0 9082	(2 · i) ≠ 0. See also 2muliap0 9081. (Contributed by David A. Wheeler, 8-Dec-2018.)
⊢ (2 · i) ≠ 0
4.4.5  Simple number properties
Theorem	halfcl 9083	Closure of half of a number (common case). (Contributed by NM, 1-Jan-2006.)
⊢ (𝐴 ∈ ℂ → (𝐴 / 2) ∈ ℂ)
Theorem	rehalfcl 9084	Real closure of half. (Contributed by NM, 1-Jan-2006.)
⊢ (𝐴 ∈ ℝ → (𝐴 / 2) ∈ ℝ)
Theorem	half0 9085	Half of a number is zero iff the number is zero. (Contributed by NM, 20-Apr-2006.)
⊢ (𝐴 ∈ ℂ → ((𝐴 / 2) = 0 ↔ 𝐴 = 0))
Theorem	2halves 9086	Two halves make a whole. (Contributed by NM, 11-Apr-2005.)
⊢ (𝐴 ∈ ℂ → ((𝐴 / 2) + (𝐴 / 2)) = 𝐴)
Theorem	halfpos2 9087	A number is positive iff its half is positive. (Contributed by NM, 10-Apr-2005.)
⊢ (𝐴 ∈ ℝ → (0 < 𝐴 ↔ 0 < (𝐴 / 2)))
Theorem	halfpos 9088	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 9089	A number is nonnegative iff its half is nonnegative. (Contributed by NM, 9-Dec-2005.)
⊢ (𝐴 ∈ ℝ → (0 ≤ 𝐴 ↔ 0 ≤ (𝐴 / 2)))
Theorem	halfaddsubcl 9090	Closure of half-sum and half-difference. (Contributed by Paul Chapman, 12-Oct-2007.)
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((𝐴 + 𝐵) / 2) ∈ ℂ ∧ ((𝐴 − 𝐵) / 2) ∈ ℂ))
Theorem	halfaddsub 9091	Sum and difference of half-sum and half-difference. (Contributed by Paul Chapman, 12-Oct-2007.)
⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((((𝐴 + 𝐵) / 2) + ((𝐴 − 𝐵) / 2)) = 𝐴 ∧ (((𝐴 + 𝐵) / 2) − ((𝐴 − 𝐵) / 2)) = 𝐵))
Theorem	lt2halves 9092	A sum is less than the whole if each term is less than half. (Contributed by NM, 13-Dec-2006.)
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < (𝐶 / 2) ∧ 𝐵 < (𝐶 / 2)) → (𝐴 + 𝐵) < 𝐶))
Theorem	addltmul 9093	Sum is less than product for numbers greater than 2. (Contributed by Stefan Allan, 24-Sep-2010.)
⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (2 < 𝐴 ∧ 2 < 𝐵)) → (𝐴 + 𝐵) < (𝐴 · 𝐵))
Theorem	nominpos 9094*	There is no smallest positive real number. (Contributed by NM, 28-Oct-2004.)
⊢ ¬ ∃𝑥 ∈ ℝ (0 < 𝑥 ∧ ¬ ∃𝑦 ∈ ℝ (0 < 𝑦 ∧ 𝑦 < 𝑥))
Theorem	avglt1 9095	Ordering property for average. (Contributed by Mario Carneiro, 28-May-2014.)
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 ↔ 𝐴 < ((𝐴 + 𝐵) / 2)))
Theorem	avglt2 9096	Ordering property for average. (Contributed by Mario Carneiro, 28-May-2014.)
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 ↔ ((𝐴 + 𝐵) / 2) < 𝐵))
Theorem	avgle1 9097	Ordering property for average. (Contributed by Mario Carneiro, 28-May-2014.)
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ 𝐴 ≤ ((𝐴 + 𝐵) / 2)))
Theorem	avgle2 9098	Ordering property for average. (Contributed by Jeff Hankins, 15-Sep-2013.) (Revised by Mario Carneiro, 28-May-2014.)
⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ ((𝐴 + 𝐵) / 2) ≤ 𝐵))
Theorem	2timesd 9099	Two times a number. (Contributed by Mario Carneiro, 27-May-2016.)
⊢ (𝜑 → 𝐴 ∈ ℂ)    ⇒   ⊢ (𝜑 → (2 · 𝐴) = (𝐴 + 𝐴))
Theorem	times2d 9100	A number times 2. (Contributed by Mario Carneiro, 27-May-2016.)
⊢ (𝜑 → 𝐴 ∈ ℂ)    ⇒   ⊢ (𝜑 → (𝐴 · 2) = (𝐴 + 𝐴))