Nuprl - Proof: iter via intseg wf 1 1 1 1 1 1

(13steps total) PrintForm Definitions IteratedBinops Sections DiscrMathExt Doc

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: iter via intseg wf 1 1 1 1 1 1

1. A : Type
2. f : A

A

A
3. u : A
4. a :

5. n :

6.

n1:

.
6. n1<n

(

b:

. b

n1+a

(

e:({a..b

}

A). (Iter(f;u) i:{a..b

}. e(i))

A))
7. b :

8. b

n+a
9. e : {a..b

}

A
10. a<b

(Iter(f;u) i:{a..b-1

}. e(i))

A

By:	Use:[b-1-a] BackThru: Hyp:6

Generated subgoals:

None

About:

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

(13steps total) PrintForm Definitions IteratedBinops Sections DiscrMathExt Doc