proposition: Fact nat2bool2nat : forall x, nat2bool (bool2nat x) = x.
proof: Proof. intros []; 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)