def ws.topc
import bend-osdev-word64@0.1.1.0/proof_shift.bend as ProofShiftimport Base
225# the bit Word.shl.put(n, c, w) shifts out at the top, and Word.shl's
226def ws.topc(n: Nat, c: Bool, w: Word(n)) -> Bool:
227 match n:
228 case 0n:
229 c
230 case 1n+ +p:
231 match w:
232 case WCon{b, t}:
233 ws.topc(p, b, t)