Lemmas.word_sub_not: law of bend-kit-lemmas@0.1.1.0
Import: import bend-kit-lemmas@0.1.1.0/lemmas.bend as Lemmas
Lines 542-548 of bend-kit-lemmas@0.1.1.0/lemmas.bend: https://jend.leeeet.dev/read.txt?path=bend-kit-lemmas@0.1.1.0/lemmas.bend&start_line=542&end_line=548

import Base

# Subtraction is addition of the complement with a carry in.
law word_sub_not:
  for n: Nat
  for a: Word(n)
  for b: Word(n)
  for +c: Bool
  {Word.adc(n, a, b, True{}, c) == Word.adc(n, a, Word.not(n, b), False{}, c) : Word(n)}

Uses (11):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool.and
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool.not
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool.or
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool.xor
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Equal.cong
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Word
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Word.Con
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Word.adc
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Word.not