PrintForm Definitions finite sets Sections AutomataTheory Doc

At: finite decidable subset 1 1

1. T: Type
2. B: TProp
3. n:
4. f:(nT). Bij(n; T; f)
5. t:T. Dec(B(t))

Fin({t:T| B(t) })

By: Inst Thm* n:, T:Type, B:(TProp). (n ~ T) & (t:T. Dec(B(t))) (m:. m ~ {t:T| B(t) }) [n;T;B]

Generated subgoals:

1 n ~ T
26. m:. m ~ {t:T| B(t) }
Fin({t:T| B(t) })


About:
setapplyuniversefunctionpropexistsnatural_numberall