proposition: Theorem expected_poly_time_pair_f : forall (A B C : nat -> Type)(f1 : forall n, A n -> B n)(f2 : forall n, A n -> C n), efficient _ f1 -> efficient _ f2 -> efficient _ (fun n (a : A n) => (f1 n a, f2 n a)).
proof: Proof. intuition. eapply (@expected_poly_time_compose_binary _ _ _ _ _ _ (fun n b c => pair b c)); eauto. eapply expected_poly_time_pair. Qed.
imports: FCF.Crypto FCF.Asymptotic FCF.FCF