Nuprl - Proof: fib coprime sfa 1

(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

n,k:

. k = n+1

CoPrime(fib(n),fib(k))

By:	Rewrite by Thm* a,b:. CoPrime(a,b) (x,y:. ax+by = 1) THEN NatInd Concl

Generated subgoals:

1 1. k :
2. k = 0+1
  x,y:. fib(0)x+fib(k)y = 1
2 steps

2 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
  x,y:. fib(n)x+fib(k)y = 1
5 steps

About:

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

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

1	1. k : 2. k = 0+1 x,y:. fib(0)x+fib(k)y = 1	2 steps
2	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 x,y:. fib(n)x+fib(k)y = 1	5 steps