Nuprl - Proof: chrem exists aux a 1 1 1 1 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: chrem exists aux a 1 1 1 1 1

1. r :

2. s :

3. CoPrime(r,s)
4. x :

5. y :

6. r

x+s

y = 1

((s

y) = (r

x+s

y) mod r) & ((s

y) = 0 mod s)

By:	Unfold `eqmod` 0 THEN Analyze 0 THEN ArithSimp 0

Generated subgoals:

1 r | -rx
1 step

2 s | sy
1 step

About:

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