Nuprl - Proof: split int seg all dom sfa 1 2 1

IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: split int seg all dom sfa 1 2 1

1. i :

2. j :

3. i<j
4. F : {i..j

}

Prop
5. F(i) & (

k:{(i+1)..j

}. F(k))
6. k : {i..j

}

F(k)

By:	Decide: k = i

Generated subgoals:

1 7. k = i
F(k)
1 step

2 7. k = i
F(k)
1 step

About:

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