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

At: adjm to adjl graph 1 1

1. size:
2. m1: sizesize
(e.e/x,i. < x,filter(j.m1(x,j);upto(0;size))[i] > ) (x:size||filter(j.m1(x,j);upto(0;size))||){p:(sizesize)| m1(1of(p),2of(p)) }

By:
Auto
THEN
Analyze
THEN
Reduce 0


Generated subgoal:

13. e: x:size||filter(j.m1(x,j);upto(0;size))||
4. x: size
5. i: ||filter(j.m1(x,j);upto(0;size))||
6. e = < x,i > x:size||filter(j.m1(x,j);upto(0;size))||
m1(x,filter(j.m1(x,j);upto(0;size))[i])
6 steps

About:
pairspreadproductproductboolassertnatural_number
setlambdaapplyfunctionmember

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