proposition: Lemma app_cons_one_r : forall x l, (x::nil) ++ l = x::l.
proof: Proof. Proof using. auto. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)