proposition: Fact binary_le_nat_meet n m : n ≲ m <-> n⇣m = n.
proof: Proof. rewrite equal_lb_mask_equiv. rewrite binary_le_eq_lb_mask. unfold nat_meet. rewrite nat_lb_nat. apply lb_mask_meet. 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)