Thms exponent Sections AutomataTheory Doc

geom_series Def (qn) == if n=0 0 else (qn-1)+(qn-1) fi (recursive)

Thm* q,n:. (qn)

exp Def (basepower) == if power=0 1 else base(basepower-1) fi (recursive)

Thm* n,k:. (nk)

Thm* n,k:. (nk)

gt Def i > j == j < i

Thm* i,j:. i > j Prop

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

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

nat Def == {i:| 0i }

Thm* Type

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

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

eq_int Def i=j == if i=j true ; false fi

Thm* i,j:. i=j

About:
!abstractionint_eqbtruebfalseallintmember
boolimpliesfalsepropless_thanandset
natural_numberuniverserecursive_def_noticeifthenelsemultiplysubtractadd