Nuprl - Some Definitions

Thms exponent Sections AutomataTheory Doc

NOTE:

i is just a notation for {0..i

}

int_seg Def {i..j} == {k:| i k < j}
Thm* m,n:. {m..n} Type

nat Def == {i:| 0i}
Thm* Type

exp Def (rec) (basepower) == if power=0 1 else base(basepower-1) fi Thm* n,k:. (nk)
Thm* n,k:. (nk)

lelt Def i j < k == ij & j < k

le Def AB == B < A
Thm* i,j:. ij Prop

eq_int Def i=j == if i=jtrue; false fi
Thm* i,j:. i=j

not Def A == A False
Thm* (A) Prop

int_seg	`Def {i..j} == {k:\| i k < j}` `Thm* m,n:. {m..n} Type`
nat	`Def == {i:\| 0i}` `Thm* Type`
exp	`Def (rec) (basepower) == if power=0 1 else base(basepower-1) fi Thm* n,k:. (nk)` `Thm* n,k:. (nk)`
lelt	`Def i j < k == ij & j < k`
le	`Def AB == B < A` `Thm* i,j:. ij Prop`
eq_int	`Def i=j == if i=jtrue; false fi` `Thm* i,j:. i=j`
not	`Def A == A False` `Thm* (A) Prop`