PrintForm
Definitions
finite
sets
Sections
AutomataTheory
Doc
At:
prod
fin
is
fin
1
1.
T:
Type
2.
t:
T
3.
n:
4.
f:
n
T
5.
Bij(
n; T; f)
n:
, f:(
n
T
T). Bij(
n; T
T; f)
By:
Assert (n > 0)
Generated subgoals:
1
n > 0
2
6.
n > 0
n:
, f:(
n
T
T). Bij(
n; T
T; f)
About:
n > 0 
n:
, f:(n
T
T). Bij(n; TT; f)nTn; T; f) n:, f:(nTT). Bij(n; TT; f) n > 0 n:, f:(nTT). Bij(n; TT; f)
