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

At: adjm to adjl graph 1 1 1 1 1
1. size:
2. m1: sizesize
3. x: size
4. i: ||filter(j.m1(x,j);upto(0;size))||
m1(x,filter(j.m1(x,j);upto(0;size))[i])
By: Assert (filter(j.m1(x,j);upto(0;size))[i] filter(j.m1(x,j);upto(0;size)))
Generated subgoals:

1 (filter(j.m1(x,j);upto(0;size))[i] filter(j.m1(x,j);upto(0;size)))1 step
 
25. (filter(j.m1(x,j);upto(0;size))[i] filter(j.m1(x,j);upto(0;size)))
m1(x,filter(j.m1(x,j);upto(0;size))[i])		1 step

About:
boolassertnatural_numberlambdaapplyfunction

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