discontinued slightly odd Graph.del_nodes (inefficient due to full Table.map);
theory All_Symmetricimports Messagebegintext {* All keys are symmetric *}defs all_symmetric_def: "all_symmetric \<equiv> True"lemma isSym_keys: "K \<in> symKeys" by (simp add: symKeys_def all_symmetric_def invKey_symmetric) end