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

At: list-list-connect weakening

For any graph A,B:V List. A = B A-- > *B

By:
Auto
THEN
BackThru Thm* For any graph A,B:V List. B A A-- > *B


Generated subgoal:

11. the_graph: Graph
2. A: Vertices(the_graph) List
3. B: Vertices(the_graph) List
4. A = B
B A
1 step

About:
listequalimpliesall

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