(7steps total) PrintForm Definitions Lemmas graph 1 2 Sections Graphs Doc

At: div-graph-iso

DivGraph_2 DivGraph_1

By:
Unfolds [`divides-graph1`;`divides-graph2`] 0
THEN
Using [`H',Graph(i,j:. c:. j = ic)] ((BackThru Thm* G,H,K:Graph. G H H K G K) THENA (Auto THEN Easy))


Generated subgoals:

1 Graph(i: -- > in | n:) Graph(i,j:. c:. j = ic )5 steps
 
2 Graph(i,j:. c:. j = ic ) Graph(i,j:. i | j)1 step

About:
multiplyequalimpliesallexists

(7steps total) PrintForm Definitions Lemmas graph 1 2 Sections Graphs Doc