IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
dep finite choice1221 1. k :
2. k1:.
2. k1<k 2.
2. (B:(k1Type), Q:(x:k1B(x)Prop).
2. ((x:k1. y:B(x). Q(x;y)) (f:(x:k1B(x)). x:k1. Q(x;f(x))))
3. B : kType
4. Q : x:kB(x)Prop
5. x:k. y:B(x). Q(x;y)
6. k = 0
7. g : x:(k-1)B(x)
8. x:(k-1). Q(x;g(x))
f:(x:kB(x)). x:k. Q(x;f(x))
By:
{get a witness for x = k-1 k } Inst: Hyp:5 Using:[k-1] THEN Analyze-1