Definition bool_fun_mu_ex (bft bfg : bool_fun) : bool_fun :=
bool_fun_exl (bool_fun_and bft (bool_fun_replacel bfg lx lx')) lx'.
Definition mu_all_eval (t be : bool_expr) : bool_expr :=
univl (Impl t (replacel be lx lx')) lx'.
Definition mu_ex_eval (t be : bool_expr) : bool_expr :=
exl (ANd t (replacel be lx lx')) lx'.
Definition BDDmu_all (gc : BDDconfig -> list ad -> BDDconfig)
(cfg : BDDconfig) (ul : list ad) (nodet nodeg : ad) :=
match BDDreplacel gc cfg ul nodeg lx lx' with
| (cfgr, noder) =>
match BDDimpl gc cfgr (noder :: ul) nodet noder with
| (cfgi, nodei) => BDDunivl gc cfgi (nodei :: ul) nodei lx'
end
end.
Definition BDDmu_ex (gc : BDDconfig -> list ad -> BDDconfig)
(cfg : BDDconfig) (ul : list ad) (nodet nodeg : ad) :=
match BDDreplacel gc cfg ul nodeg lx lx' with
| (cfgr, noder) =>
match BDDand gc cfgr (noder :: ul) nodet noder with
| (cfga, nodea) => BDDexl gc cfga (nodea :: ul) nodea lx'
end
end.

Lemma in_lx' : forall n : nat, N <= n -> S n <= 2 * N -> In (N_of_nat n) lx'.