Theorem List for Intuitionistic Logic Explorer - 9201-9300 *Has distinct variable
group(s)
| Type | Label | Description |
| Statement |
| |
| Theorem | 3t3e9 9201 |
3 times 3 equals 9. (Contributed by NM, 11-May-2004.)
|
| ⊢ (3 · 3) = 9 |
| |
| Theorem | 4t2e8 9202 |
4 times 2 equals 8. (Contributed by NM, 2-Aug-2004.)
|
| ⊢ (4 · 2) = 8 |
| |
| Theorem | 2t0e0 9203 |
2 times 0 equals 0. (Contributed by David A. Wheeler, 8-Dec-2018.)
|
| ⊢ (2 · 0) = 0 |
| |
| Theorem | 4d2e2 9204 |
One half of four is two. (Contributed by NM, 3-Sep-1999.)
|
| ⊢ (4 / 2) = 2 |
| |
| Theorem | 2nn 9205 |
2 is a positive integer. (Contributed by NM, 20-Aug-2001.)
|
| ⊢ 2 ∈ ℕ |
| |
| Theorem | 3nn 9206 |
3 is a positive integer. (Contributed by NM, 8-Jan-2006.)
|
| ⊢ 3 ∈ ℕ |
| |
| Theorem | 4nn 9207 |
4 is a positive integer. (Contributed by NM, 8-Jan-2006.)
|
| ⊢ 4 ∈ ℕ |
| |
| Theorem | 5nn 9208 |
5 is a positive integer. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 5 ∈ ℕ |
| |
| Theorem | 6nn 9209 |
6 is a positive integer. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 6 ∈ ℕ |
| |
| Theorem | 7nn 9210 |
7 is a positive integer. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 7 ∈ ℕ |
| |
| Theorem | 8nn 9211 |
8 is a positive integer. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 8 ∈ ℕ |
| |
| Theorem | 9nn 9212 |
9 is a positive integer. (Contributed by NM, 21-Oct-2012.)
|
| ⊢ 9 ∈ ℕ |
| |
| Theorem | 1lt2 9213 |
1 is less than 2. (Contributed by NM, 24-Feb-2005.)
|
| ⊢ 1 < 2 |
| |
| Theorem | 2lt3 9214 |
2 is less than 3. (Contributed by NM, 26-Sep-2010.)
|
| ⊢ 2 < 3 |
| |
| Theorem | 1lt3 9215 |
1 is less than 3. (Contributed by NM, 26-Sep-2010.)
|
| ⊢ 1 < 3 |
| |
| Theorem | 3lt4 9216 |
3 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 3 < 4 |
| |
| Theorem | 2lt4 9217 |
2 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 2 < 4 |
| |
| Theorem | 1lt4 9218 |
1 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 1 < 4 |
| |
| Theorem | 4lt5 9219 |
4 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 4 < 5 |
| |
| Theorem | 3lt5 9220 |
3 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 3 < 5 |
| |
| Theorem | 2lt5 9221 |
2 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 2 < 5 |
| |
| Theorem | 1lt5 9222 |
1 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 1 < 5 |
| |
| Theorem | 5lt6 9223 |
5 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 5 < 6 |
| |
| Theorem | 4lt6 9224 |
4 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 4 < 6 |
| |
| Theorem | 3lt6 9225 |
3 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 3 < 6 |
| |
| Theorem | 2lt6 9226 |
2 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 2 < 6 |
| |
| Theorem | 1lt6 9227 |
1 is less than 6. (Contributed by NM, 19-Oct-2012.)
|
| ⊢ 1 < 6 |
| |
| Theorem | 6lt7 9228 |
6 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 6 < 7 |
| |
| Theorem | 5lt7 9229 |
5 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 5 < 7 |
| |
| Theorem | 4lt7 9230 |
4 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 4 < 7 |
| |
| Theorem | 3lt7 9231 |
3 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 3 < 7 |
| |
| Theorem | 2lt7 9232 |
2 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 2 < 7 |
| |
| Theorem | 1lt7 9233 |
1 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 1 < 7 |
| |
| Theorem | 7lt8 9234 |
7 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 7 < 8 |
| |
| Theorem | 6lt8 9235 |
6 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 6 < 8 |
| |
| Theorem | 5lt8 9236 |
5 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 5 < 8 |
| |
| Theorem | 4lt8 9237 |
4 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 4 < 8 |
| |
| Theorem | 3lt8 9238 |
3 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 3 < 8 |
| |
| Theorem | 2lt8 9239 |
2 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 2 < 8 |
| |
| Theorem | 1lt8 9240 |
1 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 1 < 8 |
| |
| Theorem | 8lt9 9241 |
8 is less than 9. (Contributed by Mario Carneiro, 19-Feb-2014.)
|
| ⊢ 8 < 9 |
| |
| Theorem | 7lt9 9242 |
7 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
|
| ⊢ 7 < 9 |
| |
| Theorem | 6lt9 9243 |
6 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
|
| ⊢ 6 < 9 |
| |
| Theorem | 5lt9 9244 |
5 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
|
| ⊢ 5 < 9 |
| |
| Theorem | 4lt9 9245 |
4 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
|
| ⊢ 4 < 9 |
| |
| Theorem | 3lt9 9246 |
3 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
|
| ⊢ 3 < 9 |
| |
| Theorem | 2lt9 9247 |
2 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
|
| ⊢ 2 < 9 |
| |
| Theorem | 1lt9 9248 |
1 is less than 9. (Contributed by NM, 19-Oct-2012.) (Revised by Mario
Carneiro, 9-Mar-2015.)
|
| ⊢ 1 < 9 |
| |
| Theorem | 0ne2 9249 |
0 is not equal to 2. (Contributed by David A. Wheeler, 8-Dec-2018.)
|
| ⊢ 0 ≠ 2 |
| |
| Theorem | 1ne2 9250 |
1 is not equal to 2. (Contributed by NM, 19-Oct-2012.)
|
| ⊢ 1 ≠ 2 |
| |
| Theorem | 1ap2 9251 |
1 is apart from 2. (Contributed by Jim Kingdon, 29-Oct-2022.)
|
| ⊢ 1 # 2 |
| |
| Theorem | 1le2 9252 |
1 is less than or equal to 2 (common case). (Contributed by David A.
Wheeler, 8-Dec-2018.)
|
| ⊢ 1 ≤ 2 |
| |
| Theorem | 2cnne0 9253 |
2 is a nonzero complex number (common case). (Contributed by David A.
Wheeler, 7-Dec-2018.)
|
| ⊢ (2 ∈ ℂ ∧ 2 ≠
0) |
| |
| Theorem | 2rene0 9254 |
2 is a nonzero real number (common case). (Contributed by David A.
Wheeler, 8-Dec-2018.)
|
| ⊢ (2 ∈ ℝ ∧ 2 ≠
0) |
| |
| Theorem | 1le3 9255 |
1 is less than or equal to 3. (Contributed by David A. Wheeler,
8-Dec-2018.)
|
| ⊢ 1 ≤ 3 |
| |
| Theorem | neg1mulneg1e1 9256 |
-1 · -1 is 1 (common case). (Contributed by
David A. Wheeler,
8-Dec-2018.)
|
| ⊢ (-1 · -1) = 1 |
| |
| Theorem | halfre 9257 |
One-half is real. (Contributed by David A. Wheeler, 8-Dec-2018.)
|
| ⊢ (1 / 2) ∈ ℝ |
| |
| Theorem | halfcn 9258 |
One-half is complex. (Contributed by David A. Wheeler, 8-Dec-2018.)
|
| ⊢ (1 / 2) ∈ ℂ |
| |
| Theorem | halfgt0 9259 |
One-half is greater than zero. (Contributed by NM, 24-Feb-2005.)
|
| ⊢ 0 < (1 / 2) |
| |
| Theorem | halfge0 9260 |
One-half is not negative. (Contributed by AV, 7-Jun-2020.)
|
| ⊢ 0 ≤ (1 / 2) |
| |
| Theorem | halflt1 9261 |
One-half is less than one. (Contributed by NM, 24-Feb-2005.)
|
| ⊢ (1 / 2) < 1 |
| |
| Theorem | 1mhlfehlf 9262 |
Prove that 1 - 1/2 = 1/2. (Contributed by David A. Wheeler,
4-Jan-2017.)
|
| ⊢ (1 − (1 / 2)) = (1 /
2) |
| |
| Theorem | 8th4div3 9263 |
An eighth of four thirds is a sixth. (Contributed by Paul Chapman,
24-Nov-2007.)
|
| ⊢ ((1 / 8) · (4 / 3)) = (1 /
6) |
| |
| Theorem | halfpm6th 9264 |
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 9265 |
i times 0 equals 0 (common case). (Contributed by David A. Wheeler,
8-Dec-2018.)
|
| ⊢ (i · 0) = 0 |
| |
| Theorem | 2mulicn 9266 |
(2 · i) ∈ ℂ (common case).
(Contributed by David A. Wheeler,
8-Dec-2018.)
|
| ⊢ (2 · i) ∈
ℂ |
| |
| Theorem | iap0 9267 |
The imaginary unit i is apart from zero. (Contributed
by Jim
Kingdon, 9-Mar-2020.)
|
| ⊢ i # 0 |
| |
| Theorem | 2muliap0 9268 |
2 · i is apart from zero. (Contributed by Jim
Kingdon,
9-Mar-2020.)
|
| ⊢ (2 · i) # 0 |
| |
| Theorem | 2muline0 9269 |
(2 · i) ≠ 0. See also 2muliap0 9268. (Contributed by David A.
Wheeler, 8-Dec-2018.)
|
| ⊢ (2 · i) ≠ 0 |
| |
| 4.4.5 Simple number properties
|
| |
| Theorem | halfcl 9270 |
Closure of half of a number (common case). (Contributed by NM,
1-Jan-2006.)
|
| ⊢ (𝐴 ∈ ℂ → (𝐴 / 2) ∈ ℂ) |
| |
| Theorem | rehalfcl 9271 |
Real closure of half. (Contributed by NM, 1-Jan-2006.)
|
| ⊢ (𝐴 ∈ ℝ → (𝐴 / 2) ∈ ℝ) |
| |
| Theorem | half0 9272 |
Half of a number is zero iff the number is zero. (Contributed by NM,
20-Apr-2006.)
|
| ⊢ (𝐴 ∈ ℂ → ((𝐴 / 2) = 0 ↔ 𝐴 = 0)) |
| |
| Theorem | 2halves 9273 |
Two halves make a whole. (Contributed by NM, 11-Apr-2005.)
|
| ⊢ (𝐴 ∈ ℂ → ((𝐴 / 2) + (𝐴 / 2)) = 𝐴) |
| |
| Theorem | halfpos2 9274 |
A number is positive iff its half is positive. (Contributed by NM,
10-Apr-2005.)
|
| ⊢ (𝐴 ∈ ℝ → (0 < 𝐴 ↔ 0 < (𝐴 / 2))) |
| |
| Theorem | halfpos 9275 |
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 9276 |
A number is nonnegative iff its half is nonnegative. (Contributed by NM,
9-Dec-2005.)
|
| ⊢ (𝐴 ∈ ℝ → (0 ≤ 𝐴 ↔ 0 ≤ (𝐴 / 2))) |
| |
| Theorem | halfaddsubcl 9277 |
Closure of half-sum and half-difference. (Contributed by Paul Chapman,
12-Oct-2007.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((𝐴 + 𝐵) / 2) ∈ ℂ ∧ ((𝐴 − 𝐵) / 2) ∈ ℂ)) |
| |
| Theorem | halfaddsub 9278 |
Sum and difference of half-sum and half-difference. (Contributed by Paul
Chapman, 12-Oct-2007.)
|
| ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((((𝐴 + 𝐵) / 2) + ((𝐴 − 𝐵) / 2)) = 𝐴 ∧ (((𝐴 + 𝐵) / 2) − ((𝐴 − 𝐵) / 2)) = 𝐵)) |
| |
| Theorem | subhalfhalf 9279 |
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 9280 |
A sum is less than the whole if each term is less than half. (Contributed
by NM, 13-Dec-2006.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 < (𝐶 / 2) ∧ 𝐵 < (𝐶 / 2)) → (𝐴 + 𝐵) < 𝐶)) |
| |
| Theorem | addltmul 9281 |
Sum is less than product for numbers greater than 2. (Contributed by
Stefan Allan, 24-Sep-2010.)
|
| ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (2 < 𝐴 ∧ 2 < 𝐵)) → (𝐴 + 𝐵) < (𝐴 · 𝐵)) |
| |
| Theorem | nominpos 9282* |
There is no smallest positive real number. (Contributed by NM,
28-Oct-2004.)
|
| ⊢ ¬ ∃𝑥 ∈ ℝ (0 < 𝑥 ∧ ¬ ∃𝑦 ∈ ℝ (0 < 𝑦 ∧ 𝑦 < 𝑥)) |
| |
| Theorem | avglt1 9283 |
Ordering property for average. (Contributed by Mario Carneiro,
28-May-2014.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 ↔ 𝐴 < ((𝐴 + 𝐵) / 2))) |
| |
| Theorem | avglt2 9284 |
Ordering property for average. (Contributed by Mario Carneiro,
28-May-2014.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 < 𝐵 ↔ ((𝐴 + 𝐵) / 2) < 𝐵)) |
| |
| Theorem | avgle1 9285 |
Ordering property for average. (Contributed by Mario Carneiro,
28-May-2014.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ 𝐴 ≤ ((𝐴 + 𝐵) / 2))) |
| |
| Theorem | avgle2 9286 |
Ordering property for average. (Contributed by Jeff Hankins,
15-Sep-2013.) (Revised by Mario Carneiro, 28-May-2014.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ ((𝐴 + 𝐵) / 2) ≤ 𝐵)) |
| |
| Theorem | 2timesd 9287 |
Two times a number. (Contributed by Mario Carneiro, 27-May-2016.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℂ)
⇒ ⊢ (𝜑 → (2 · 𝐴) = (𝐴 + 𝐴)) |
| |
| Theorem | times2d 9288 |
A number times 2. (Contributed by Mario Carneiro, 27-May-2016.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℂ)
⇒ ⊢ (𝜑 → (𝐴 · 2) = (𝐴 + 𝐴)) |
| |
| Theorem | halfcld 9289 |
Closure of half of a number (frequently used special case).
(Contributed by Mario Carneiro, 27-May-2016.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℂ)
⇒ ⊢ (𝜑 → (𝐴 / 2) ∈ ℂ) |
| |
| Theorem | 2halvesd 9290 |
Two halves make a whole. (Contributed by Mario Carneiro,
27-May-2016.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℂ)
⇒ ⊢ (𝜑 → ((𝐴 / 2) + (𝐴 / 2)) = 𝐴) |
| |
| Theorem | rehalfcld 9291 |
Real closure of half. (Contributed by Mario Carneiro, 27-May-2016.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ)
⇒ ⊢ (𝜑 → (𝐴 / 2) ∈ ℝ) |
| |
| Theorem | lt2halvesd 9292 |
A sum is less than the whole if each term is less than half.
(Contributed by Mario Carneiro, 27-May-2016.)
|
| ⊢ (𝜑 → 𝐴 ∈ ℝ) & ⊢ (𝜑 → 𝐵 ∈ ℝ) & ⊢ (𝜑 → 𝐶 ∈ ℝ) & ⊢ (𝜑 → 𝐴 < (𝐶 / 2)) & ⊢ (𝜑 → 𝐵 < (𝐶 / 2)) ⇒ ⊢ (𝜑 → (𝐴 + 𝐵) < 𝐶) |
| |
| Theorem | rehalfcli 9293 |
Half a real number is real. Inference form. (Contributed by David
Moews, 28-Feb-2017.)
|
| ⊢ 𝐴 ∈ ℝ
⇒ ⊢ (𝐴 / 2) ∈ ℝ |
| |
| Theorem | add1p1 9294 |
Adding two times 1 to a number. (Contributed by AV, 22-Sep-2018.)
|
| ⊢ (𝑁 ∈ ℂ → ((𝑁 + 1) + 1) = (𝑁 + 2)) |
| |
| Theorem | sub1m1 9295 |
Subtracting two times 1 from a number. (Contributed by AV,
23-Oct-2018.)
|
| ⊢ (𝑁 ∈ ℂ → ((𝑁 − 1) − 1) = (𝑁 − 2)) |
| |
| Theorem | cnm2m1cnm3 9296 |
Subtracting 2 and afterwards 1 from a number results in the difference
between the number and 3. (Contributed by Alexander van der Vekens,
16-Sep-2018.)
|
| ⊢ (𝐴 ∈ ℂ → ((𝐴 − 2) − 1) = (𝐴 − 3)) |
| |
| Theorem | xp1d2m1eqxm1d2 9297 |
A complex number increased by 1, then divided by 2, then decreased by 1
equals the complex number decreased by 1 and then divided by 2.
(Contributed by AV, 24-May-2020.)
|
| ⊢ (𝑋 ∈ ℂ → (((𝑋 + 1) / 2) − 1) = ((𝑋 − 1) / 2)) |
| |
| Theorem | div4p1lem1div2 9298 |
An integer greater than 5, divided by 4 and increased by 1, is less than
or equal to the half of the integer minus 1. (Contributed by AV,
8-Jul-2021.)
|
| ⊢ ((𝑁 ∈ ℝ ∧ 6 ≤ 𝑁) → ((𝑁 / 4) + 1) ≤ ((𝑁 − 1) / 2)) |
| |
| 4.4.6 The Archimedean property
|
| |
| Theorem | arch 9299* |
Archimedean property of real numbers. For any real number, there is an
integer greater than it. Theorem I.29 of [Apostol] p. 26. (Contributed
by NM, 21-Jan-1997.)
|
| ⊢ (𝐴 ∈ ℝ → ∃𝑛 ∈ ℕ 𝐴 < 𝑛) |
| |
| Theorem | nnrecl 9300* |
There exists a positive integer whose reciprocal is less than a given
positive real. Exercise 3 of [Apostol]
p. 28. (Contributed by NM,
8-Nov-2004.)
|
| ⊢ ((𝐴 ∈ ℝ ∧ 0 < 𝐴) → ∃𝑛 ∈ ℕ (1 / 𝑛) < 𝐴) |