A,B:Type, a:EqDecider(A), b:EqDecider(B).
  sum-deq(A;B;a;b)  (p,q:A+B. p = q  sumdeq(a;b)(p,q))

By:	Auto THEN Inst Thm* A,B:Type{i}, a:EqDecider(A), b:EqDecider(B). Thm* sum-deq-aux{\\\\v:l,i:l}(A;B;a;b)  (p,q:A+B. p = q  sumdeq(a;b)(p,q)) [A;B;a;b] THEN NthHypSq -1 THEN Analyze THEN Try Trivial

1

1. A : Type{i} 2. B : Type{i} 3. a : EqDecider(A) 4. b : EqDecider(B) 5. sum-deq-aux{\\\\v:l,i:l}(A;B;a;b)  (p,q:A+B. p = q  sumdeq(a;b)(p,q))   sum-deq(A;B;a;b) ~ sum-deq-aux{\\\\v:l,i:l}(A;B;a;b)

2 steps

About: IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html