FDL > PVS > Graphs > ramsey new > r2 TCC1 > pf:r2 TCC1 > 1 > 1 (3 nodes)

Conclusion

-1. subset?({n:T | vert(G!1)(n) AND (n /= choose[T](vert(G!1))) AND (NOT edge?[T](G!1)(choose[T](vert(G!1)), n))}, vert(G!1))

1. is finite[T](LET (v0:(vert(G!1)) ) = choose[T](vert(G!1)) IN
{n:T | vert(G!1)(n) AND (n /= v0) AND (NOT edge?[T](G!1)(v0, n))})

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

-1. FORALL A:finite set[T], S:set[T] : subset?(S, A) IMPLIES is finite(S)
-2. subset?({n:T | vert(G!1)(n) AND (n /= choose[T](vert(G!1))) AND (NOT edge?[T](G!1)(choose[T](vert(G!1)), n))}, vert(G!1))

1. is finite[T](LET (v0:(vert(G!1)) ) = choose[T](vert(G!1)) IN
{n:T | vert(G!1)(n) AND (n /= v0) AND (NOT edge?[T](G!1)(v0, n))})