take { the Tree-like _Graph} ; :: thesis: ( not { the Tree-like _Graph} is empty & { the Tree-like _Graph} is \/-tolerating & { the Tree-like _Graph} is vertex-disjoint & { the Tree-like _Graph} is edge-disjoint & { the Tree-like _Graph} is acyclic & { the Tree-like _Graph} is simple & { the Tree-like _Graph} is Dsimple & { the Tree-like _Graph} is loopless & { the Tree-like _Graph} is non-multi & { the Tree-like _Graph} is non-Dmulti )
thus ( not { the Tree-like _Graph} is empty & { the Tree-like _Graph} is \/-tolerating & { the Tree-like _Graph} is vertex-disjoint & { the Tree-like _Graph} is edge-disjoint & { the Tree-like _Graph} is acyclic & { the Tree-like _Graph} is simple & { the Tree-like _Graph} is Dsimple & { the Tree-like _Graph} is loopless & { the Tree-like _Graph} is non-multi & { the Tree-like _Graph} is non-Dmulti ) ; :: thesis: verum