take the empty Graph-membered set ; :: thesis: ( the empty Graph-membered set is empty & the empty Graph-membered set is plain & the empty Graph-membered set is loopless & the empty Graph-membered set is non-multi & the empty Graph-membered set is non-Dmulti & the empty Graph-membered set is simple & the empty Graph-membered set is Dsimple & the empty Graph-membered set is acyclic & the empty Graph-membered set is connected & the empty Graph-membered set is Tree-like & the empty Graph-membered set is chordal & the empty Graph-membered set is edgeless & the empty Graph-membered set is loopfull )
thus ( the empty Graph-membered set is empty & the empty Graph-membered set is plain & the empty Graph-membered set is loopless & the empty Graph-membered set is non-multi & the empty Graph-membered set is non-Dmulti & the empty Graph-membered set is simple & the empty Graph-membered set is Dsimple & the empty Graph-membered set is acyclic & the empty Graph-membered set is connected & the empty Graph-membered set is Tree-like & the empty Graph-membered set is chordal & the empty Graph-membered set is edgeless & the empty Graph-membered set is loopfull ) ; :: thesis: verum