def b_fmap
import bendtorch@1.3.0.0/PROOF.bend as PROOFimport Base
import bendtorch@1.3.0.0/main.bend as T
560def b_fmap(+h: Nat, +dm: T.Dm, xs: List<&1, T.BG>) -> List<&1, T.DB>:
561 match xs:
562 case Nil{}:
563 Nil{}
564 case Con{x, t}:
565 T.db_of(T.bgroups(h, 0n, dm, x)) <> b_fmap(h, dm, t)