Nuprl - Proof: adjm to adjl graph 1 2 2 2 1 1

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

At: adjm to adjl graph 1 2 2 2 1 1

1. size:
2. m1: sizesize
3. b: sizesize
4. 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)) }

By: Assert (2of(b) filter(j.m1(1of(b),j);upto(0;size)))

Generated subgoals:

1 (2of(b) filter(j.m1(1of(b),j);upto(0;size))) 3 steps

2 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)) } 19 steps

About:

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