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

At: adjm to adjl graph 1 2 2 2

1. size:
2. m1: sizesize
b:{p:(sizesize)| m1(1of(p),2of(p)) }. 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:
Analyze 0
THEN
Analyze -1
THEN
Decide (m1(1of(b),2of(b)))


Generated subgoals:

13. b: sizesize
4. m1(1of(b),2of(b))
5. m1(1of(b),2of(b))
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)) }
24 steps
 
23. b: sizesize
4. m1(1of(b),2of(b))
5. m1(1of(b),2of(b))
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)) }
1 step

About:
pairspreadproductproductboolassertnatural_number
setlambdaapplyfunctionequalall
exists

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