Nuprl - Proof: gcd exists n 1 2 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: gcd exists n 1 2 1

1. b :

b1:

. b1<b

(

. GCD(a;b1;y))
3. a :

b = 0
5. q :

6. r :

b
7. a = q

b+r

. GCD(a;b;y)

By:	InstHyp [r;b] 2

Generated subgoal:

1 8. y:. GCD(b;r;y)
y:. GCD(a;b;y)
4 steps

About:

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