(7steps total) PrintForm Definitions Lemmas NuprlPrimitives Sections NuprlLIB Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: kleene minimize is fp 1 1 1 1

1. n : 
2. n1:n1<n  (f:{f:()| x:f(x) }. mu(f) = n1  f(mu(f)))
3. f : {f:()| x:f(x) }
4. mu(f) = n
5. f(0)
6. (x.f(1+x))  {f:()| x:f(x) }
  mu(x.f(1+x))<n


By: Compute4 mu(f) * if f(0) 0 else 1+mu(x.f(1+x)) fi


Generated subgoal:

1 4. if f(0) 0 else 1+mu(x.f(1+x)) fi = n  
5. f(0)
6. (x.f(1+x))  {f:()| x:f(x) }
  mu(x.f(1+x))<n

1 step

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

(7steps total) PrintForm Definitions Lemmas NuprlPrimitives Sections NuprlLIB Doc