(5steps total) PrintForm Definitions Lemmas graph 1 2 Sections Graphs Doc

At: decidable l member paren

T:Type. (x,y:T. Dec(x = y)) (s:(T+T) List, i:T. Dec((inl(i) s)))

By:
UnivCD
THEN
BackThru Thm* x:T, l:T List. (y:T. Dec(x = y)) Dec((x l))


Generated subgoal:

11. T: Type
2. x,y:T. Dec(x = y)
3. s: (T+T) List
4. i: T
y:T+T. Dec(inl(i) = y)
4 steps

About:
listdecidableunioninluniverseequalimpliesall

(5steps total) PrintForm Definitions Lemmas graph 1 2 Sections Graphs Doc