FDL > PVS > Graphs > subgraphs > subgraph TCC3 > pf:subgraph TCC3 > 1 > 2 (4 nodes)

Conclusion

1. subgraph?(G!1 WITH [vert := {i:T | vert(G!1)(i) AND V!1(i)}, edges := {e:doubleton[T] | edges(G!1)(e) AND (FORALL x:T : e(x) IMPLIES V!1(x))}], G!1)

Tactic
 EXPAND "subgraph?"
Premise 1.   (has proof of 3 steps)

1. subset?({i:T | vert(G!1)(i) AND V!1(i)}, vert(G!1)) AND subset?({e:doubleton[T] | edges(G!1)(e) AND (FORALL x:T : e(x) IMPLIES V!1(x))}, edges(G!1))