(8steps total) PrintForm Definitions DiscreteMath Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: fin plus nat ooc nat 1

1. k : 
  (k+) ~ 


By: Witness: d.InjCase(diink+n) | j.if j<k inl(j) else inr(j-k) fi


Generated subgoals:

1   (j.if j<k inl(j) else inr(j-k) fi)  (k+)
1 step
2   InvFuns(k+;
  InvFuns;d.InjCase(diink+n);j.if j<k inl(j) else inr(j-k) fi)

5 steps

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

(8steps total) PrintForm Definitions DiscreteMath Sections DiscrMathExt Doc