PrintForm Definitions finite sets Sections AutomataTheory Doc

At: prod fin is fin 1 1 1 1
1. T: Type
2. t: T
3. n:
4. f: nT
5. Inj(n; T; f) & Surj(n; T; f)
6. n = 0

False
By:
Unfold `surject` 5
THEN
Analyze 5
Generated subgoal:

15. Inj(n; T; f)
6. b:T. a:n. f(a) = b
7. n = 0
False

About:
falseuniversefunctionnatural_numberandequalint