proposition: Fact lb_plus_fix_0 a l : lb_plus a nil l = lb_succ a l.
proof: Proof. auto. Qed.
imports: Arith Nat Lia List Bool Setoid Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list utils_nat bool_list gcd sums power_decomp)