def un.bxa
import bend-osdev-u32@0.1.0.0/PROOF.bend as PROOFimport Base
import bend-osdev-u32@0.1.0.0/u32.bend as U
1897def un.bxa(x: Bool, y: Bool) -> {Nat.add(U.U32Nat.bit(Bool.xor(x, y)), Nat.double(U.U32Nat.bit(Bool.and(x, y)))) == Nat.add(U.U32Nat.bit(x), U.U32Nat.bit(y)) : Nat}:
1898 match x y:
1899 case True{} True{}:
1900 {==}
1901 case True{} False{}:
1902 {==}
1903 case False{} True{}:
1904 {==}
1905 case False{} False{}:
1906 {==}