A Lean Companion to Conceptual Mathematics

Session 22: Universal mapping properties; Incidence relations🔗

4. Basic figure-types, singular figures, and incidence, in the category of graphs🔗

Exercise 1 (p. 250)

Consider the diagram of graphs B_1 \leftarrow P \rightarrow B_2 Suppose it satisfies the fragment of the definition of product in which we test against only the two figure-types {X = A} and {X = D}. Prove that the diagram actually is a product, i.e. that the product property holds for all graphs X.

Solution: Exercise 1

We begin by creating helpers for two key equivalences.

open IrreflexiveGraph ConcreteCategory in -- Establish equivalence between Hom(A, X) and arrows of X def homAEquiv (X : IrreflexiveGraph) : (A ⟶ X) ≃ X.carrierA where toFun fAX := fAX.val.1 () invFun xA := ⟨(↾fun _ ↦ xA, ↾(fun | 0 => X.toSrc xA | 1 => X.toTgt xA : Fin 2 → X.carrierD)), X:IrreflexiveGraphxA:X.carrierA⊢ (↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA).2 ⊚ A.toSrc = X.toSrc ⊚ (↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA).1 ∧ (↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA).2 ⊚ A.toTgt = X.toTgt ⊚ (↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA).1 X:IrreflexiveGraphxA:X.carrierA⊢ (↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA).2 ⊚ A.toSrc = X.toSrc ⊚ (↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA).1X:IrreflexiveGraphxA:X.carrierA⊢ (↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA).2 ⊚ A.toTgt = X.toTgt ⊚ (↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA).1 X:IrreflexiveGraphxA:X.carrierA⊢ (↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA).2 ⊚ A.toSrc = X.toSrc ⊚ (↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA).1X:IrreflexiveGraphxA:X.carrierA⊢ (↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA).2 ⊚ A.toTgt = X.toTgt ⊚ (↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA).1 (X:IrreflexiveGraphxA:X.carrierAx✝:A.carrierA⊢ (hom ((↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA).2 ⊚ A.toTgt)).toFun x✝ = (hom (X.toTgt ⊚ (↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA).1)).toFun x✝; All goals completed! 🐙) ⟩ left_inv fAX := X:IrreflexiveGraphfAX:A ⟶ X⊢ (fun xA ↦ ⟨(↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA), ⋯⟩) ((fun fAX ↦ (hom (↑fAX).1) ()) fAX) = fAX X:IrreflexiveGraphfAX:A ⟶ X⊢ (↑((fun xA ↦ ⟨(↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA), ⋯⟩) ((fun fAX ↦ (hom (↑fAX).1) ()) fAX))).1 = (↑fAX).1X:IrreflexiveGraphfAX:A ⟶ X⊢ (↑((fun xA ↦ ⟨(↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA), ⋯⟩) ((fun fAX ↦ (hom (↑fAX).1) ()) fAX))).2 = (↑fAX).2 X:IrreflexiveGraphfAX:A ⟶ X⊢ (↑((fun xA ↦ ⟨(↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA), ⋯⟩) ((fun fAX ↦ (hom (↑fAX).1) ()) fAX))).1 = (↑fAX).1 All goals completed! 🐙 X:IrreflexiveGraphfAX:A ⟶ X⊢ (↑((fun xA ↦ ⟨(↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA), ⋯⟩) ((fun fAX ↦ (hom (↑fAX).1) ()) fAX))).2 = (↑fAX).2 X:IrreflexiveGraphfAX:A ⟶ Xi:A.carrierD⊢ (hom (↑((fun xA ↦ ⟨(↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA), ⋯⟩) ((fun fAX ↦ (hom (↑fAX).1) ()) fAX))).2).toFun i = (hom (↑fAX).2).toFun i X:IrreflexiveGraphfAX:A ⟶ Xi:Fin 2⊢ (hom (↑((fun xA ↦ ⟨(↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA), ⋯⟩) ((fun fAX ↦ (hom (↑fAX).1) ()) fAX))).2).toFun i = (hom (↑fAX).2).toFun i X:IrreflexiveGraphfAX:A ⟶ X⊢ (hom (↑((fun xA ↦ ⟨(↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA), ⋯⟩) ((fun fAX ↦ (hom (↑fAX).1) ()) fAX))).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩) = (hom (↑fAX).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩)X:IrreflexiveGraphfAX:A ⟶ X⊢ (hom (↑((fun xA ↦ ⟨(↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA), ⋯⟩) ((fun fAX ↦ (hom (↑fAX).1) ()) fAX))).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩) = (hom (↑fAX).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩) X:IrreflexiveGraphfAX:A ⟶ X⊢ (hom (↑((fun xA ↦ ⟨(↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA), ⋯⟩) ((fun fAX ↦ (hom (↑fAX).1) ()) fAX))).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩) = (hom (↑fAX).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩) All goals completed! 🐙 X:IrreflexiveGraphfAX:A ⟶ X⊢ (hom (↑((fun xA ↦ ⟨(↾fun x ↦ xA, ↾fun x ↦ match x with | 0 => (hom X.toSrc) xA | 1 => (hom X.toTgt) xA), ⋯⟩) ((fun fAX ↦ (hom (↑fAX).1) ()) fAX))).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩) = (hom (↑fAX).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩) All goals completed! 🐙 right_inv xA := rfl open IrreflexiveGraph in -- Establish equivalence between Hom(D, X) and dots of X def homDEquiv (X : IrreflexiveGraph) : (D ⟶ X) ≃ X.carrierD where toFun fDX := fDX.val.2 () invFun xD := ⟨(↾Empty.elim, ↾fun _ ↦ xD), X:IrreflexiveGraphxD:X.carrierD⊢ (↾Empty.elim, ↾fun x ↦ xD).2 ⊚ D.toSrc = X.toSrc ⊚ (↾Empty.elim, ↾fun x ↦ xD).1 ∧ (↾Empty.elim, ↾fun x ↦ xD).2 ⊚ D.toTgt = X.toTgt ⊚ (↾Empty.elim, ↾fun x ↦ xD).1 X:IrreflexiveGraphxD:X.carrierD⊢ (↾Empty.elim, ↾fun x ↦ xD).2 ⊚ D.toSrc = X.toSrc ⊚ (↾Empty.elim, ↾fun x ↦ xD).1X:IrreflexiveGraphxD:X.carrierD⊢ (↾Empty.elim, ↾fun x ↦ xD).2 ⊚ D.toTgt = X.toTgt ⊚ (↾Empty.elim, ↾fun x ↦ xD).1 X:IrreflexiveGraphxD:X.carrierD⊢ (↾Empty.elim, ↾fun x ↦ xD).2 ⊚ D.toSrc = X.toSrc ⊚ (↾Empty.elim, ↾fun x ↦ xD).1X:IrreflexiveGraphxD:X.carrierD⊢ (↾Empty.elim, ↾fun x ↦ xD).2 ⊚ D.toTgt = X.toTgt ⊚ (↾Empty.elim, ↾fun x ↦ xD).1 (X:IrreflexiveGraphxD:X.carrierDe:D.carrierA⊢ (ConcreteCategory.hom ((↾Empty.elim, ↾fun x ↦ xD).2 ⊚ D.toTgt)).toFun e = (ConcreteCategory.hom (X.toTgt ⊚ (↾Empty.elim, ↾fun x ↦ xD).1)).toFun e; All goals completed! 🐙) ⟩ left_inv fDX := X:IrreflexiveGraphfDX:D ⟶ X⊢ (fun xD ↦ ⟨(↾Empty.elim, ↾fun x ↦ xD), ⋯⟩) ((fun fDX ↦ (ConcreteCategory.hom (↑fDX).2) ()) fDX) = fDX X:IrreflexiveGraphfDX:D ⟶ X⊢ (↑((fun xD ↦ ⟨(↾Empty.elim, ↾fun x ↦ xD), ⋯⟩) ((fun fDX ↦ (ConcreteCategory.hom (↑fDX).2) ()) fDX))).1 = (↑fDX).1X:IrreflexiveGraphfDX:D ⟶ X⊢ (↑((fun xD ↦ ⟨(↾Empty.elim, ↾fun x ↦ xD), ⋯⟩) ((fun fDX ↦ (ConcreteCategory.hom (↑fDX).2) ()) fDX))).2 = (↑fDX).2 X:IrreflexiveGraphfDX:D ⟶ X⊢ (↑((fun xD ↦ ⟨(↾Empty.elim, ↾fun x ↦ xD), ⋯⟩) ((fun fDX ↦ (ConcreteCategory.hom (↑fDX).2) ()) fDX))).1 = (↑fDX).1 X:IrreflexiveGraphfDX:D ⟶ Xe:D.carrierA⊢ (ConcreteCategory.hom (↑((fun xD ↦ ⟨(↾Empty.elim, ↾fun x ↦ xD), ⋯⟩) ((fun fDX ↦ (ConcreteCategory.hom (↑fDX).2) ()) fDX))).1).toFun e = (ConcreteCategory.hom (↑fDX).1).toFun e; All goals completed! 🐙 X:IrreflexiveGraphfDX:D ⟶ X⊢ (↑((fun xD ↦ ⟨(↾Empty.elim, ↾fun x ↦ xD), ⋯⟩) ((fun fDX ↦ (ConcreteCategory.hom (↑fDX).2) ()) fDX))).2 = (↑fDX).2 X:IrreflexiveGraphfDX:D ⟶ Xx✝:D.carrierD⊢ (ConcreteCategory.hom (↑((fun xD ↦ ⟨(↾Empty.elim, ↾fun x ↦ xD), ⋯⟩) ((fun fDX ↦ (ConcreteCategory.hom (↑fDX).2) ()) fDX))).2).toFun x✝ = (ConcreteCategory.hom (↑fDX).2).toFun x✝; All goals completed! 🐙 right_inv xD := rfl

