def un.top
import bend-osdev-u32@0.1.0.0/PROOF.bend as PROOFimport Base
1332def un.top(n: Nat, w: Word(n)) -> Bool:
1333 match n:
1334 case 0n:
1335 False{}
1336 case 1n+ +p:
1337 match w:
1338 case WCon{b, t}:
1339 un.topc(p, b, t)