Nuprl - Proof: fib coprime sfa2

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: fib coprime sfa2

. CoPrime(fib(n),fib(n+1))

By:	SimilarTo n,k:. k = n+1 CoPrime(fib(n),fib(k)) {We rephrase the theorem to simplify the arithhmetic expressions that will arise {in the proof. }

Generated subgoals:

1   n,k:. k = n+1    CoPrime(fib(n),fib(k))
7 steps

2 1. n :
2. k:. k = n+1    CoPrime(fib(n),fib(k))
  CoPrime(fib(n),fib(n+1))
1 step

About:

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

1	n,k:. k = n+1 CoPrime(fib(n),fib(k))	7 steps
2	1. n : 2. k:. k = n+1 CoPrime(fib(n),fib(k)) CoPrime(fib(n),fib(n+1))	1 step