| Intuitionistic Logic Explorer Theorem List (p. 93 of 168) | < Previous Next > | |
| Bad symbols? Try the
GIF version. |
||
|
Mirrors > Metamath Home Page > ILE Home Page > Theorem List Contents > Recent Proofs This page: Page List |
||
| Type | Label | Description |
|---|---|---|
| Statement | ||
| Syntax | c9 9201 | Extend class notation to include the number 9. |
| class 9 | ||
| Definition | df-2 9202 | Define the number 2. (Contributed by NM, 27-May-1999.) |
| ⊢ 2 = (1 + 1) | ||
| Definition | df-3 9203 | Define the number 3. (Contributed by NM, 27-May-1999.) |
| ⊢ 3 = (2 + 1) | ||
| Definition | df-4 9204 | Define the number 4. (Contributed by NM, 27-May-1999.) |
| ⊢ 4 = (3 + 1) | ||
| Definition | df-5 9205 | Define the number 5. (Contributed by NM, 27-May-1999.) |
| ⊢ 5 = (4 + 1) | ||
| Definition | df-6 9206 | Define the number 6. (Contributed by NM, 27-May-1999.) |
| ⊢ 6 = (5 + 1) | ||
| Definition | df-7 9207 | Define the number 7. (Contributed by NM, 27-May-1999.) |
| ⊢ 7 = (6 + 1) | ||
| Definition | df-8 9208 | Define the number 8. (Contributed by NM, 27-May-1999.) |
| ⊢ 8 = (7 + 1) | ||
| Definition | df-9 9209 | Define the number 9. (Contributed by NM, 27-May-1999.) |
| ⊢ 9 = (8 + 1) | ||
| Theorem | 0ne1 9210 | 0 ≠ 1 (common case). See aso 1ap0 8770. (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ 0 ≠ 1 | ||
| Theorem | 1ne0 9211 | 1 ≠ 0. See aso 1ap0 8770. (Contributed by Jim Kingdon, 9-Mar-2020.) |
| ⊢ 1 ≠ 0 | ||
| Theorem | 1m1e0 9212 | (1 − 1) = 0 (common case). (Contributed by David A. Wheeler, 7-Jul-2016.) |
| ⊢ (1 − 1) = 0 | ||
| Theorem | 2re 9213 | The number 2 is real. (Contributed by NM, 27-May-1999.) |
| ⊢ 2 ∈ ℝ | ||
| Theorem | 2cn 9214 | The number 2 is a complex number. (Contributed by NM, 30-Jul-2004.) |
| ⊢ 2 ∈ ℂ | ||
| Theorem | 2ex 9215 | 2 is a set (common case). (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ 2 ∈ V | ||
| Theorem | 2cnd 9216 | 2 is a complex number, deductive form (common case). (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ (𝜑 → 2 ∈ ℂ) | ||
| Theorem | 3re 9217 | The number 3 is real. (Contributed by NM, 27-May-1999.) |
| ⊢ 3 ∈ ℝ | ||
| Theorem | 3cn 9218 | The number 3 is a complex number. (Contributed by FL, 17-Oct-2010.) |
| ⊢ 3 ∈ ℂ | ||
| Theorem | 3ex 9219 | 3 is a set (common case). (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ 3 ∈ V | ||
| Theorem | 4re 9220 | The number 4 is real. (Contributed by NM, 27-May-1999.) |
| ⊢ 4 ∈ ℝ | ||
| Theorem | 4cn 9221 | The number 4 is a complex number. (Contributed by David A. Wheeler, 7-Jul-2016.) |
| ⊢ 4 ∈ ℂ | ||
| Theorem | 5re 9222 | The number 5 is real. (Contributed by NM, 27-May-1999.) |
| ⊢ 5 ∈ ℝ | ||
| Theorem | 5cn 9223 | The number 5 is complex. (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ 5 ∈ ℂ | ||
| Theorem | 6re 9224 | The number 6 is real. (Contributed by NM, 27-May-1999.) |
| ⊢ 6 ∈ ℝ | ||
| Theorem | 6cn 9225 | The number 6 is complex. (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ 6 ∈ ℂ | ||
| Theorem | 7re 9226 | The number 7 is real. (Contributed by NM, 27-May-1999.) |
| ⊢ 7 ∈ ℝ | ||
| Theorem | 7cn 9227 | The number 7 is complex. (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ 7 ∈ ℂ | ||
| Theorem | 8re 9228 | The number 8 is real. (Contributed by NM, 27-May-1999.) |
| ⊢ 8 ∈ ℝ | ||
| Theorem | 8cn 9229 | The number 8 is complex. (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ 8 ∈ ℂ | ||
| Theorem | 9re 9230 | The number 9 is real. (Contributed by NM, 27-May-1999.) |
| ⊢ 9 ∈ ℝ | ||
| Theorem | 9cn 9231 | The number 9 is complex. (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ 9 ∈ ℂ | ||
| Theorem | 0le0 9232 | Zero is nonnegative. (Contributed by David A. Wheeler, 7-Jul-2016.) |
| ⊢ 0 ≤ 0 | ||
| Theorem | 0le2 9233 | 0 is less than or equal to 2. (Contributed by David A. Wheeler, 7-Dec-2018.) |
| ⊢ 0 ≤ 2 | ||
| Theorem | 2pos 9234 | The number 2 is positive. (Contributed by NM, 27-May-1999.) |
| ⊢ 0 < 2 | ||
| Theorem | 2ne0 9235 | The number 2 is nonzero. (Contributed by NM, 9-Nov-2007.) |
| ⊢ 2 ≠ 0 | ||
| Theorem | 2ap0 9236 | The number 2 is apart from zero. (Contributed by Jim Kingdon, 9-Mar-2020.) |
| ⊢ 2 # 0 | ||
| Theorem | 3pos 9237 | The number 3 is positive. (Contributed by NM, 27-May-1999.) |
| ⊢ 0 < 3 | ||
| Theorem | 3ne0 9238 | The number 3 is nonzero. (Contributed by FL, 17-Oct-2010.) (Proof shortened by Andrew Salmon, 7-May-2011.) |
| ⊢ 3 ≠ 0 | ||
| Theorem | 3ap0 9239 | The number 3 is apart from zero. (Contributed by Jim Kingdon, 10-Oct-2021.) |
| ⊢ 3 # 0 | ||
| Theorem | 4pos 9240 | The number 4 is positive. (Contributed by NM, 27-May-1999.) |
| ⊢ 0 < 4 | ||
| Theorem | 4ne0 9241 | The number 4 is nonzero. (Contributed by David A. Wheeler, 5-Dec-2018.) |
| ⊢ 4 ≠ 0 | ||
| Theorem | 4ap0 9242 | The number 4 is apart from zero. (Contributed by Jim Kingdon, 10-Oct-2021.) |
| ⊢ 4 # 0 | ||
| Theorem | 5pos 9243 | The number 5 is positive. (Contributed by NM, 27-May-1999.) |
| ⊢ 0 < 5 | ||
| Theorem | 6pos 9244 | The number 6 is positive. (Contributed by NM, 27-May-1999.) |
| ⊢ 0 < 6 | ||
| Theorem | 7pos 9245 | The number 7 is positive. (Contributed by NM, 27-May-1999.) |
| ⊢ 0 < 7 | ||
| Theorem | 8pos 9246 | The number 8 is positive. (Contributed by NM, 27-May-1999.) |
| ⊢ 0 < 8 | ||
| Theorem | 9pos 9247 | The number 9 is positive. (Contributed by NM, 27-May-1999.) |
| ⊢ 0 < 9 | ||
This includes adding two pairs of values 1..10 (where the right is less than the left) and where the left is less than the right for the values 1..10. | ||
| Theorem | neg1cn 9248 | -1 is a complex number (common case). (Contributed by David A. Wheeler, 7-Jul-2016.) |
| ⊢ -1 ∈ ℂ | ||
| Theorem | neg1rr 9249 | -1 is a real number (common case). (Contributed by David A. Wheeler, 5-Dec-2018.) |
| ⊢ -1 ∈ ℝ | ||
| Theorem | neg1ne0 9250 | -1 is nonzero (common case). (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ -1 ≠ 0 | ||
| Theorem | neg1lt0 9251 | -1 is less than 0 (common case). (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ -1 < 0 | ||
| Theorem | neg1ap0 9252 | -1 is apart from zero. (Contributed by Jim Kingdon, 9-Jun-2020.) |
| ⊢ -1 # 0 | ||
| Theorem | negneg1e1 9253 | --1 is 1 (common case). (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ --1 = 1 | ||
| Theorem | 1pneg1e0 9254 | 1 + -1 is 0 (common case). (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ (1 + -1) = 0 | ||
| Theorem | 0m0e0 9255 | 0 minus 0 equals 0 (common case). (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ (0 − 0) = 0 | ||
| Theorem | 1m0e1 9256 | 1 - 0 = 1 (common case). (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ (1 − 0) = 1 | ||
| Theorem | 0p1e1 9257 | 0 + 1 = 1. (Contributed by David A. Wheeler, 7-Jul-2016.) |
| ⊢ (0 + 1) = 1 | ||
| Theorem | fv0p1e1 9258 | Function value at 𝑁 + 1 with 𝑁 replaced by 0. Technical theorem to be used to reduce the size of a significant number of proofs. (Contributed by AV, 13-Aug-2022.) |
| ⊢ (𝑁 = 0 → (𝐹‘(𝑁 + 1)) = (𝐹‘1)) | ||
| Theorem | 1p0e1 9259 | 1 + 0 = 1. (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ (1 + 0) = 1 | ||
| Theorem | 1p1e2 9260 | 1 + 1 = 2. (Contributed by NM, 1-Apr-2008.) |
| ⊢ (1 + 1) = 2 | ||
| Theorem | 2m1e1 9261 | 2 - 1 = 1. The result is on the right-hand-side to be consistent with similar proofs like 4p4e8 9289. (Contributed by David A. Wheeler, 4-Jan-2017.) |
| ⊢ (2 − 1) = 1 | ||
| Theorem | 1e2m1 9262 | 1 = 2 - 1 (common case). (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ 1 = (2 − 1) | ||
| Theorem | 3m1e2 9263 | 3 - 1 = 2. (Contributed by FL, 17-Oct-2010.) (Revised by NM, 10-Dec-2017.) |
| ⊢ (3 − 1) = 2 | ||
| Theorem | 4m1e3 9264 | 4 - 1 = 3. (Contributed by AV, 8-Feb-2021.) (Proof shortened by AV, 6-Sep-2021.) |
| ⊢ (4 − 1) = 3 | ||
| Theorem | 5m1e4 9265 | 5 - 1 = 4. (Contributed by AV, 6-Sep-2021.) |
| ⊢ (5 − 1) = 4 | ||
| Theorem | 6m1e5 9266 | 6 - 1 = 5. (Contributed by AV, 6-Sep-2021.) |
| ⊢ (6 − 1) = 5 | ||
| Theorem | 7m1e6 9267 | 7 - 1 = 6. (Contributed by AV, 6-Sep-2021.) |
| ⊢ (7 − 1) = 6 | ||
| Theorem | 8m1e7 9268 | 8 - 1 = 7. (Contributed by AV, 6-Sep-2021.) |
| ⊢ (8 − 1) = 7 | ||
| Theorem | 9m1e8 9269 | 9 - 1 = 8. (Contributed by AV, 6-Sep-2021.) |
| ⊢ (9 − 1) = 8 | ||
| Theorem | 2p2e4 9270 | Two plus two equals four. For more information, see "2+2=4 Trivia" on the Metamath Proof Explorer Home Page: https://us.metamath.org/mpeuni/mmset.html#trivia. (Contributed by NM, 27-May-1999.) |
| ⊢ (2 + 2) = 4 | ||
| Theorem | 2times 9271 | 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 9272 | A number times 2. (Contributed by NM, 16-Oct-2007.) |
| ⊢ (𝐴 ∈ ℂ → (𝐴 · 2) = (𝐴 + 𝐴)) | ||
| Theorem | 2timesi 9273 | Two times a number. (Contributed by NM, 1-Aug-1999.) |
| ⊢ 𝐴 ∈ ℂ ⇒ ⊢ (2 · 𝐴) = (𝐴 + 𝐴) | ||
| Theorem | times2i 9274 | A number times 2. (Contributed by NM, 11-May-2004.) |
| ⊢ 𝐴 ∈ ℂ ⇒ ⊢ (𝐴 · 2) = (𝐴 + 𝐴) | ||
| Theorem | 2txmxeqx 9275 | 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 9276 | 2 divided by 2 is 1 (common case). (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ (2 / 2) = 1 | ||
| Theorem | 2p1e3 9277 | 2 + 1 = 3. (Contributed by Mario Carneiro, 18-Apr-2015.) |
| ⊢ (2 + 1) = 3 | ||
| Theorem | 1p2e3 9278 | 1 + 2 = 3 (common case). (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ (1 + 2) = 3 | ||
| Theorem | 3p1e4 9279 | 3 + 1 = 4. (Contributed by Mario Carneiro, 18-Apr-2015.) |
| ⊢ (3 + 1) = 4 | ||
| Theorem | 4p1e5 9280 | 4 + 1 = 5. (Contributed by Mario Carneiro, 18-Apr-2015.) |
| ⊢ (4 + 1) = 5 | ||
| Theorem | 5p1e6 9281 | 5 + 1 = 6. (Contributed by Mario Carneiro, 18-Apr-2015.) |
| ⊢ (5 + 1) = 6 | ||
| Theorem | 6p1e7 9282 | 6 + 1 = 7. (Contributed by Mario Carneiro, 18-Apr-2015.) |
| ⊢ (6 + 1) = 7 | ||
| Theorem | 7p1e8 9283 | 7 + 1 = 8. (Contributed by Mario Carneiro, 18-Apr-2015.) |
| ⊢ (7 + 1) = 8 | ||
| Theorem | 8p1e9 9284 | 8 + 1 = 9. (Contributed by Mario Carneiro, 18-Apr-2015.) |
| ⊢ (8 + 1) = 9 | ||
| Theorem | 3p2e5 9285 | 3 + 2 = 5. (Contributed by NM, 11-May-2004.) |
| ⊢ (3 + 2) = 5 | ||
| Theorem | 3p3e6 9286 | 3 + 3 = 6. (Contributed by NM, 11-May-2004.) |
| ⊢ (3 + 3) = 6 | ||
| Theorem | 4p2e6 9287 | 4 + 2 = 6. (Contributed by NM, 11-May-2004.) |
| ⊢ (4 + 2) = 6 | ||
| Theorem | 4p3e7 9288 | 4 + 3 = 7. (Contributed by NM, 11-May-2004.) |
| ⊢ (4 + 3) = 7 | ||
| Theorem | 4p4e8 9289 | 4 + 4 = 8. (Contributed by NM, 11-May-2004.) |
| ⊢ (4 + 4) = 8 | ||
| Theorem | 5p2e7 9290 | 5 + 2 = 7. (Contributed by NM, 11-May-2004.) |
| ⊢ (5 + 2) = 7 | ||
| Theorem | 5p3e8 9291 | 5 + 3 = 8. (Contributed by NM, 11-May-2004.) |
| ⊢ (5 + 3) = 8 | ||
| Theorem | 5p4e9 9292 | 5 + 4 = 9. (Contributed by NM, 11-May-2004.) |
| ⊢ (5 + 4) = 9 | ||
| Theorem | 6p2e8 9293 | 6 + 2 = 8. (Contributed by NM, 11-May-2004.) |
| ⊢ (6 + 2) = 8 | ||
| Theorem | 6p3e9 9294 | 6 + 3 = 9. (Contributed by NM, 11-May-2004.) |
| ⊢ (6 + 3) = 9 | ||
| Theorem | 7p2e9 9295 | 7 + 2 = 9. (Contributed by NM, 11-May-2004.) |
| ⊢ (7 + 2) = 9 | ||
| Theorem | 1t1e1 9296 | 1 times 1 equals 1. (Contributed by David A. Wheeler, 7-Jul-2016.) |
| ⊢ (1 · 1) = 1 | ||
| Theorem | 2t1e2 9297 | 2 times 1 equals 2. (Contributed by David A. Wheeler, 6-Dec-2018.) |
| ⊢ (2 · 1) = 2 | ||
| Theorem | 2t2e4 9298 | 2 times 2 equals 4. (Contributed by NM, 1-Aug-1999.) |
| ⊢ (2 · 2) = 4 | ||
| Theorem | 3t1e3 9299 | 3 times 1 equals 3. (Contributed by David A. Wheeler, 8-Dec-2018.) |
| ⊢ (3 · 1) = 3 | ||
| Theorem | 3t2e6 9300 | 3 times 2 equals 6. (Contributed by NM, 2-Aug-2004.) |
| ⊢ (3 · 2) = 6 | ||
| < Previous Next > |
| Copyright terms: Public domain | < Previous Next > |