doc-src/Tutorial/Misc/Defs.thy

proof by cases and induction on types and sets (used to be specific for HOL);

Defs = Types +
consts nand, exor :: gate
defs nand_def "nand A B == ~(A & B)"
     exor_def "exor A B == A & ~B | ~A & B"
end