Nuprl - Proof: gcd is divisor 2 1 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: gcd is divisor 2 1 1

1. a :

2. b :

3. y :

4. GCD(a;b;y)

y | b

By:	Unfold `gcd_p` 4

Generated subgoals:

None

About:

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