Nuprl - Proof: int ooc nat 1 2 1 2 1 1

(27steps total) PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: int ooc nat 1 2 1 2 1 1

1. f :

2.

i:

. 0

i

f(i) = i

2
3.

i:

.

0

i

f(i) = (-i)

2-1
4.

x,y:

. x

2

y

2-1
5. n :

6. q :

7. r :

2
8. n = q

2+r

i:

. f(i) = n

By:	Decide: r = 0

Generated subgoals:

1 9. r = 0
i:. f(i) = n
2 steps

2 9. r = 0
i:. f(i) = n
2 steps

About:

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

(27steps total) PrintForm Definitions Lemmas DiscreteMath Sections DiscrMathExt Doc