proposition: Fact nat_meet_n0 n : n⇣0 = 0.
proof: Proof. rewrite nat_meet_comm, nat_meet_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)