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

At: adjm to adjl graph 1 2 2 2 1 1 2
1. size:
2. m1: sizesize
3. b: sizesize
4. m1(1of(b),2of(b))
5. (2of(b) filter(j.m1(1of(b),j);upto(0;size)))
a:(x:size||filter(j.m1(x,j);upto(0;size))||). (a/x,i. < x,filter(j.m1(x,j);upto(0;size))[i] > ) = b {p:(sizesize)| m1(1of(p),2of(p)) }
By:
Unfold `l_member` -1
THEN
ExRepD
Generated subgoal:

15. i:
6. i < ||filter(j.m1(1of(b),j);upto(0;size))||
7. 2of(b) = filter(j.m1(1of(b),j);upto(0;size))[i]
a:(x:size||filter(j.m1(x,j);upto(0;size))||). (a/x,i. < x,filter(j.m1(x,j);upto(0;size))[i] > ) = b {p:(sizesize)| m1(1of(p),2of(p)) }		18 steps

About:
pairspreadproductproductboolassertnatural_number
setlambdaapplyfunctionequal
exists

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