Nuprl - Proof: iter via intseg wf 1 2 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 2 1

1. A : Type
2. f : A

A

A
3. u : A
4. a :

5.

n:

, b:

. b

n+a

(

e:({a..b

}

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

}. e(i))

A)
6. b :

7. e : {a..b

}

A

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

}. e(i))

A

By:	Use:[if b<a 0 else b-a fi] BackThru: Hyp:5

Generated subgoals:

1   if b<a 0 else b-a fi
1 step

2   b
Auto

3   bif b<a 0 else b-a fi+a
1 step

4   (i.e(i))  {a..b}A
Auto

About:

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

(13steps total) PrintForm Definitions IteratedBinops Sections DiscrMathExt Doc