(26steps total) PrintForm Definitions mb list 1 Sections MarkB generic Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: no repeats iff 1

1. T : Type
2. l : T List
3. i,j:i<||l||  j<||l||  i = j  l[i] = l[j]
4. x : T
5. y : T
6. f:(||[xy]||||l||). 
6. increasing(f;||[xy]||) & (j:||[xy]||. [xy][j] = l[(f(j))])
  x = y


By: ExRepD THEN InstHyp [0] -1 THEN Reduce -1 THEN InstHyp [1] -2 THEN Reduce -1


Generated subgoal:

1 6. f : ||[xy]||||l||
7. increasing(f;||[xy]||)
8. j:||[xy]||. [xy][j] = l[(f(j))]
9. x = l[(f(0))]
10. y = l[(f(1))]
  x = y

5 steps

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

(26steps total) PrintForm Definitions mb list 1 Sections MarkB generic Doc