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

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

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

1. size:
2. m1: sizesize
3. b: sizesize
4. m1(1of(b),2of(b))
5. 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]
8. a: x:size||filter(j.m1(x,j);upto(0;size))||
9. x: size
10. i1: ||filter(j.m1(x,j);upto(0;size))||
11. a = < x,i1 > x:size||filter(j.m1(x,j);upto(0;size))||

m1(x,filter(j.m1(x,j);upto(0;size))[i1])

By: Assert (x:size, i:||filter(j.m1(x,j);upto(0;size))||. m1(x,filter(j.m1(x,j);upto(0;size))[i]))

Generated subgoals:

1 x:size, i:||filter(j.m1(x,j);upto(0;size))||. m1(x,filter(j.m1(x,j);upto(0;size))[i]) 4 steps

2 12. x:size, i:||filter(j.m1(x,j);upto(0;size))||. m1(x,filter(j.m1(x,j);upto(0;size))[i])
m1(x,filter(j.m1(x,j);upto(0;size))[i1]) 1 step

About:

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

1	`x:size, i:\|\|filter(j.m1(x,j);upto(0;size))\|\|. m1(x,filter(j.m1(x,j);upto(0;size))[i])`	4 steps

2	12. `x:size, i:\|\|filter(j.m1(x,j);upto(0;size))\|\|. m1(x,filter(j.m1(x,j);upto(0;size))[i])` `m1(x,filter(j.m1(x,j);upto(0;size))[i1])`	1 step