def low0

bend-collections-laws-crypto@1.0.0.0 · proofs/lib/word.bend:279

import Base

279def low0(+p: Nat, +b: Bool, +t: Word(p)) -> {uw(1n+p, Word.and(1n+p, WCon{b, t}, mask(1n+p, 0n))) == 0n : Nat}:
280  match b:
281    case True{}:
282      Equal.cong(Nat, Nat, z => Nat.double(z), uw(p, Word.and(p, t, mask(p, 0n))), 0n, and_zero(p, t))
283    case False{}:
284      Equal.cong(Nat, Nat, z => Nat.double(z), uw(p, Word.and(p, t, mask(p, 0n))), 0n, and_zero(p, t))