Nuprl - Some Definitions

Thms relation autom 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

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

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

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

int_seg	`Def {i..j} == {k:\| i k < j}` `Thm* m,n:. {m..n} Type`
lelt	`Def i j < k == ij & j < k`
le	`Def AB == B < A` `Thm* i,j:. ij Prop`
not	`Def A == A False` `Thm* (A) Prop`