Theorem List for Intuitionistic Logic Explorer - 9401-9500 *Has distinct variable
group(s)
Type | Label | Description |
Statement |
|
Theorem | 8p2e10 9401 |
8 + 2 = 10. (Contributed by NM, 5-Feb-2007.) (Revised by Stanislas Polu,
7-Apr-2020.) (Revised by AV, 6-Sep-2021.)
|
; |
|
Theorem | 8p3e11 9402 |
8 + 3 = 11. (Contributed by Mario Carneiro, 19-Apr-2015.) (Revised by
AV, 6-Sep-2021.)
|
; |
|
Theorem | 8p4e12 9403 |
8 + 4 = 12. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 8p5e13 9404 |
8 + 5 = 13. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 8p6e14 9405 |
8 + 6 = 14. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 8p7e15 9406 |
8 + 7 = 15. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 8p8e16 9407 |
8 + 8 = 16. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 9p2e11 9408 |
9 + 2 = 11. (Contributed by Mario Carneiro, 19-Apr-2015.) (Revised by
AV, 6-Sep-2021.)
|
; |
|
Theorem | 9p3e12 9409 |
9 + 3 = 12. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 9p4e13 9410 |
9 + 4 = 13. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 9p5e14 9411 |
9 + 5 = 14. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 9p6e15 9412 |
9 + 6 = 15. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 9p7e16 9413 |
9 + 7 = 16. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 9p8e17 9414 |
9 + 8 = 17. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 9p9e18 9415 |
9 + 9 = 18. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 10p10e20 9416 |
10 + 10 = 20. (Contributed by Mario Carneiro, 19-Apr-2015.) (Revised by
AV, 6-Sep-2021.)
|
; ; ; |
|
Theorem | 10m1e9 9417 |
10 - 1 = 9. (Contributed by AV, 6-Sep-2021.)
|
; |
|
Theorem | 4t3lem 9418 |
Lemma for 4t3e12 9419 and related theorems. (Contributed by Mario
Carneiro, 19-Apr-2015.)
|
|
|
Theorem | 4t3e12 9419 |
4 times 3 equals 12. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 4t4e16 9420 |
4 times 4 equals 16. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 5t2e10 9421 |
5 times 2 equals 10. (Contributed by NM, 5-Feb-2007.) (Revised by AV,
4-Sep-2021.)
|
; |
|
Theorem | 5t3e15 9422 |
5 times 3 equals 15. (Contributed by Mario Carneiro, 19-Apr-2015.)
(Revised by AV, 6-Sep-2021.)
|
; |
|
Theorem | 5t4e20 9423 |
5 times 4 equals 20. (Contributed by Mario Carneiro, 19-Apr-2015.)
(Revised by AV, 6-Sep-2021.)
|
; |
|
Theorem | 5t5e25 9424 |
5 times 5 equals 25. (Contributed by Mario Carneiro, 19-Apr-2015.)
(Revised by AV, 6-Sep-2021.)
|
; |
|
Theorem | 6t2e12 9425 |
6 times 2 equals 12. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 6t3e18 9426 |
6 times 3 equals 18. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 6t4e24 9427 |
6 times 4 equals 24. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 6t5e30 9428 |
6 times 5 equals 30. (Contributed by Mario Carneiro, 19-Apr-2015.)
(Revised by AV, 6-Sep-2021.)
|
; |
|
Theorem | 6t6e36 9429 |
6 times 6 equals 36. (Contributed by Mario Carneiro, 19-Apr-2015.)
(Revised by AV, 6-Sep-2021.)
|
; |
|
Theorem | 7t2e14 9430 |
7 times 2 equals 14. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 7t3e21 9431 |
7 times 3 equals 21. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 7t4e28 9432 |
7 times 4 equals 28. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 7t5e35 9433 |
7 times 5 equals 35. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 7t6e42 9434 |
7 times 6 equals 42. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 7t7e49 9435 |
7 times 7 equals 49. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 8t2e16 9436 |
8 times 2 equals 16. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 8t3e24 9437 |
8 times 3 equals 24. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 8t4e32 9438 |
8 times 4 equals 32. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 8t5e40 9439 |
8 times 5 equals 40. (Contributed by Mario Carneiro, 19-Apr-2015.)
(Revised by AV, 6-Sep-2021.)
|
; |
|
Theorem | 8t6e48 9440 |
8 times 6 equals 48. (Contributed by Mario Carneiro, 19-Apr-2015.)
(Revised by AV, 6-Sep-2021.)
|
; |
|
Theorem | 8t7e56 9441 |
8 times 7 equals 56. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 8t8e64 9442 |
8 times 8 equals 64. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 9t2e18 9443 |
9 times 2 equals 18. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 9t3e27 9444 |
9 times 3 equals 27. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 9t4e36 9445 |
9 times 4 equals 36. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 9t5e45 9446 |
9 times 5 equals 45. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 9t6e54 9447 |
9 times 6 equals 54. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 9t7e63 9448 |
9 times 7 equals 63. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 9t8e72 9449 |
9 times 8 equals 72. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 9t9e81 9450 |
9 times 9 equals 81. (Contributed by Mario Carneiro, 19-Apr-2015.)
|
; |
|
Theorem | 9t11e99 9451 |
9 times 11 equals 99. (Contributed by AV, 14-Jun-2021.) (Revised by AV,
6-Sep-2021.)
|
; ; |
|
Theorem | 9lt10 9452 |
9 is less than 10. (Contributed by Mario Carneiro, 8-Feb-2015.) (Revised
by AV, 8-Sep-2021.)
|
; |
|
Theorem | 8lt10 9453 |
8 is less than 10. (Contributed by Mario Carneiro, 8-Feb-2015.) (Revised
by AV, 8-Sep-2021.)
|
; |
|
Theorem | 7lt10 9454 |
7 is less than 10. (Contributed by Mario Carneiro, 10-Mar-2015.)
(Revised by AV, 8-Sep-2021.)
|
; |
|
Theorem | 6lt10 9455 |
6 is less than 10. (Contributed by Mario Carneiro, 10-Mar-2015.)
(Revised by AV, 8-Sep-2021.)
|
; |
|
Theorem | 5lt10 9456 |
5 is less than 10. (Contributed by Mario Carneiro, 10-Mar-2015.)
(Revised by AV, 8-Sep-2021.)
|
; |
|
Theorem | 4lt10 9457 |
4 is less than 10. (Contributed by Mario Carneiro, 10-Mar-2015.)
(Revised by AV, 8-Sep-2021.)
|
; |
|
Theorem | 3lt10 9458 |
3 is less than 10. (Contributed by Mario Carneiro, 10-Mar-2015.)
(Revised by AV, 8-Sep-2021.)
|
; |
|
Theorem | 2lt10 9459 |
2 is less than 10. (Contributed by Mario Carneiro, 10-Mar-2015.)
(Revised by AV, 8-Sep-2021.)
|
; |
|
Theorem | 1lt10 9460 |
1 is less than 10. (Contributed by NM, 7-Nov-2012.) (Revised by Mario
Carneiro, 9-Mar-2015.) (Revised by AV, 8-Sep-2021.)
|
; |
|
Theorem | decbin0 9461 |
Decompose base 4 into base 2. (Contributed by Mario Carneiro,
18-Feb-2014.)
|
|
|
Theorem | decbin2 9462 |
Decompose base 4 into base 2. (Contributed by Mario Carneiro,
18-Feb-2014.)
|
|
|
Theorem | decbin3 9463 |
Decompose base 4 into base 2. (Contributed by Mario Carneiro,
18-Feb-2014.)
|
|
|
Theorem | halfthird 9464 |
Half minus a third. (Contributed by Scott Fenton, 8-Jul-2015.)
|
|
|
Theorem | 5recm6rec 9465 |
One fifth minus one sixth. (Contributed by Scott Fenton, 9-Jan-2017.)
|
; |
|
4.4.11 Upper sets of integers
|
|
Syntax | cuz 9466 |
Extend class notation with the upper integer function.
Read " " as "the
set of integers greater than or equal to
".
|
|
|
Definition | df-uz 9467* |
Define a function whose value at is the semi-infinite set of
contiguous integers starting at , which we will also call the
upper integers starting at . Read " " as "the
set
of integers greater than or equal to ". See uzval 9468 for its
value, uzssz 9485 for its relationship to , nnuz 9501
and nn0uz 9500 for
its relationships to and , and eluz1 9470 and eluz2 9472 for
its membership relations. (Contributed by NM, 5-Sep-2005.)
|
|
|
Theorem | uzval 9468* |
The value of the upper integers function. (Contributed by NM,
5-Sep-2005.) (Revised by Mario Carneiro, 3-Nov-2013.)
|
|
|
Theorem | uzf 9469 |
The domain and range of the upper integers function. (Contributed by
Scott Fenton, 8-Aug-2013.) (Revised by Mario Carneiro, 3-Nov-2013.)
|
|
|
Theorem | eluz1 9470 |
Membership in the upper set of integers starting at .
(Contributed by NM, 5-Sep-2005.)
|
|
|
Theorem | eluzel2 9471 |
Implication of membership in an upper set of integers. (Contributed by
NM, 6-Sep-2005.) (Revised by Mario Carneiro, 3-Nov-2013.)
|
|
|
Theorem | eluz2 9472 |
Membership in an upper set of integers. We use the fact that a
function's value (under our function value definition) is empty outside
of its domain to show . (Contributed by NM,
5-Sep-2005.)
(Revised by Mario Carneiro, 3-Nov-2013.)
|
|
|
Theorem | eluz1i 9473 |
Membership in an upper set of integers. (Contributed by NM,
5-Sep-2005.)
|
|
|
Theorem | eluzuzle 9474 |
An integer in an upper set of integers is an element of an upper set of
integers with a smaller bound. (Contributed by Alexander van der Vekens,
17-Jun-2018.)
|
|
|
Theorem | eluzelz 9475 |
A member of an upper set of integers is an integer. (Contributed by NM,
6-Sep-2005.)
|
|
|
Theorem | eluzelre 9476 |
A member of an upper set of integers is a real. (Contributed by Mario
Carneiro, 31-Aug-2013.)
|
|
|
Theorem | eluzelcn 9477 |
A member of an upper set of integers is a complex number. (Contributed by
Glauco Siliprandi, 29-Jun-2017.)
|
|
|
Theorem | eluzle 9478 |
Implication of membership in an upper set of integers. (Contributed by
NM, 6-Sep-2005.)
|
|
|
Theorem | eluz 9479 |
Membership in an upper set of integers. (Contributed by NM,
2-Oct-2005.)
|
|
|
Theorem | uzid 9480 |
Membership of the least member in an upper set of integers. (Contributed
by NM, 2-Sep-2005.)
|
|
|
Theorem | uzn0 9481 |
The upper integers are all nonempty. (Contributed by Mario Carneiro,
16-Jan-2014.)
|
|
|
Theorem | uztrn 9482 |
Transitive law for sets of upper integers. (Contributed by NM,
20-Sep-2005.)
|
|
|
Theorem | uztrn2 9483 |
Transitive law for sets of upper integers. (Contributed by Mario
Carneiro, 26-Dec-2013.)
|
|
|
Theorem | uzneg 9484 |
Contraposition law for upper integers. (Contributed by NM,
28-Nov-2005.)
|
|
|
Theorem | uzssz 9485 |
An upper set of integers is a subset of all integers. (Contributed by
NM, 2-Sep-2005.) (Revised by Mario Carneiro, 3-Nov-2013.)
|
|
|
Theorem | uzss 9486 |
Subset relationship for two sets of upper integers. (Contributed by NM,
5-Sep-2005.)
|
|
|
Theorem | uztric 9487 |
Trichotomy of the ordering relation on integers, stated in terms of upper
integers. (Contributed by NM, 6-Jul-2005.) (Revised by Mario Carneiro,
25-Jun-2013.)
|
|
|
Theorem | uz11 9488 |
The upper integers function is one-to-one. (Contributed by NM,
12-Dec-2005.)
|
|
|
Theorem | eluzp1m1 9489 |
Membership in the next upper set of integers. (Contributed by NM,
12-Sep-2005.)
|
|
|
Theorem | eluzp1l 9490 |
Strict ordering implied by membership in the next upper set of integers.
(Contributed by NM, 12-Sep-2005.)
|
|
|
Theorem | eluzp1p1 9491 |
Membership in the next upper set of integers. (Contributed by NM,
5-Oct-2005.)
|
|
|
Theorem | eluzaddi 9492 |
Membership in a later upper set of integers. (Contributed by Paul
Chapman, 22-Nov-2007.)
|
|
|
Theorem | eluzsubi 9493 |
Membership in an earlier upper set of integers. (Contributed by Paul
Chapman, 22-Nov-2007.)
|
|
|
Theorem | eluzadd 9494 |
Membership in a later upper set of integers. (Contributed by Jeff Madsen,
2-Sep-2009.)
|
|
|
Theorem | eluzsub 9495 |
Membership in an earlier upper set of integers. (Contributed by Jeff
Madsen, 2-Sep-2009.)
|
|
|
Theorem | uzm1 9496 |
Choices for an element of an upper interval of integers. (Contributed by
Jeff Madsen, 2-Sep-2009.)
|
|
|
Theorem | uznn0sub 9497 |
The nonnegative difference of integers is a nonnegative integer.
(Contributed by NM, 4-Sep-2005.)
|
|
|
Theorem | uzin 9498 |
Intersection of two upper intervals of integers. (Contributed by Mario
Carneiro, 24-Dec-2013.)
|
|
|
Theorem | uzp1 9499 |
Choices for an element of an upper interval of integers. (Contributed by
Jeff Madsen, 2-Sep-2009.)
|
|
|
Theorem | nn0uz 9500 |
Nonnegative integers expressed as an upper set of integers. (Contributed
by NM, 2-Sep-2005.)
|
|