law and_zero
import stelliferous@0.0.2.0/proofs/word_encoding.bend as WordEncodingimport Base
265law and_zero:
266 for +n: Nat
267 for +w: Word(n)
268 {Word.and(n,w,Word.zero(n)) == Word.zero(n) : Word(n)}
import stelliferous@0.0.2.0/proofs/word_encoding.bend as WordEncodingimport Base
265law and_zero:
266 for +n: Nat
267 for +w: Word(n)
268 {Word.and(n,w,Word.zero(n)) == Word.zero(n) : Word(n)}