proposition: Lemma Forall_nil_iff@{u} : forall (T : Type@{u}) (P : T -> Prop), Forall P nil <-> True.
proof: Proof. clear. split; auto. Qed.
imports: Coq.Lists.List ExtLib.Core.RelDec ExtLib.Structures.Monoid ExtLib.Structures.Reducible ExtLib.Tactics.Consider ExtLib.Tactics.Injection