doc-src/Intro/gate.thy

move emptiness check to comp_theorems; remove eqs parameter to prove_induction; remove dead code

Gate = FOL +
consts  nand,xor :: "[o,o] => o"
rules   nand_def "nand(P,Q) == ~(P & Q)"
        xor_def  "xor(P,Q)  == P & ~Q | ~P & Q"
end