Nuprl Basics - Proof: sfa doc sequence rel wf 1 1

(7steps total) PrintForm Definitions NuprlPrimitives Sections NuprlLIB Doc

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: sfa doc sequence rel wf 1 1

1. A : Type
2. a : A
3. e : A

A
4. i :

5.

i1:

. i1<i

i1 steps of e from a

A

i steps of e from a

A

By:	Compute i steps of e from a * if i=0 a else e(i-1 steps of e from a) fi THEN SplitITE Concl

Generated subgoals:

1 6. i = 0
  a  A
Trivial

2 6. i  0
  e(i-1 steps of e from a)  A
3 steps

About:

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

(7steps total) PrintForm Definitions NuprlPrimitives Sections NuprlLIB Doc