(6steps total) PrintForm Definitions mb list 1 Sections MarkB generic Search Doc
IF YOU CAN SEE THIS go to http://www.cs.cornell.edu/Info/People/sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: member iff sublist
  T:Type, x:T, L:T List. (x  L)  [x]  L
By: Unfolds [`l_member`;`sublist`] 0 THEN Try (Unfold `label` 0 THEN Reduce 0)
THEN
All Reduce
THEN
ExRepD

Generated subgoals:

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

About:
listconsnilnatural_numberless_thanapply
functionuniverseequalandall
exists
IF YOU CAN SEE THIS go to http://www.cs.cornell.edu/Info/People/sfa/Nuprl/Shared/Xindentation_hack_doc.html

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