Nuprl - Proof: gcd p mul 3 1 1 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: gcd p mul 3 1 1 1

1. a :

2. b :

3. y :

4. n :

5. GCD(a;b;y)
6. z :

7. z | n

a
8. z | n

b
9. u :

10. v :

11. GCD(a;b;u

a+v

b)
12. y ~ (u

a+v

b)
13. z | n

u
14. z | n

z | n

a+v

By:	(FwdThru Thm* a,b1,b2:. a \| b1 a \| b2 a \| b1+b2 [13;14]) THEN (OnMCls [-1;0] ArithSimp)

Generated subgoals:

None

About:

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