(42steps total) PrintForm Definitions Lemmas mb event system 7 Sections EventSystems Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: ring-list 1 1 2 2 2 2 3 1

1. R : Id
2. in : |R|IdLnk
3. out : |R|IdLnk
4. i:|R|. 
4. R(source(in(i))) & R(destination(out(i)))
4. & source(out(i)) = i
4. & & destination(in(i)) = i
4. & in(destination(out(i))) = out(i)
4. & out(source(in(i))) = in(i)
5. i,j:|R|. k:x.destination(out(x))^k(i) = j
6. i : |R|
7. k : 
8. x.destination(out(x))^k(i) = i
9. (x.destination(out(x)))  |R||R|
10. i@0 : |R|
11. i@0 = i
  j:|R|. n:kx.destination(out(x))^n(i) = j  Id


By: Auto
THEN
Assert
(n:
(x.destination(out(x))^n(i) = j  (m:kx.destination(out(x))^m(i) = j))


Generated subgoals:

1 12. j : |R|
  n:
  x.destination(out(x))^n(i) = j  Id
  
  (m:kx.destination(out(x))^m(i) = j  Id)

19 steps
2 12. j : |R|
13. n:
13. x.destination(out(x))^n(i) = j  Id
13. 
13. (m:kx.destination(out(x))^m(i) = j  Id)
  n:kx.destination(out(x))^n(i) = j  Id

1 step

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

(42steps total) PrintForm Definitions Lemmas mb event system 7 Sections EventSystems Doc