Nuprl - Proof: int ooc nat 1 2 a

(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 a

1. f :

2.

i:

. 0

i

f(i) = i

2
3.

i:

.

0

i

f(i) = (-i)

2-1

x,y:

. x

2

y

2-1

By:	UnivCD THEN Analyze

Generated subgoal:

1 4. x :
5. y :
6. x2 = y2-1
False
1 step

About:

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

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