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

Conclusion

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

Tactic
 LEMMA "finite_subset[doubleton[T]]"
Premise 1.   (has proof of 5 steps)

-1. FORALL A:finite set[doubleton[T]], S:set[doubleton[T]] : subset?(S, A) IMPLIES is finite(S)

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