PrintForm Definitions choice 1 Sections AutomataTheory Doc

At: comp choice 1 1 1

1. E: Prop
2. EquivRel x,y:. x E y
3. x,y:. Dec(x E y)
4. r:
5. x,y:. (x r y) (x E y)

h:(). (n,k:. (n E k) h(n) = h(k)) & (n:. n E (h(n)))

By:
Witness z.Min{ x | xrz }
THEN
Reduce 0


Generated subgoal:

1 (n,k:. (n E k) Min{ x | xrn } = Min{ x | xrk }) & (n:. n E Min{ x | xrn })


About:
existsfunctionandallequal
applylambdapropboolassert