simp
case refl.refl
f : Bool → Bool → Bool
hmk hnk : 0 < 2 ^ zero
⊢ (if 0 = 0 then if f false true = true then 0 else 0
    else
      if 0 = 0 then if f true false = true then 0 else 0
      else
        let n' := 0 / 2;
        let m' := 0 / 2;
        let b₁ := 0 % 2 = 1;
        let b₂ := 0 % 2 = 1;
        let r := bitwise f n' m';
        if f (decide b₁) (decide b₂) = true then r + r + 1 else r + r) <
    2 ^ zero
no goals