(10steps total) PrintForm Definitions Lemmas num thy 1 Sections StandardLIB Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: gcd exists n 1 1
1. b : 
2. b1:. b1<b  (a:. y:. GCD(a;b1;y))
3. a : 
4. b = 0
  y:. GCD(a;b;y)
By: (InstConcl [a]) THEN (RWH (HypC 4) 0)

Generated subgoal:

1   GCD(a;0;a)
1 step

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

(10steps total) PrintForm Definitions Lemmas num thy 1 Sections StandardLIB Doc