take { the _Graph} ; :: thesis: ( { the _Graph} is trivial & { the _Graph} is finite & not { the _Graph} is empty & { the _Graph} is Graph-membered )
thus ( { the _Graph} is trivial & { the _Graph} is finite & not { the _Graph} is empty & { the _Graph} is Graph-membered ) ; :: thesis: verum