Our proof then follows.

open IrreflexiveGraph in example (P B₁ B₂ : IrreflexiveGraph) (p₁ : P ⟶ B₁) (p₂ : P ⟶ B₂) -- Satisfies fragment of definition of product for X = A (hA : ∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP : A ⟶ P, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂) -- Satisfies fragment of definition of product for X = D (hD : ∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP : D ⟶ P, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂) : ∀ (X : IrreflexiveGraph) (f₁ : X ⟶ B₁) (f₂ : X ⟶ B₂), ∃! f : X ⟶ P, p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂ := P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂⊢ ∀ (X : IrreflexiveGraph) (f₁ : X ⟶ B₁) (f₂ : X ⟶ B₂), ∃! f, p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂ P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂⊢ ∃! f, p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂ -- For each arrow in X, get equivalent morphism fAX : A ⟶ X P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xA⊢ ∃! f, p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂ -- For each dot in X, get equivalent morphism fDX : D ⟶ X P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xD⊢ ∃! f, p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂ -- Construct fA : X.carrierA ⟶ P.carrierA P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)⊢ ∃! f, p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂ -- Construct fD : X.carrierD ⟶ P.carrierD (cf. fA) P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)⊢ ∃! f, p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂ -- For each arrow in P, get morphism fAP : A ⟶ P P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pA⊢ ∃! f, p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂ -- For each dot in P, get morphism fDP : D ⟶ P P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pD⊢ ∃! f, p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂ -- Show that p₁ ⊚ fAP = f₁ ⊚ fAX ∧ p₂ ⊚ fAP = f₂ ⊚ fAX P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xA⊢ ∃! f, p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂ -- Show that p₁ ⊚ fDP = f₁ ⊚ fDX ∧ p₂ ⊚ fDP = f₂ ⊚ fDX P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xD⊢ ∃! f, p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂ -- Show that P.toSrc ⊚ fA = fD ⊚ X.toSrc P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)⊢ ∃! f, p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂ -- Show that P.toTgt ⊚ fA = fD ⊚ X.toTgt (cf. hSrc_comm) P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)⊢ ∃! f, p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂ -- Bundle fA and fD into morphism f : X ⟶ P P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ ∃! f, p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂ -- Show that f satisfies commutativity and uniqueness conditions P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ (fun f ↦ p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂) f ∧ ∀ (y : X ⟶ P), (fun f ↦ p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂) y → y = f P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ (fun f ↦ p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂) fP:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ ∀ (y : X ⟶ P), (fun f ↦ p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂) y → y = f P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ (fun f ↦ p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂) fP:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ ∀ (y : X ⟶ P), (fun f ↦ p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂) y → y = f P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ ∀ (y : X ⟶ P), p₁ ⊚ y = f₁ ∧ p₂ ⊚ y = f₂ → y = f -- Show that the triangles commute P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂ P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ p₁ ⊚ f = f₁P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ p₂ ⊚ f = f₂ -- Show that p₁ ⊚ f = f₁ P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ p₁ ⊚ f = f₁ P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ (↑(p₁ ⊚ f)).1 = (↑f₁).1P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ (↑(p₁ ⊚ f)).2 = (↑f₁).2 P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ (↑(p₁ ⊚ f)).1 = (↑f₁).1 P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩xA:X.carrierA⊢ (ConcreteCategory.hom (↑(p₁ ⊚ f)).1).toFun xA = (ConcreteCategory.hom (↑f₁).1).toFun xA P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩xA:X.carrierAh:p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA⊢ (ConcreteCategory.hom (↑(p₁ ⊚ f)).1).toFun xA = (ConcreteCategory.hom (↑f₁).1).toFun xA P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩xA:X.carrierAh:(ConcreteCategory.hom (↑(p₁ ⊚ fAP (fA xA))).1) () = (ConcreteCategory.hom (↑(f₁ ⊚ fAX xA)).1) ()⊢ (ConcreteCategory.hom (↑(p₁ ⊚ f)).1).toFun xA = (ConcreteCategory.hom (↑f₁).1).toFun xA All goals completed! 🐙 P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ (↑(p₁ ⊚ f)).2 = (↑f₁).2 P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩xD:X.carrierD⊢ (ConcreteCategory.hom (↑(p₁ ⊚ f)).2).toFun xD = (ConcreteCategory.hom (↑f₁).2).toFun xD P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩xD:X.carrierDh:p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD⊢ (ConcreteCategory.hom (↑(p₁ ⊚ f)).2).toFun xD = (ConcreteCategory.hom (↑f₁).2).toFun xD P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩xD:X.carrierDh:(ConcreteCategory.hom (↑(p₁ ⊚ fDP (fD xD))).2) () = (ConcreteCategory.hom (↑(f₁ ⊚ fDX xD)).2) ()⊢ (ConcreteCategory.hom (↑(p₁ ⊚ f)).2).toFun xD = (ConcreteCategory.hom (↑f₁).2).toFun xD All goals completed! 🐙 -- Show that p₂ ⊚ f = f₂ P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ p₂ ⊚ f = f₂ P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ (↑(p₂ ⊚ f)).1 = (↑f₂).1P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ (↑(p₂ ⊚ f)).2 = (↑f₂).2 P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ (↑(p₂ ⊚ f)).1 = (↑f₂).1 P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩xA:X.carrierA⊢ (ConcreteCategory.hom (↑(p₂ ⊚ f)).1).toFun xA = (ConcreteCategory.hom (↑f₂).1).toFun xA P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩xA:X.carrierAh:p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xA⊢ (ConcreteCategory.hom (↑(p₂ ⊚ f)).1).toFun xA = (ConcreteCategory.hom (↑f₂).1).toFun xA P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩xA:X.carrierAh:(ConcreteCategory.hom (↑(p₂ ⊚ fAP (fA xA))).1) () = (ConcreteCategory.hom (↑(f₂ ⊚ fAX xA)).1) ()⊢ (ConcreteCategory.hom (↑(p₂ ⊚ f)).1).toFun xA = (ConcreteCategory.hom (↑f₂).1).toFun xA All goals completed! 🐙 P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ (↑(p₂ ⊚ f)).2 = (↑f₂).2 P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩xD:X.carrierD⊢ (ConcreteCategory.hom (↑(p₂ ⊚ f)).2).toFun xD = (ConcreteCategory.hom (↑f₂).2).toFun xD P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩xD:X.carrierDh:p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xD⊢ (ConcreteCategory.hom (↑(p₂ ⊚ f)).2).toFun xD = (ConcreteCategory.hom (↑f₂).2).toFun xD P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩xD:X.carrierDh:(ConcreteCategory.hom (↑(p₂ ⊚ fDP (fD xD))).2) () = (ConcreteCategory.hom (↑(f₂ ⊚ fDX xD)).2) ()⊢ (ConcreteCategory.hom (↑(p₂ ⊚ f)).2).toFun xD = (ConcreteCategory.hom (↑f₂).2).toFun xD All goals completed! 🐙 -- Prove uniqueness of f P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩⊢ ∀ (y : X ⟶ P), p₁ ⊚ y = f₁ ∧ p₂ ⊚ y = f₂ → y = f P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂⊢ f' = f P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂⊢ (↑f').1 = (↑f).1P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂⊢ (↑f').2 = (↑f).2 -- Show that arrow maps are equal P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂⊢ (↑f').1 = (↑f).1 P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂xA:X.carrierA⊢ (ConcreteCategory.hom (↑f').1).toFun xA = (ConcreteCategory.hom (↑f).1).toFun xA P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂xA:X.carrierAhp₁:p₁ ⊚ fAP ((ConcreteCategory.hom (↑f').1) xA) = f₁ ⊚ fAX xA⊢ (ConcreteCategory.hom (↑f').1).toFun xA = (ConcreteCategory.hom (↑f).1).toFun xA P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂xA:X.carrierAhp₁:p₁ ⊚ fAP ((ConcreteCategory.hom (↑f').1) xA) = f₁ ⊚ fAX xAhp₂:p₂ ⊚ fAP ((ConcreteCategory.hom (↑f').1) xA) = f₂ ⊚ fAX xA⊢ (ConcreteCategory.hom (↑f').1).toFun xA = (ConcreteCategory.hom (↑f).1).toFun xA P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂xA:X.carrierAhp₁:p₁ ⊚ fAP ((ConcreteCategory.hom (↑f').1) xA) = f₁ ⊚ fAX xAhp₂:p₂ ⊚ fAP ((ConcreteCategory.hom (↑f').1) xA) = f₂ ⊚ fAX xA⊢ (homAEquiv P).symm ((ConcreteCategory.hom (↑f').1).toFun xA) = (homAEquiv P).symm ((ConcreteCategory.hom (↑f).1).toFun xA) P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂xA:X.carrierAhp₁:p₁ ⊚ fAP ((ConcreteCategory.hom (↑f').1) xA) = f₁ ⊚ fAX xAhp₂:p₂ ⊚ fAP ((ConcreteCategory.hom (↑f').1) xA) = f₂ ⊚ fAX xA⊢ fAP ((ConcreteCategory.hom (↑f').1) xA) = fAP (fA xA) P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂xA:X.carrierAhp₁:p₁ ⊚ fAP ((ConcreteCategory.hom (↑f').1) xA) = f₁ ⊚ fAX xAhp₂:p₂ ⊚ fAP ((ConcreteCategory.hom (↑f').1) xA) = f₂ ⊚ fAX xAh_uniq:∀ (y : A ⟶ P), (fun fAP ↦ p₁ ⊚ fAP = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP = f₂ ⊚ fAX xA) y → y = Classical.choose ⋯⊢ fAP ((ConcreteCategory.hom (↑f').1) xA) = fAP (fA xA) P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂xA:X.carrierAhp₁:p₁ ⊚ fAP ((ConcreteCategory.hom (↑f').1) xA) = f₁ ⊚ fAX xAhp₂:p₂ ⊚ fAP ((ConcreteCategory.hom (↑f').1) xA) = f₂ ⊚ fAX xAh_uniq:∀ (y : A ⟶ P), (fun fAP ↦ p₁ ⊚ fAP = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP = f₂ ⊚ fAX xA) y → y = Classical.choose ⋯h_left:fAP ((ConcreteCategory.hom (↑f').1) xA) = Classical.choose ⋯⊢ fAP ((ConcreteCategory.hom (↑f').1) xA) = fAP (fA xA) P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂xA:X.carrierAhp₁:p₁ ⊚ fAP ((ConcreteCategory.hom (↑f').1) xA) = f₁ ⊚ fAX xAhp₂:p₂ ⊚ fAP ((ConcreteCategory.hom (↑f').1) xA) = f₂ ⊚ fAX xAh_uniq:∀ (y : A ⟶ P), (fun fAP ↦ p₁ ⊚ fAP = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP = f₂ ⊚ fAX xA) y → y = Classical.choose ⋯h_left:fAP ((ConcreteCategory.hom (↑f').1) xA) = Classical.choose ⋯h_right:fAP (fA xA) = Classical.choose ⋯⊢ fAP ((ConcreteCategory.hom (↑f').1) xA) = fAP (fA xA) All goals completed! 🐙 -- Show dot maps are equal P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂⊢ (↑f').2 = (↑f).2 P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂xD:X.carrierD⊢ (ConcreteCategory.hom (↑f').2).toFun xD = (ConcreteCategory.hom (↑f).2).toFun xD P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂xD:X.carrierDhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom (↑f').2) xD) = f₁ ⊚ fDX xD⊢ (ConcreteCategory.hom (↑f').2).toFun xD = (ConcreteCategory.hom (↑f).2).toFun xD P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂xD:X.carrierDhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom (↑f').2) xD) = f₁ ⊚ fDX xDhp₂:p₂ ⊚ fDP ((ConcreteCategory.hom (↑f').2) xD) = f₂ ⊚ fDX xD⊢ (ConcreteCategory.hom (↑f').2).toFun xD = (ConcreteCategory.hom (↑f).2).toFun xD P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂xD:X.carrierDhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom (↑f').2) xD) = f₁ ⊚ fDX xDhp₂:p₂ ⊚ fDP ((ConcreteCategory.hom (↑f').2) xD) = f₂ ⊚ fDX xD⊢ (homDEquiv P).symm ((ConcreteCategory.hom (↑f').2).toFun xD) = (homDEquiv P).symm ((ConcreteCategory.hom (↑f).2).toFun xD) P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂xD:X.carrierDhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom (↑f').2) xD) = f₁ ⊚ fDX xDhp₂:p₂ ⊚ fDP ((ConcreteCategory.hom (↑f').2) xD) = f₂ ⊚ fDX xD⊢ fDP ((ConcreteCategory.hom (↑f').2) xD) = fDP (fD xD) P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂xD:X.carrierDhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom (↑f').2) xD) = f₁ ⊚ fDX xDhp₂:p₂ ⊚ fDP ((ConcreteCategory.hom (↑f').2) xD) = f₂ ⊚ fDX xDh_uniq:∀ (y : D ⟶ P), (fun fDP ↦ p₁ ⊚ fDP = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP = f₂ ⊚ fDX xD) y → y = Classical.choose ⋯⊢ fDP ((ConcreteCategory.hom (↑f').2) xD) = fDP (fD xD) P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂xD:X.carrierDhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom (↑f').2) xD) = f₁ ⊚ fDX xDhp₂:p₂ ⊚ fDP ((ConcreteCategory.hom (↑f').2) xD) = f₂ ⊚ fDX xDh_uniq:∀ (y : D ⟶ P), (fun fDP ↦ p₁ ⊚ fDP = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP = f₂ ⊚ fDX xD) y → y = Classical.choose ⋯h_left:fDP ((ConcreteCategory.hom (↑f').2) xD) = Classical.choose ⋯⊢ fDP ((ConcreteCategory.hom (↑f').2) xD) = fDP (fD xD) P:IrreflexiveGraphB₁:IrreflexiveGraphB₂:IrreflexiveGraphp₁:P ⟶ B₁p₂:P ⟶ B₂hA:∀ (fAP₁ : A ⟶ B₁) (fAP₂ : A ⟶ B₂), ∃! fAP, p₁ ⊚ fAP = fAP₁ ∧ p₂ ⊚ fAP = fAP₂hD:∀ (fDP₁ : D ⟶ B₁) (fDP₂ : D ⟶ B₂), ∃! fDP, p₁ ⊚ fDP = fDP₁ ∧ p₂ ⊚ fDP = fDP₂X:IrreflexiveGraphf₁:X ⟶ B₁f₂:X ⟶ B₂fAX:X.carrierA → (A ⟶ X) := fun xA ↦ (homAEquiv X).symm xAfDX:X.carrierD → (D ⟶ X) := fun xD ↦ (homDEquiv X).symm xDfA:X.carrierA → P.carrierA := fun xA ↦ let h_uniq := ⋯; (homAEquiv P) (Classical.choose h_uniq)fD:X.carrierD → P.carrierD := fun xD ↦ let h_uniq := ⋯; (homDEquiv P) (Classical.choose h_uniq)fAP:P.carrierA → (A ⟶ P) := fun pA ↦ (homAEquiv P).symm pAfDP:P.carrierD → (D ⟶ P) := fun pD ↦ (homDEquiv P).symm pDhA_proj:∀ (xA : X.carrierA), p₁ ⊚ fAP (fA xA) = f₁ ⊚ fAX xA ∧ p₂ ⊚ fAP (fA xA) = f₂ ⊚ fAX xAhD_proj:∀ (xD : X.carrierD), p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xDhSrc_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)hTgt_comm:∀ (xA : X.carrierA), (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)f:X ⟶ P := ⟨(↾fA, ↾fD), ⋯⟩f':X ⟶ Phf'₁:p₁ ⊚ f' = f₁hf'₂:p₂ ⊚ f' = f₂xD:X.carrierDhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom (↑f').2) xD) = f₁ ⊚ fDX xDhp₂:p₂ ⊚ fDP ((ConcreteCategory.hom (↑f').2) xD) = f₂ ⊚ fDX xDh_uniq:∀ (y : D ⟶ P), (fun fDP ↦ p₁ ⊚ fDP = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP = f₂ ⊚ fDX xD) y → y = Classical.choose ⋯h_left:fDP ((ConcreteCategory.hom (↑f').2) xD) = Classical.choose ⋯h_right:fDP (fD xD) = Classical.choose ⋯⊢ fDP ((ConcreteCategory.hom (↑f').2) xD) = fDP (fD xD) All goals completed! 🐙
Exercise 2 (p. 252)

What is a figure of shape

abbrev A₂ : IrreflexiveGraph := { carrierA := Fin 2 carrierD := Fin 3 toSrc := ↾fun | 0 => 0 | 1 => 1 toTgt := ↾fun | 0 => 1 | 1 => 2 }

in a graph X? What are the various ways in which it can be singular?

Solution: Exercise 2

A figure of shape A_2 in a graph X is a morphism {A_2 \xrightarrow{f} X} that maps the two arrows of A_2 to two arrows (not necessarily distinct) in X and the three dots of A_2 to three dots (not necessarily distinct) in X in such a way as to preserve sources and targets.

def FigA₂ (X : IrreflexiveGraph) := A₂ ⟶ X

The figure is singular if the two arrows of A_2 are mapped to the same arrow in X or if any two of the three dots of A_2 are mapped to the same dot in X—that is, if the morphism f fails to be injective on either the arrows or the dots.

def FigA₂.IsSingular {X : IrreflexiveGraph} (f : FigA₂ X) : Prop := ¬(Function.Injective f.val.1 ∧ Function.Injective f.val.2)

Specifically, the figure is singular if any of the following conditions hold:

(1) the two arrows of A_2 are mapped to the same arrow in X

example {X : IrreflexiveGraph} (f : FigA₂ X) (h : f.val.1 0 = f.val.1 1) : f.IsSingular := X:IrreflexiveGraphf:FigA₂ Xh:(ConcreteCategory.hom (↑f).1) 0 = (ConcreteCategory.hom (↑f).1) 1⊢ f.IsSingular X:IrreflexiveGraphf:FigA₂ Xh:(ConcreteCategory.hom (↑f).1) 0 = (ConcreteCategory.hom (↑f).1) 1hA:Function.Injective ⇑(ConcreteCategory.hom (↑f).1)right✝:Function.Injective ⇑(ConcreteCategory.hom (↑f).2)⊢ False exact absurd (hA h) (X:IrreflexiveGraphf:FigA₂ Xh:(ConcreteCategory.hom (↑f).1) 0 = (ConcreteCategory.hom (↑f).1) 1hA:Function.Injective ⇑(ConcreteCategory.hom (↑f).1)right✝:Function.Injective ⇑(ConcreteCategory.hom (↑f).2)⊢ ¬0 = 1 All goals completed! 🐙)

(2) the first and second dots of A_2 are mapped to the same dot in X

example {X : IrreflexiveGraph} (f : FigA₂ X) (h : f.val.2 0 = f.val.2 1) : f.IsSingular := X:IrreflexiveGraphf:FigA₂ Xh:(ConcreteCategory.hom (↑f).2) 0 = (ConcreteCategory.hom (↑f).2) 1⊢ f.IsSingular X:IrreflexiveGraphf:FigA₂ Xh:(ConcreteCategory.hom (↑f).2) 0 = (ConcreteCategory.hom (↑f).2) 1left✝:Function.Injective ⇑(ConcreteCategory.hom (↑f).1)hD:Function.Injective ⇑(ConcreteCategory.hom (↑f).2)⊢ False exact absurd (hD h) (X:IrreflexiveGraphf:FigA₂ Xh:(ConcreteCategory.hom (↑f).2) 0 = (ConcreteCategory.hom (↑f).2) 1left✝:Function.Injective ⇑(ConcreteCategory.hom (↑f).1)hD:Function.Injective ⇑(ConcreteCategory.hom (↑f).2)⊢ ¬0 = 1 All goals completed! 🐙)

(3) the first and third dots of A_2 are mapped to the same dot in X

example {X : IrreflexiveGraph} (f : FigA₂ X) (h : f.val.2 0 = f.val.2 2) : f.IsSingular := X:IrreflexiveGraphf:FigA₂ Xh:(ConcreteCategory.hom (↑f).2) 0 = (ConcreteCategory.hom (↑f).2) 2⊢ f.IsSingular X:IrreflexiveGraphf:FigA₂ Xh:(ConcreteCategory.hom (↑f).2) 0 = (ConcreteCategory.hom (↑f).2) 2left✝:Function.Injective ⇑(ConcreteCategory.hom (↑f).1)hD:Function.Injective ⇑(ConcreteCategory.hom (↑f).2)⊢ False exact absurd (hD h) (X:IrreflexiveGraphf:FigA₂ Xh:(ConcreteCategory.hom (↑f).2) 0 = (ConcreteCategory.hom (↑f).2) 2left✝:Function.Injective ⇑(ConcreteCategory.hom (↑f).1)hD:Function.Injective ⇑(ConcreteCategory.hom (↑f).2)⊢ ¬0 = 2 All goals completed! 🐙)

(4) the second and third dots of A_2 are mapped to the same dot in X

example {X : IrreflexiveGraph} (f : FigA₂ X) (h : f.val.2 1 = f.val.2 2) : f.IsSingular := X:IrreflexiveGraphf:FigA₂ Xh:(ConcreteCategory.hom (↑f).2) 1 = (ConcreteCategory.hom (↑f).2) 2⊢ f.IsSingular X:IrreflexiveGraphf:FigA₂ Xh:(ConcreteCategory.hom (↑f).2) 1 = (ConcreteCategory.hom (↑f).2) 2left✝:Function.Injective ⇑(ConcreteCategory.hom (↑f).1)hD:Function.Injective ⇑(ConcreteCategory.hom (↑f).2)⊢ False exact absurd (hD h) (X:IrreflexiveGraphf:FigA₂ Xh:(ConcreteCategory.hom (↑f).2) 1 = (ConcreteCategory.hom (↑f).2) 2left✝:Function.Injective ⇑(ConcreteCategory.hom (↑f).1)hD:Function.Injective ⇑(ConcreteCategory.hom (↑f).2)⊢ ¬1 = 2 All goals completed! 🐙)

The case in which all three dots of A_2 are mapped to the same dot in X is covered by any of conditions (2), (3), or (4), since if all three dots are mapped to the same dot, then in particular any two dots are mapped to the same dot.