is mentioned by

Thm* E:(TT). (x,y:T. E(x,y) x = y) (i:T, s:(T+T) List. member-left-paren(x,y.E(x,y);i;s) (inl(i) s))	[assert-member-left-paren]
Thm* E:(TT). (x,y:T. E(x,y) x = y) (i:T, s:(T+T) List. member-right-paren(x,y.E(x,y);i;s) (inr(i) s))	[assert-member-right-paren]
Thm* E:(TT). (x,y:T. E(x,y) x = y) (i:T, s:(T+T) List. member-paren(x,y.E(x,y);i;s) (inl(i) s) (inr(i) s))	[assert-member-paren]

In prior sections: bool 1 union list 1 mb basic mb nat mb list 1 mb list 2 graph 1 1 rel 1

Try larger context: Graphs