Thms automata 5 Sections AutomataTheory Doc

compose Def (f o g)(x) == f(g(x))

Thm* A,B,C:Type, f:(BC), g:(AB). f o g AC

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

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

Thm* Type

tidentity Def Id == Id

Thm* A:Type. Id AA

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

identity Def Id(x) == x

Thm* A:Type. Id AA

About:
!abstractionapplyalluniversememberfunctionimpliesfalse
propless_thanintandsetnatural_numberor