(8steps total) PrintForm Definitions Lemmas graph 1 3 Sections Graphs Doc

At: adjm-edge-accum-properties 2

1. M: AdjMatrix
2. T: Type
3. s: T
4. x: M.size
5. f: TM.sizeT
primrec(M.size;s;y,s'. if M.adj(x,y) f(s',y) else s' fi) = list_accum(s',x'.f(s',x');s;filter(M.adj(x);upto(0;M.size)))

By:
RWO Thm* n:, f,x:Top. primrec(n;x;f) ~ list_accum(i,y.f(y,i);x;upto(0;n)) 0
THEN
Reduce 0
THEN
RWO Thm* f:(TAT), P:(A), L:A List, s:T. list_accum(s',x'.f(s',x');s;filter(P;L)) ~ list_accum(i,y.if P(y) f(i,y) else i fi;s;L) 0


Generated subgoals:

None

About:
listboolifthenelsenatural_numberlambda
applyfunctionuniverseequalsqequaltopall

(8steps total) PrintForm Definitions Lemmas graph 1 3 Sections Graphs Doc