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

At: adjm to adjl graph 1 3
1. size:
2. m1: sizesize
3. emap: (x:size||filter(j.m1(x,j);upto(0;size))||){p:(sizesize)| m1(1of(p),2of(p)) }
(Bij(size; size; Id) & Bij(x:size||filter(j.m1(x,j);upto(0;size))||; {p:(sizesize)| m1(1of(p),2of(p)) }; emap) & (x. < 1of(x),filter(j.m1(1of(x),j);upto(0;size))[2of(x)] > ) = (e.e) o emap (x:size||filter(j.m1(x,j);upto(0;size))||)sizesize) Prop
By:
Auto
THEN
Analyze -1
THEN
Reduce 0
Generated subgoals:

None

About:
pairproductproductboolassertnatural_numberset
lambdaapplyfunctionequalmemberpropand

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