Nuprl - Proof: gcd exists n 1 2 1 1 1

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

1. b :

b1:

. b1<b

(

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

b = 0
5. q :

6. r :

b
7. a = q

b+r
8. y :

9. GCD(b;r;y)

GCD(a;b;y)

By:	(BackThru Thm* a,b,y:. GCD(a;b;y) GCD(b;a;y)) THEN (RWH (HypC 7) 0)

Generated subgoal:

1 GCD(b;qb+r;y)
2 steps

About:

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