Definitions
graph
1
3
Sections
Graphs
Doc
Some definitions of interest.
biject
Def
Bij(A; B; f) == Inj(A; B; f) & Surj(A; B; f)
Thm*
A,B:Type, f:(A
B). Bij(A; B; f)
Prop
identity
Def
Id(x) == x
Thm*
A:Type. Id
A
A
int_seg
Def
{i..j
} == {k:
| i
k < j }
Thm*
m,n:
. {m..n
}
Type
nat
Def
== {i:
| 0
i }
Thm*
Type
About:
Definitions
graph
1
3
Sections
Graphs
Doc