(10steps total) PrintForm Definitions Lemmas NumThyExamples Sections NuprlLIB Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: fib coprime sfa 1 2 1

1. n : 
2. 0<n
3. k:k = n-1+1  (x,y:. fib(n-1)x+fib(k)y = 1)
4. k : 
5. k = n+1
6. k = 0
7. k = 1
  a,b:. fib(n)a+(fib(k-1)+fib(k-2))b = 1


By: Rewrite by k-1 = n   THEN Rewrite by k-2 = n-1  


Generated subgoal:

1   a,b:. fib(n)a+(fib(n)+fib(n-1))b = 1
3 steps

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

(10steps total) PrintForm Definitions Lemmas NumThyExamples Sections NuprlLIB Doc