(15steps total) Gloss PrintForm Definitions Lemmas NumThyExamples Sections NuprlLIB Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: bezout ident n sfa 1 1 2 1

1. b : 
2. b:b<b  (u,v:. GCD(b;b;ub+vb))
3. a : 
4. b = 0
  u,v:. GCD(b;a;ub+va)


By: Inst: Thm* a:b:q:r:ba = qb+r Using:[a | b]
THEN
ExistHD Hyp:-1 THEN Rewrite by a = r+qb


Generated subgoal:

1 5. q : 
6. r : b
7. a = qb+r
  u,v:. GCD(b;r+qb;ub+v(r+qb))

8 steps

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

(15steps total) Gloss PrintForm Definitions Lemmas NumThyExamples Sections NuprlLIB Doc