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

Conclusion

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