Thms finite sets Sections AutomataTheory Doc

div_nrel Def Div(a;n;q) == nq a < n(q+1)

Thm* a:, n:, q:. Div(a;n;q) Prop

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

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

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

nat_plus Def == {i:| 0 < i }

Thm* Type

le Def AB == B < A

Thm* i,j:. ij Prop

not Def A == A False

Thm* A:Prop. (A) Prop

About:
!abstractionimpliesfalseallpropmemberless_than
intsetnatural_numberuniverseandmultiplyadd