FDL
>
PVS
>
Graphs
>
subgraphs
>
subgraph
vert
sub
>
pf:subgraph
vert
sub
> 1
(7 nodes)
Conclusion
-1.
subset?
(V!1, vert(G!1))
1. vert(
subgraph
(G!1, V!1))
=
V!1
Tactic
EXPAND "subgraph"
Premise 1.
(has
proof
of 6 steps)
-1.
subset?
(V!1, vert(G!1))
1. {i | vert(G!1)(i)
AND
V!1(i)}
=
V!1
