PrintForm Definitions finite sets Sections AutomataTheory Doc

At: decid is comp 1

1. T: Type
2. f: TProp
3. t:T. Dec(f(t))

g:(T). t:T. f(t) g(t)

By: Inst Thm* Q:(ABProp). (x:A. y:B. Q(x,y)) (f:(AB). x:A. Q(x,f(x))) [T;;t,b. f(t) b]

Generated subgoals:

1 x:T. y:. f(x) y
24. f@0:(T). x:T. f(x) f@0(x)
g:(T). t:T. f(t) g(t)


About:
existsfunctionboolallapplyassertuniverseprop