PrintForm
Definitions
finite
sets
Sections
AutomataTheory
Doc
At:
one
one
preser
fin
1
1.
T:
Type
2.
S:
Type
3.
(
n:
, f:(
n
T). Bij(
n; T; f)) & (
f:(T
S), g:(S
T). InvFuns(T; S; f; g))
n:
, f:(
n
S). Bij(
n; S; f)
By:
Analyze 3
THEN
Analyze 3
THEN
Analyze 4
Generated subgoal:
1
3.
n:
4.
f:
n
T
5.
Bij(
n; T; f)
6.
f:(T
S), g:(S
T). InvFuns(T; S; f; g)
n:
, f:(
n
S). Bij(
n; S; f)
About: