proposition: Fact nat_join_n0 n : n⇡0 = n.
proof: Proof. rewrite nat_join_comm, nat_join_0n; 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)