law adc_one
import stelliferous@0.0.2.0/proofs/u32_successor.bend as U32Successorimport Base
60law adc_one:
61 for +n: Nat
62 for +w: Word(n)
63 {Word.adc(n,w,Word.zero(n),False{},True{}) == Word.inc(n,w) : Word(n)}
import stelliferous@0.0.2.0/proofs/u32_successor.bend as U32Successorimport Base
60law adc_one:
61 for +n: Nat
62 for +w: Word(n)
63 {Word.adc(n,w,Word.zero(n),False{},True{}) == Word.inc(n,w) : Word(n)}