Thms grammar 1 Sections AutomataTheory Doc

NOTE: k is just a notation for {0..k}

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. (A) Prop

About:
!abstractionimpliesfalseallpropmember
less_thanintandsetuniverse