(7steps total) PrintForm Definitions IteratedBinops Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: int seg upper ind 1 1 1

1. P : Prop
2. a : 
3. b:{a...}. (c:{a..b}. P(a,c))  P(a,b)
4. k : 
5. k1:k1<k  (b:{a...}. b-ak1  P(a,b))
6. b : {a...}
7. b-ak
  P(a,b)


By: Decide: k = 0


Generated subgoals:

1 8. k = 0
  P(a,b)

1 step
2 8. k = 0
  P(a,b)

2 steps

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

(7steps total) PrintForm Definitions IteratedBinops Sections DiscrMathExt Doc