finite sets Sections AutomataTheory Doc

identity Def Id(x) == x

Thm* A:Type. Id AA

inject Def Inj(A; B; f) == a1,a2:A. f(a1) = f(a2) B a1 = a2

Thm* A,B:Type, f:(AB). Inj(A; B; f) 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_thanint
andsetnatural_numberuniverseequalapplyfunction