(** Fro categories C and C', a functor F : C -> C' consists of an arrow map from objects of C to objects of C' and an arrow map from arrows of C to arrows of C' such that an arrow h : a -> b is mapped to (F h) : F a -> F b.  Furthermore, we require functors to map identitiies to identities. Additionally, the immage of the coposition of two arrows must be the same as composition of their images. *)
Record Functor (C C' : Category) : Type :=
{
(** Object map *)
FO : C → C';
(** Arrow map *)
FA : ∀ {a b}, (a –≻ b)%morphism → ((FO a) –≻ (FO b))%morphism;
(** Mapping of identities *)
F_id : ∀ c, FA (id c) = id (FO c);
(** Functor commuting with composition *)
F_compose : ∀ {a b c} (f : (a –≻ b)%morphism) (g : (b –≻ c)%morphism),
(FA (g ∘ f) = (FA g) ∘ (FA f))%morphism
(* F_id and F_compose together state the fact that functors are morphisms of categories (preserving the structure of categories!)*)
}.
Arguments FO {_ _} _ _.
Arguments FA {_ _} _ {_ _} _, {_ _} _ _ _ _.
Arguments F_id {_ _} _ _.
Arguments F_compose {_ _} _ {_ _ _} _ _.
Notation "C –≻ D" := (Functor C D) : functor_scope.
Bind Scope functor_scope with Functor.
Notation "F '_o'" := (FO F) : object_scope.
Notation "F '@_a'" := (@FA _ _ F) : morphism_scope.
Notation "F '_a'" := (FA F) : morphism_scope.
Hint Extern 2 => (apply F_id).
Local Open Scope morphism_scope.
Local Open Scope object_scope.
Ltac Functor_Simplify :=
progress
(
repeat rewrite F_id;
(
repeat
match goal with
| [|- ?F _a ?A = id (?F _o ?x)] =>
(rewrite <- F_id; (cbn+idtac))
| [|- (id (?F _o ?x)) = ?F _a ?A] =>
(rewrite <- F_id; (cbn+idtac))
| [|- ?F _a ?A ∘ ?F _a ?B = ?F _a ?C ∘ ?F _a ?D] =>
(repeat rewrite <- F_compose; (cbn+idtac))
| [|- ?F _a ?A ∘ ?F _a ?B = ?F _a ?C] =>
(rewrite <- F_compose; (cbn+idtac))
| [|- ?F _a ?C = ?F _a ?A ∘ ?F _a ?B] =>
(rewrite <- F_compose; (cbn+idtac))
| [|- context [?F _a ?A ∘ ?F _a ?B]] =>
(rewrite <- F_compose; (cbn+idtac))
end
)
)
.
Hint Extern 2 => Functor_Simplify.
Section Functor_eq_simplification.
Context {C C' : Category} (F G : (C –≻ C')%functor).

(** Two functors are equal if their object maps and arrow maps are. *)
Lemma Functor_eq_simplify (Oeq : F _o = G _o) :
((fun x y =>
match Oeq in _ = V return ((x –≻ y) → ((V x) –≻ (V y)))%morphism with
eq_refl => F  @_a x y
end) = G @_a) -> F = G.