Theorem List for Intuitionistic Logic Explorer - 9101-9200 *Has distinct variable
group(s)
| Type | Label | Description |
| Statement |
| |
| Theorem | 1pneg1e0 9101 |
1 + -1 is 0 (common case). (Contributed by David A.
Wheeler,
8-Dec-2018.)
|
| ⊢ (1 + -1) = 0 |
| |
| Theorem | 0m0e0 9102 |
0 minus 0 equals 0 (common case). (Contributed by David A. Wheeler,
8-Dec-2018.)
|
| ⊢ (0 − 0) = 0 |
| |
| Theorem | 1m0e1 9103 |
1 - 0 = 1 (common case). (Contributed by David A. Wheeler,
8-Dec-2018.)
|
| ⊢ (1 − 0) = 1 |
| |
| Theorem | 0p1e1 9104 |
0 + 1 = 1. (Contributed by David A. Wheeler, 7-Jul-2016.)
|
| ⊢ (0 + 1) = 1 |
| |
| Theorem | fv0p1e1 9105 |
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 9106 |
1 + 0 = 1. (Contributed by David A. Wheeler, 8-Dec-2018.)
|
| ⊢ (1 + 0) = 1 |
| |
| Theorem | 1p1e2 9107 |
1 + 1 = 2. (Contributed by NM, 1-Apr-2008.)
|
| ⊢ (1 + 1) = 2 |
| |
| Theorem | 2m1e1 9108 |
2 - 1 = 1. The result is on the right-hand-side to be consistent with
similar proofs like 4p4e8 9136. (Contributed by David A. Wheeler,
4-Jan-2017.)
|
| ⊢ (2 − 1) = 1 |
| |
| Theorem | 1e2m1 9109 |
1 = 2 - 1 (common case). (Contributed by David A. Wheeler,
8-Dec-2018.)
|
| ⊢ 1 = (2 − 1) |
| |
| Theorem | 3m1e2 9110 |
3 - 1 = 2. (Contributed by FL, 17-Oct-2010.) (Revised by NM,
10-Dec-2017.)
|
| ⊢ (3 − 1) = 2 |
| |
| Theorem | 4m1e3 9111 |
4 - 1 = 3. (Contributed by AV, 8-Feb-2021.) (Proof shortened by AV,
6-Sep-2021.)
|
| ⊢ (4 − 1) = 3 |
| |
| Theorem | 5m1e4 9112 |
5 - 1 = 4. (Contributed by AV, 6-Sep-2021.)
|
| ⊢ (5 − 1) = 4 |
| |
| Theorem | 6m1e5 9113 |
6 - 1 = 5. (Contributed by AV, 6-Sep-2021.)
|
| ⊢ (6 − 1) = 5 |
| |
| Theorem | 7m1e6 9114 |
7 - 1 = 6. (Contributed by AV, 6-Sep-2021.)
|
| ⊢ (7 − 1) = 6 |
| |
| Theorem | 8m1e7 9115 |
8 - 1 = 7. (Contributed by AV, 6-Sep-2021.)
|
| ⊢ (8 − 1) = 7 |
| |
| Theorem | 9m1e8 9116 |
9 - 1 = 8. (Contributed by AV, 6-Sep-2021.)
|
| ⊢ (9 − 1) = 8 |
| |
| Theorem | 2p2e4 9117 |
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 9118 |
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 9119 |
A number times 2. (Contributed by NM, 16-Oct-2007.)
|
| ⊢ (𝐴 ∈ ℂ → (𝐴 · 2) = (𝐴 + 𝐴)) |
| |
| Theorem | 2timesi 9120 |
Two times a number. (Contributed by NM, 1-Aug-1999.)
|
| ⊢ 𝐴 ∈ ℂ
⇒ ⊢ (2 · 𝐴) = (𝐴 + 𝐴) |
| |
| Theorem | times2i 9121 |
A number times 2. (Contributed by NM, 11-May-2004.)
|
| ⊢ 𝐴 ∈ ℂ
⇒ ⊢ (𝐴 · 2) = (𝐴 + 𝐴) |
| |
| Theorem | 2txmxeqx 9122 |
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 9123 |
2 divided by 2 is 1 (common case). (Contributed by David A. Wheeler,
8-Dec-2018.)
|
| ⊢ (2 / 2) = 1 |
| |
| Theorem | 2p1e3 9124 |
2 + 1 = 3. (Contributed by Mario Carneiro, 18-Apr-2015.)
|
| ⊢ (2 + 1) = 3 |
| |
| Theorem | 1p2e3 9125 |
1 + 2 = 3 (common case). (Contributed by David A. Wheeler,
8-Dec-2018.)
|
| ⊢ (1 + 2) = 3 |
| |
| Theorem | 3p1e4 9126 |
3 + 1 = 4. (Contributed by Mario Carneiro, 18-Apr-2015.)
|
| ⊢ (3 + 1) = 4 |
| |
| Theorem | 4p1e5 9127 |
4 + 1 = 5. (Contributed by Mario Carneiro, 18-Apr-2015.)
|
| ⊢ (4 + 1) = 5 |
| |
| Theorem | 5p1e6 9128 |
5 + 1 = 6. (Contributed by Mario Carneiro, 18-Apr-2015.)
|
| ⊢ (5 + 1) = 6 |
| |
| Theorem | 6p1e7 9129 |
6 + 1 = 7. (Contributed by Mario Carneiro, 18-Apr-2015.)
|
| ⊢ (6 + 1) = 7 |
| |
| Theorem | 7p1e8 9130 |
7 + 1 = 8. (Contributed by Mario Carneiro, 18-Apr-2015.)
|
| ⊢ (7 + 1) = 8 |
| |
| Theorem | 8p1e9 9131 |
8 + 1 = 9. (Contributed by Mario Carneiro, 18-Apr-2015.)
|
| ⊢ (8 + 1) = 9 |
| |
| Theorem | 3p2e5 9132 |
3 + 2 = 5. (Contributed by NM, 11-May-2004.)
|
| ⊢ (3 + 2) = 5 |
| |
| Theorem | 3p3e6 9133 |
3 + 3 = 6. (Contributed by NM, 11-May-2004.)
|
| ⊢ (3 + 3) = 6 |
| |
| Theorem | 4p2e6 9134 |
4 + 2 = 6. (Contributed by NM, 11-May-2004.)
|
| ⊢ (4 + 2) = 6 |
| |
| Theorem | 4p3e7 9135 |
4 + 3 = 7. (Contributed by NM, 11-May-2004.)
|
| ⊢ (4 + 3) = 7 |
| |
| Theorem | 4p4e8 9136 |
4 + 4 = 8. (Contributed by NM, 11-May-2004.)
|
| ⊢ (4 + 4) = 8 |
| |
| Theorem | 5p2e7 9137 |
5 + 2 = 7. (Contributed by NM, 11-May-2004.)
|
| ⊢ (5 + 2) = 7 |
| |
| Theorem | 5p3e8 9138 |
5 + 3 = 8. (Contributed by NM, 11-May-2004.)
|
| ⊢ (5 + 3) = 8 |
| |
| Theorem | 5p4e9 9139 |
5 + 4 = 9. (Contributed by NM, 11-May-2004.)
|
| ⊢ (5 + 4) = 9 |
| |
| Theorem | 6p2e8 9140 |
6 + 2 = 8. (Contributed by NM, 11-May-2004.)
|
| ⊢ (6 + 2) = 8 |
| |
| Theorem | 6p3e9 9141 |
6 + 3 = 9. (Contributed by NM, 11-May-2004.)
|
| ⊢ (6 + 3) = 9 |
| |
| Theorem | 7p2e9 9142 |
7 + 2 = 9. (Contributed by NM, 11-May-2004.)
|
| ⊢ (7 + 2) = 9 |
| |
| Theorem | 1t1e1 9143 |
1 times 1 equals 1. (Contributed by David A. Wheeler, 7-Jul-2016.)
|
| ⊢ (1 · 1) = 1 |
| |
| Theorem | 2t1e2 9144 |
2 times 1 equals 2. (Contributed by David A. Wheeler, 6-Dec-2018.)
|
| ⊢ (2 · 1) = 2 |
| |
| Theorem | 2t2e4 9145 |
2 times 2 equals 4. (Contributed by NM, 1-Aug-1999.)
|
| ⊢ (2 · 2) = 4 |
| |
| Theorem | 3t1e3 9146 |
3 times 1 equals 3. (Contributed by David A. Wheeler, 8-Dec-2018.)
|
| ⊢ (3 · 1) = 3 |
| |
| Theorem | 3t2e6 9147 |
3 times 2 equals 6. (Contributed by NM, 2-Aug-2004.)
|
| ⊢ (3 · 2) = 6 |
| |
| Theorem | 3t3e9 9148 |
3 times 3 equals 9. (Contributed by NM, 11-May-2004.)
|
| ⊢ (3 · 3) = 9 |
| |
| Theorem | 4t2e8 9149 |
4 times 2 equals 8. (Contributed by NM, 2-Aug-2004.)
|
| ⊢ (4 · 2) = 8 |
| |
| Theorem | 2t0e0 9150 |
2 times 0 equals 0. (Contributed by David A. Wheeler, 8-Dec-2018.)
|
| ⊢ (2 · 0) = 0 |
| |
| Theorem | 4d2e2 9151 |
One half of four is two. (Contributed by NM, 3-Sep-1999.)
|
| ⊢ (4 / 2) = 2 |
| |
| Theorem | 2nn 9152 |
2 is a positive integer. (Contributed by NM, 20-Aug-2001.)
|
| ⊢ 2 ∈ ℕ |
| |
| Theorem | 3nn 9153 |
3 is a positive integer. (Contributed by NM, 8-Jan-2006.)
|
| ⊢ 3 ∈ ℕ |
| |
| Theorem | 4nn 9154 |
4 is a positive integer. (Contributed by NM, 8-Jan-2006.)
|
| ⊢ 4 ∈ ℕ |
| |
| Theorem | 5nn 9155 |
5 is a positive integer. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 5 ∈ ℕ |
| |
| Theorem | 6nn 9156 |
6 is a positive integer. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 6 ∈ ℕ |
| |
| Theorem | 7nn 9157 |
7 is a positive integer. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 7 ∈ ℕ |
| |
| Theorem | 8nn 9158 |
8 is a positive integer. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 8 ∈ ℕ |
| |
| Theorem | 9nn 9159 |
9 is a positive integer. (Contributed by NM, 21-Oct-2012.)
|
| ⊢ 9 ∈ ℕ |
| |
| Theorem | 1lt2 9160 |
1 is less than 2. (Contributed by NM, 24-Feb-2005.)
|
| ⊢ 1 < 2 |
| |
| Theorem | 2lt3 9161 |
2 is less than 3. (Contributed by NM, 26-Sep-2010.)
|
| ⊢ 2 < 3 |
| |
| Theorem | 1lt3 9162 |
1 is less than 3. (Contributed by NM, 26-Sep-2010.)
|
| ⊢ 1 < 3 |
| |
| Theorem | 3lt4 9163 |
3 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 3 < 4 |
| |
| Theorem | 2lt4 9164 |
2 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 2 < 4 |
| |
| Theorem | 1lt4 9165 |
1 is less than 4. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 1 < 4 |
| |
| Theorem | 4lt5 9166 |
4 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 4 < 5 |
| |
| Theorem | 3lt5 9167 |
3 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 3 < 5 |
| |
| Theorem | 2lt5 9168 |
2 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 2 < 5 |
| |
| Theorem | 1lt5 9169 |
1 is less than 5. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 1 < 5 |
| |
| Theorem | 5lt6 9170 |
5 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 5 < 6 |
| |
| Theorem | 4lt6 9171 |
4 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 4 < 6 |
| |
| Theorem | 3lt6 9172 |
3 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 3 < 6 |
| |
| Theorem | 2lt6 9173 |
2 is less than 6. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 2 < 6 |
| |
| Theorem | 1lt6 9174 |
1 is less than 6. (Contributed by NM, 19-Oct-2012.)
|
| ⊢ 1 < 6 |
| |
| Theorem | 6lt7 9175 |
6 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 6 < 7 |
| |
| Theorem | 5lt7 9176 |
5 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 5 < 7 |
| |
| Theorem | 4lt7 9177 |
4 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 4 < 7 |
| |
| Theorem | 3lt7 9178 |
3 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 3 < 7 |
| |
| Theorem | 2lt7 9179 |
2 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 2 < 7 |
| |
| Theorem | 1lt7 9180 |
1 is less than 7. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 1 < 7 |
| |
| Theorem | 7lt8 9181 |
7 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 7 < 8 |
| |
| Theorem | 6lt8 9182 |
6 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 6 < 8 |
| |
| Theorem | 5lt8 9183 |
5 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 5 < 8 |
| |
| Theorem | 4lt8 9184 |
4 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 4 < 8 |
| |
| Theorem | 3lt8 9185 |
3 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 3 < 8 |
| |
| Theorem | 2lt8 9186 |
2 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 2 < 8 |
| |
| Theorem | 1lt8 9187 |
1 is less than 8. (Contributed by Mario Carneiro, 15-Sep-2013.)
|
| ⊢ 1 < 8 |
| |
| Theorem | 8lt9 9188 |
8 is less than 9. (Contributed by Mario Carneiro, 19-Feb-2014.)
|
| ⊢ 8 < 9 |
| |
| Theorem | 7lt9 9189 |
7 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
|
| ⊢ 7 < 9 |
| |
| Theorem | 6lt9 9190 |
6 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
|
| ⊢ 6 < 9 |
| |
| Theorem | 5lt9 9191 |
5 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
|
| ⊢ 5 < 9 |
| |
| Theorem | 4lt9 9192 |
4 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
|
| ⊢ 4 < 9 |
| |
| Theorem | 3lt9 9193 |
3 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
|
| ⊢ 3 < 9 |
| |
| Theorem | 2lt9 9194 |
2 is less than 9. (Contributed by Mario Carneiro, 9-Mar-2015.)
|
| ⊢ 2 < 9 |
| |
| Theorem | 1lt9 9195 |
1 is less than 9. (Contributed by NM, 19-Oct-2012.) (Revised by Mario
Carneiro, 9-Mar-2015.)
|
| ⊢ 1 < 9 |
| |
| Theorem | 0ne2 9196 |
0 is not equal to 2. (Contributed by David A. Wheeler, 8-Dec-2018.)
|
| ⊢ 0 ≠ 2 |
| |
| Theorem | 1ne2 9197 |
1 is not equal to 2. (Contributed by NM, 19-Oct-2012.)
|
| ⊢ 1 ≠ 2 |
| |
| Theorem | 1ap2 9198 |
1 is apart from 2. (Contributed by Jim Kingdon, 29-Oct-2022.)
|
| ⊢ 1 # 2 |
| |
| Theorem | 1le2 9199 |
1 is less than or equal to 2 (common case). (Contributed by David A.
Wheeler, 8-Dec-2018.)
|
| ⊢ 1 ≤ 2 |
| |
| Theorem | 2cnne0 9200 |
2 is a nonzero complex number (common case). (Contributed by David A.
Wheeler, 7-Dec-2018.)
|
| ⊢ (2 ∈ ℂ ∧ 2 ≠
0) |