| Parents |
| orders | dyadic |
| Children |
| analysis |
| Constants |
|
Is_
_Rep
|
( ) SET BOOL
|
|
$<R
|
BOOL
|
|
$
R |
BOOL
|
|
$>R
|
BOOL
|
|
$
R |
BOOL
|
|
Sup
|
SET
|
|
1R
|
|
|
0R
|
|
|
$+R
|
|
|
~R
|
|
|
$-R
|
|
![]() ![]() |
|
|
AbsR
|
|
|
$*R
|
|
|
$/R
|
|
|
$/N
|
|
|
$-1
|
|
|
$^N
|
|
![]() ![]() |
|
|
$^Z
|
|
|
Float
|
![]() |
| Aliases |
|
<
|
$<R : BOOL
|
![]() |
$ R : BOOL
|
|
>
|
$>R : BOOL
|
![]() |
$ R : BOOL
|
|
+
|
$+R :
|
|
~
|
~R :
|
|
-
|
$-R :
|
|
Abs
|
AbsR :
|
|
*
|
$*R :
|
|
/
|
$/R :
|
|
/
|
$/N :
|
|
^
|
$^N :
|
|
^
|
$^Z : ![]() |
| Types |
|
| Fixity |
| Left Infix 305: |
-R |
Left Infix 315: |
/ | /N | /R |
Right Infix 210: |
<R | >R | R |
R |
Right Infix 300: |
+R |
Right Infix 310: |
*R |
Right Infix 320: |
^N | ^Z |
Postfix 320: | -1 |
| Definitions |
|
Is_
_Rep
|
a Is_ _Rep a a Cuts (Universe, $dy_less)
|
_def
|
f TypeDefn Is_ _Rep f
|
|
<R
|
ConstSpec <R' StrictLinearOrder (Universe, <R') UnboundedBelow (Universe, <R') UnboundedAbove (Universe, <R') Complete (Universe, <R') ( ( a b <R' ( a) ( b) a dy_less b) {x| a a = x} |
R |
x y x y x < y x = y
|
|
>R
|
x y x > y y < x
|
R |
x y x y y x
|
|
Sup
|
ConstSpec Sup' A A = {} ( b x x A x b) ( x x A x Sup' A) ( b ( x x A x b) Sup' A b)) |
|
+R
0R
1R
|
ConstSpec (+R', 0R', 1R') ( x y z +R' (+R' x y) z = +R' x (+R' y z)) ( x y +R' x y = +R' y x) ( x +R' x 0R' = x) ( x y +R' x y = 0R') ( x y z y < z +R' x y < +R' x z) 0R' < 1R') |
|
~R
|
ConstSpec ( ~R' x x + ~R' x = 0R) ~
|
|
-R
|
x y x - y = x + ~ y
|
![]() ![]() |
![]() 0 = 0R ( m ![]() (m + 1) = ![]() m + 1R)
|
|
AbsR
|
x Abs x = (if ![]() 0 x then x else ~ x)
|
|
*R
|
ConstSpec *R' ( x y z *R' (*R' x y) z = *R' x (*R' y z)) ( x *R' x (![]() 1) = x) ( x y z *R' x (y + z) = *R' x y + *R' x z) ( x y *R' x y = *R' y x) ( x y ![]() 0 < x ![]() 0 < y ![]() 0 < *R' x y)) |
|
/R
|
ConstSpec /R' ( y z z = ![]() 0 /R' (y * z) z = y) ( x y z z = ![]() 0 /R' (x * y) z = x * /R' y z)) |
|
/N
|
m n m / n = ![]() m / ![]() n
|
|
-1
|
x x -1 = ![]() 1 / x
|
|
^N
|
( x x ^ 0 = ![]() 1) ( x m x ^ (m + 1) = x * x ^ m)
|
![]() ![]() |
ConstSpec $"![]() '" $"![]() '" (![]() 0) = ![]() 0 $"![]() '" (![]() 1) = ![]() 1 ( i j $"![]() '" (i + j) = $"![]() '" i + $"![]() '" j)) ![]()
|
|
^Z
|
ConstSpec ^Z' x m ^Z' x (![]() m) = x ^ m ^Z' x (~ (![]() (m + 1))) |
|
Float
|
m p e Float m p e = ![]() m * ![]() 10 ^ (e + ~ p)
|
| Theorems |
|
dy_less_order_lemmas_thm
|
StrictLinearOrder (Universe, $dy_less)
UnboundedBelow (Universe, $dy_less) UnboundedAbove (Universe, $dy_less) Universe DenseIn (Universe, $dy_less)
|
|
is_
_rep_consistent_thm
|
a Is_ _Rep a
|
|
<R_consistent
|
Consistent
<R' StrictLinearOrder (Universe, <R') UnboundedBelow (Universe, <R') UnboundedAbove (Universe, <R') Complete (Universe, <R') ( ( a b <R' ( a) ( b) a dy_less b) {x| a a = x} |
_unbounded_below_thm
|
x y y < x
|
_unbounded_above_thm
|
x y x < y
|
_less_irrefl_thm
|
x x < x
|
_less_antisym_thm
|
x y (x < y y < x)
|
_less_trans_thm
|
x y z x < y y < z x < z
|
_less_cases_thm
|
x y x < y x = y y < x
|
_ _cases_thm
|
x y x y y x
|
_ _less_cases_thm
|
x y x y y < x
|
_eq_ _thm
|
x y x = y x y y x
|
_ _antisym_thm
|
x y x y y x x = y
|
_less_ _trans_thm
|
x y z x < y y z x < z
|
_ _less_trans_thm
|
x y z x y y < z x < z
|
_ _refl_thm
|
x x x
|
_ _trans_thm
|
x y z x y y z x z
|
_ _ _less_thm
|
x y x y y < x
|
_ _ _less_thm
|
x y x y y < x
|
_less_ _eq_thm
|
x y x < y x = y
|
_less_dense_thm
|
x y x < y ( z x < z z < y)
|
_complete_thm
|
A
A = {} ( b x x A x b) ( s ( x x A x s) ( b ( x x A x b) s b))
|
|
Sup_consistent
|
Consistent
Sup' A A = {} ( b x x A x b) ( x x A x Sup' A) ( b ( x x A x b) Sup' A b))
|
_sup_thm
|
A a A = {} ( x x A x a) ( x x A x Sup A) ( b ( x x A x b) Sup A b)
|
_less_sup_thm
|
A
A = {} ( a x x A x a) ( x x < Sup A ( y y A x < y))
|
_less_sup_bc_thm
|
A x
A = {} ( a x x A x a) ( y y A x < y) x < Sup A
|
_ _sup_thm
|
A a A = {} ( a x x A x a) ( x x Sup A ( y ( z z A z y) x y))
|
_ _sup_bc_thm
|
A a x
A = {} ( a x x A x a) ( y ( z z A z y) x y) x Sup A
|
_ _ _sup_bc_thm
|
A x x A ( a x x A x a) x Sup A
|
_ _sup_thm
|
A B A = {} ( a x x A x a) B = {} ( b y y B y b) A B Sup A Sup B
|
_sup_ _bc_thm
|
A a x
A = {} ( a x x A x a) ( y y A y x) Sup A x
|
_sup_less_bc_thm
|
A x z
A = {} ( a x x A x a) ( y y A y x) x < z Sup A < z
|
_sup_eq_bc_thm
|
A a s
A = {} ( x x A x s) ( x ( y y A y x) s x) Sup A = s
|
_eq_sup_bc_thm
|
A a s
A = {} ( x x A x s) ( x ( y y A y x) s x) s = Sup A
|
_less_sup_ _thm
|
A a
A = {} ( x x A x a) Sup A A ( x x < Sup A ( y x < y y < Sup A y A))
|
|
+R_consistent
0R_consistent
1R_consistent
|
Consistent
(+R', 0R', 1R') ( x y z +R' (+R' x y) z = +R' x (+R' y z)) ( x y +R' x y = +R' y x) ( x +R' x 0R' = x) ( x y +R' x y = 0R') ( x y z y < z +R' x y < +R' x z) 0R' < 1R')
|
|
~R_consistent
|
Consistent ( ~R' x x + ~R' x = 0R)
|
_plus_assoc_thm
|
x y z (x + y) + z = x + y + z
|
_plus_comm_thm
|
x y x + y = y + x
|
_plus_unit_thm
|
x x + 0R = x
|
_plus_mono_thm
|
x y z y < z x + y < x + z
|
_plus_assoc_thm1
|
x y z x + y + z = (x + y) + z
|
_plus_mono_thm1
|
x y z y < z y + x < z + x
|
_plus_mono_thm2
|
x y s t x < y s < t x + s < y + t
|
_plus_0_thm
|
x x + ![]() 0 = x ![]() 0 + x = x
|
_0_1_thm
|
0R = ![]() 0 1R = ![]() 1
|
_plus_order_thm
|
x y z
y + x = x + y (x + y) + z = x + y + z y + x + z = x + y + z
|
_plus_minus_thm
|
x x + ~ x = ![]() 0 ~ x + x = ![]() 0
|
_eq_thm
|
x y x = y x + ~ y = ![]() 0
|
![]() _plus_homomorphism_thm
|
m n ![]() (m + n) = ![]() m + ![]() n
|
_minus_clauses
|
x y
~ (~ x) = x x + ~ x = ![]() 0 ~ x + x = ![]() 0 ~ (x + y) = ~ x + ~ y ~ (![]() 0) = ![]() 0
|
_minus_eq_thm
|
x y ~ x = ~ y x = y
|
![]() _0_less_thm
|
m ![]() 0 < ![]() (m + 1)
|
![]() _one_one_thm
|
m n ![]() m = ![]() n m = n
|
_plus_clauses
|
x y z
(x + z = y + z x = y) (z + x = y + z x = y) (x + z = z + y x = y) (z + x = z + y x = y) (x + z = z x = ![]() 0) (z + x = z x = ![]() 0) (z = z + y y = ![]() 0) (z = y + z y = ![]() 0) x + ![]() 0 = x ![]() 0 + x = x ![]() 1 = ![]() 0 ![]() 0 = ![]() 1
|
_less_less_0_thm
|
x y x < y x + ~ y < ![]() 0
|
_less_clauses
|
x y z
(x + z < y + z x < y) (z + x < y + z x < y) (x + z < z + y x < y) (z + x < z + y x < y) (x + z < z x < ![]() 0) (z + x < z x < ![]() 0) (x < z + x ![]() 0 < z) (x < x + z ![]() 0 < z) x < x ![]() 0 < ![]() 1 ![]() 1 < ![]() 0
|
_less_0_less_thm
|
x y x < y ![]() 0 < y + ~ x
|
_ _clauses
|
x y z (x + z y + z x y) (z + x y + z x y) (x + z z + y x y) (z + x z + y x y) (x + z z x ![]() 0) (z + x z x ![]() 0) (x z + x ![]() 0 z) (x x + z ![]() 0 z) x x ![]() 0 ![]() 1 ![]() 1 ![]() 0
|
_ _ _0_thm
|
x y x y x + ~ y ![]() 0
|
_ _0_ _thm
|
x y x y ![]() 0 y + ~ x
|
![]() _less_thm
|
m n ![]() m < ![]() n m < n
|
_less_strong_dense_thm
|
x y x < y ( d ![]() 0 < d x + d < y)
|
![]() _ _thm
|
m n ![]() m ![]() n m n
|
_sup_plus_thm
|
A a x
A = {} ( x x A x a) Sup A + x = Sup {t| a a A t < a + x}
|
_sup_plus_sup_thm
|
A a B b
A = {} ( x x A x a) B = {} ( y y B y b) Sup A + Sup B a b a A b B t < a + b}
|
_delta_induction_thm
|
x p
( d ![]() 0 < d ( e d < e ( t x < t t < x + e p t)) ( s x < s p s p (s + d))) ( y x < y p y)
|
_ord_pres_strict_thm
|
f
![]() |