doc-src/Tutorial/Misc/ConstDefs.thy

more tidying. also generalized some tactics to prove "Type A" and
"a = b : A" judgements

ConstDefs = Types +
constdefs nand :: gate
         "nand A B == ~(A & B)"
          exor :: gate
         "exor A B == A & ~B | ~A & B"
end