Nuprl - Proof: bezout ident n 1 2 1

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

1. b :

b1:

. b1<b

(

u,v:

. GCD(a;b1;u

a+v

b1))
3. a :

b = 0
5. q :

6. r :

b
7. a = q

b+r

u,v:

. GCD(a;b;u

a+v

By:	InstHyp [r;b] 2 THEN ExistHD -1

Generated subgoal:

1 8. u :
9. v :
10. GCD(b;r;ub+vr)
u,v:. GCD(a;b;ua+vb)
3 steps

About:

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