Thms finite sets Sections AutomataTheory Doc

decidable Def Dec(P) == P P

Thm* A:Prop. Dec(A) Prop

int_seg Def {i..j} == {k:| i k < j }

Thm* m,n:. {m..n} Type

nat Def == {i:| 0i }

Thm* 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:
!abstractionimpliesfalseallpropmemberless_than
intandsetnatural_numberuniverseor