law word_adc_overflow

bend-mathlib@0.8.1.0 · u32.bend:316

import Base
import bend-mathlib@0.8.1.0/nat.bend as MNat

316# The adder drops exactly one 2^n on overflow: 2^n <= a + b + carry-in implies to_nat (adc a b False c) + 2^n = a + b + carry-in.
317law word_adc_overflow:
318  for n: Nat
319  for a: Word(n)
320  for b: Word(n)
321  for c: Bool
322  for h: MNat.le(Nat.pow(2n, n), Nat.add(Nat.add(Word.to_nat(n, a), Word.to_nat(n, b)), Bool.pick(Nat, c, 1n, 0n)))
323  {Nat.add(Word.to_nat(n, Word.adc(n, a, b, False{}, c)), Nat.pow(2n, n)) == Nat.add(Nat.add(Word.to_nat(n, a), Word.to_nat(n, b)), Bool.pick(Nat, c, 1n, 0n)) : Nat}