(22steps total) PrintForm Definitions Lemmas mb event system 1 Sections EventSystems Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: select concat 2 1 2 1 1

1. T : Type
2. (T List) List
3. u : T List
4. v : (T List) List
5. n:||concat(v)||. 
5. m:||v||. 
5. ||concat(firstn(m;v))||n
5. n-||concat(firstn(m;v))||<||v[m]||
5. & concat(v)[n] = v[m][(n-||concat(firstn(m;v))||)]
6. n : ||u @ concat(v)||
7. n<||u||
8. m : ||v||
9. ||concat(firstn(m;v))||n-||u||
10. n-||u||-||concat(firstn(m;v))||<||v[m]||
11. concat(v)[(n-||u||)] = v[m][(n-||u||-||concat(firstn(m;v))||)]
  ||concat(firstn(m+1;[u / v]))||n
  n-||concat(firstn(m+1;[u / v]))||<||[u / v][(m+1)]||
  & (u @ concat(v))[n] = [u / v][(m+1)][(n-||concat(firstn(m+1;[u / v]))||)]


By: Subst (firstn(m+1;[u / v]) ~ [u / firstn(m;v)]) 0


Generated subgoals:

1   firstn(m+1;[u / v]) ~ [u / firstn(m;v)]
3 steps
2   ||concat([u / firstn(m;v)])||n
  n-||concat([u / firstn(m;v)])||<||[u / v][(m+1)]||
  & (u @ concat(v))[n] = [u / v][(m+1)][(n-||concat([u / firstn(m;v)])||)]

8 steps

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

(22steps total) PrintForm Definitions Lemmas mb event system 1 Sections EventSystems Doc