proposition: Theorem mod2_pow2_twice: forall n, mod2 (pow2 n + (pow2 n + 0)) = false.
proof: Proof. intros. replace (pow2 n + (pow2 n + 0)) with (2 * pow2 n) by lia. apply mod2_double. Qed.
imports: Coq.Classes.Morphisms Coq.Classes.Morphisms_Prop Coq.Bool.Bool Coq.Arith.Arith Coq.micromega.Lia Coq.NArith.NArith Coq.ZArith.ZArith bbv.N_Z_nat_conversions bbv.Nomega