proposition: Theorem appendfOlist : forall L1 L2 : list A, Olist L1 -> Olist L2 -> Olist (appendf L1 L2).
proof: Proof. intros L1 L2 H' H'0. apply appendOlist with (L1 := L1) (L2 := L2); auto. Qed.
imports: Coq(Arith) Coq(Lexicographic_Exponentiation)