Def GCD(a;b;y) == y | a & y | b & (z:. z | a & z | b  z | y)

is mentioned by

Thm* b:, a:. u,v:. GCD(a;b;ua+vb)

[bezout_ident_n_sfa]

In prior sections: num thy 1

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