Nuprl - Proof: bezout ident n sfa 1 1 2 1 1 1 1 1 1

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

1. b :

. b<b

(

u,v:

. GCD(b;b;u

b+v

b))
3. a :

b = 0
5. q :

6. r :

b
7. a = q

b+r
8. x :

9. y :

10. GCD(b;r+q

b;x

b+y

u,v:

. u

b+v

(r+q

b) = x

b+y

By:	using y for v

Generated subgoal:

1 u:. ub+y(r+qb) = xb+yr
3 steps

About:

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