FDL > PVS > Graphs > subgraphs > subgraph TCC2 > pf:subgraph TCC2 > 1 > 1 > 1 > 1 (3 nodes)


Conclusion

-1. subset?({i:T | vert(G!1)(i) AND V!1(i)}, vert(G!1)) IMPLIES is finite({i:T | vert(G!1)(i) AND V!1(i)})

1. is finite[T]({i:T | vert(G!1)(i) AND V!1(i)})


Tactic
ASSERT

Premise 1.   (has proof of 2 steps)

1. subset?({i:T | vert(G!1)(i) AND V!1(i)}, vert(G!1))
2. is finite[T]({i:T | vert(G!1)(i) AND V!1(i)})