take the 0 + 4 -vertex Cycle-like _Graph ; :: thesis: ( the 0 + 4 -vertex Cycle-like _Graph is Cycle-like & not the 0 + 4 -vertex Cycle-like _Graph is complete & not the 0 + 4 -vertex Cycle-like _Graph is chordal )
thus ( the 0 + 4 -vertex Cycle-like _Graph is Cycle-like & not the 0 + 4 -vertex Cycle-like _Graph is complete & not the 0 + 4 -vertex Cycle-like _Graph is chordal ) ; :: thesis: verum