proposition: Theorem interfMin : forall L1 L2 L3 : list A, Olist L1 -> Olist L2 -> Olist L3 -> InclEq L3 L1 -> InclEq L3 L2 -> InclEq L3 (interf L1 L2).
proof: Proof. intros L1 L2 L3 H' H'0 H'1 H'2 H'3. apply interMin with (L1 := L1) (L2 := L2); auto. apply interfOlist; auto. Qed.
imports: Coq(Arith) Coq(Lexicographic_Exponentiation)