Session 22: Universal mapping properties; Incidence relations
4. Basic figure-types, singular figures, and incidence, in the category of graphs
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
have hD_proj : ∀ xD : X.carrierD,
p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧
p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xD := by 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₂
intro 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 xAxD:X.carrierD⊢ p₁ ⊚ fDP (fD xD) = f₁ ⊚ fDX xD ∧ p₂ ⊚ fDP (fD xD) = f₂ ⊚ fDX xD
dsimp [fDX, fDP] 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 xAxD:X.carrierD⊢ p₁ ⊚ (homDEquiv P).symm (fD xD) = f₁ ⊚ (homDEquiv X).symm xD ∧
p₂ ⊚ (homDEquiv P).symm (fD xD) = f₂ ⊚ (homDEquiv X).symm xD
rw [Equiv.symm_apply_apply 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 xAxD:X.carrierD⊢ p₁ ⊚ Classical.choose ⋯ = f₁ ⊚ (homDEquiv X).symm xD ∧ p₂ ⊚ Classical.choose ⋯ = f₂ ⊚ (homDEquiv X).symm 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 xAxD:X.carrierD⊢ p₁ ⊚ Classical.choose ⋯ = f₁ ⊚ (homDEquiv X).symm xD ∧ p₂ ⊚ Classical.choose ⋯ = f₂ ⊚ (homDEquiv X).symm xD
exact (Classical.choose_spec (hD _ _)).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 xD⊢ ∃! f, p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂
-- Show that P.toSrc ⊚ fA = fD ⊚ X.toSrc
have hSrc_comm :
∀ xA : X.carrierA, P.toSrc (fA xA) = fD (X.toSrc xA) := by 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₂
intro 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 xDxA:X.carrierA⊢ (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)
-- Show that p₁ ⊚ fDP = f₁ ⊚ fDX
have hp₁ : p₁ ⊚ fDP (P.toSrc (fA xA)) =
f₁ ⊚ fDX (X.toSrc xA) := by 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₂
-- Transform goal from map equality to dot equality
apply (homDEquiv B₁).injective 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 xDxA:X.carrierA⊢ (homDEquiv B₁) (p₁ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA))) =
(homDEquiv B₁) (f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA))
calc (p₁.val.2 ⊚ P.toSrc) (fA xA)
_ = (B₁.toSrc ⊚ p₁.val.1) (fA xA) := by 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 xDxA:X.carrierA⊢ (ConcreteCategory.hom ((↑p₁).2 ⊚ P.toSrc)) (fA xA) = (ConcreteCategory.hom (B₁.toSrc ⊚ (↑p₁).1)) (fA xA)
rw [p₁.property.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 xDxA:X.carrierA⊢ (ConcreteCategory.hom (B₁.toSrc ⊚ (↑p₁).1)) (fA xA) = (ConcreteCategory.hom (B₁.toSrc ⊚ (↑p₁).1)) (fA xA)] All goals completed! 🐙
_ = B₁.toSrc ((p₁ ⊚ fAP (fA xA)).val.1 ()) := rfl
_ = B₁.toSrc ((f₁ ⊚ fAX xA).val.1 ()) := by 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 xDxA:X.carrierA⊢ (ConcreteCategory.hom B₁.toSrc) ((ConcreteCategory.hom (↑(p₁ ⊚ fAP (fA xA))).1) ()) =
(ConcreteCategory.hom B₁.toSrc) ((ConcreteCategory.hom (↑(f₁ ⊚ fAX xA)).1) ())
rw [(hA_proj xA).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 xDxA:X.carrierA⊢ (ConcreteCategory.hom B₁.toSrc) ((ConcreteCategory.hom (↑(f₁ ⊚ fAX xA)).1) ()) =
(ConcreteCategory.hom B₁.toSrc) ((ConcreteCategory.hom (↑(f₁ ⊚ fAX xA)).1) ())] All goals completed! 🐙
_ = (B₁.toSrc ⊚ f₁.val.1) xA := rfl
_ = (f₁.val.2 ⊚ X.toSrc) xA := by 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 xDxA:X.carrierA⊢ (ConcreteCategory.hom (B₁.toSrc ⊚ (↑f₁).1)) xA = (ConcreteCategory.hom ((↑f₁).2 ⊚ X.toSrc)) xA
rw [f₁.property.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 xDxA:X.carrierA⊢ (ConcreteCategory.hom (B₁.toSrc ⊚ (↑f₁).1)) xA = (ConcreteCategory.hom (B₁.toSrc ⊚ (↑f₁).1)) 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 xDxA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)⊢ (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)
-- Show that p₂ ⊚ fDP = f₂ ⊚ fDX
have hp₂ : p₂ ⊚ fDP (P.toSrc (fA xA)) =
f₂ ⊚ fDX (X.toSrc xA) := by 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₂
-- Transform goal from map equality to dot equality
apply (homDEquiv B₂).injective 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 xDxA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)⊢ (homDEquiv B₂) (p₂ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA))) =
(homDEquiv B₂) (f₂ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA))
calc (p₂.val.2 ⊚ P.toSrc) (fA xA)
_ = (B₂.toSrc ⊚ p₂.val.1) (fA xA) := by 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 xDxA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)⊢ (ConcreteCategory.hom ((↑p₂).2 ⊚ P.toSrc)) (fA xA) = (ConcreteCategory.hom (B₂.toSrc ⊚ (↑p₂).1)) (fA xA)
rw [p₂.property.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 xDxA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)⊢ (ConcreteCategory.hom (B₂.toSrc ⊚ (↑p₂).1)) (fA xA) = (ConcreteCategory.hom (B₂.toSrc ⊚ (↑p₂).1)) (fA xA)] All goals completed! 🐙
_ = B₂.toSrc ((p₂ ⊚ fAP (fA xA)).val.1 ()) := rfl
_ = B₂.toSrc ((f₂ ⊚ fAX xA).val.1 ()) := by 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 xDxA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)⊢ (ConcreteCategory.hom B₂.toSrc) ((ConcreteCategory.hom (↑(p₂ ⊚ fAP (fA xA))).1) ()) =
(ConcreteCategory.hom B₂.toSrc) ((ConcreteCategory.hom (↑(f₂ ⊚ fAX xA)).1) ())
rw [(hA_proj xA).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 xDxA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)⊢ (ConcreteCategory.hom B₂.toSrc) ((ConcreteCategory.hom (↑(f₂ ⊚ fAX xA)).1) ()) =
(ConcreteCategory.hom B₂.toSrc) ((ConcreteCategory.hom (↑(f₂ ⊚ fAX xA)).1) ())] All goals completed! 🐙
_ = (B₂.toSrc ⊚ f₂.val.1) xA := rfl
_ = (f₂.val.2 ⊚ X.toSrc) xA := by 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 xDxA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)⊢ (ConcreteCategory.hom (B₂.toSrc ⊚ (↑f₂).1)) xA = (ConcreteCategory.hom ((↑f₂).2 ⊚ X.toSrc)) xA
rw [f₂.property.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 xDxA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)⊢ (ConcreteCategory.hom (B₂.toSrc ⊚ (↑f₂).1)) xA = (ConcreteCategory.hom (B₂.toSrc ⊚ (↑f₂).1)) 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 xDxA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)hp₂:p₂ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₂ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)⊢ (ConcreteCategory.hom P.toSrc) (fA xA) = fD ((ConcreteCategory.hom X.toSrc) xA)
-- Transform goal from dot equality to map equality
apply (homDEquiv P).symm.injective 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 xDxA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)hp₂:p₂ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₂ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)⊢ (homDEquiv P).symm ((ConcreteCategory.hom P.toSrc) (fA xA)) =
(homDEquiv P).symm (fD ((ConcreteCategory.hom X.toSrc) xA))
change fDP (P.toSrc (fA xA)) = fDP (fD (X.toSrc 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 xDxA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)hp₂:p₂ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₂ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)⊢ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = fDP (fD ((ConcreteCategory.hom X.toSrc) xA))
-- Get unique witness for D ⟶ P
have h_uniq := (Classical.choose_spec (hD (f₁ ⊚ fDX (X.toSrc xA))
(f₂ ⊚ fDX (X.toSrc xA)))).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 xDxA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)hp₂:p₂ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₂ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)h_uniq:∀ (y : D ⟶ P),
(fun fDP ↦
p₁ ⊚ fDP = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA) ∧
p₂ ⊚ fDP = f₂ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA))
y →
y = Classical.choose ⋯⊢ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = fDP (fD ((ConcreteCategory.hom X.toSrc) xA))
-- Show that lhs and rhs both equal unique witness
have h_left := h_uniq (fDP (P.toSrc (fA xA))) ⟨hp₁, hp₂⟩ 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 xDxA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)hp₂:p₂ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₂ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)h_uniq:∀ (y : D ⟶ P),
(fun fDP ↦
p₁ ⊚ fDP = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA) ∧
p₂ ⊚ fDP = f₂ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA))
y →
y = Classical.choose ⋯h_left:fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = Classical.choose ⋯⊢ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = fDP (fD ((ConcreteCategory.hom X.toSrc) xA))
have h_right := h_uniq (fDP (fD (X.toSrc xA)))
(hD_proj (X.toSrc 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 xDxA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)hp₂:p₂ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₂ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)h_uniq:∀ (y : D ⟶ P),
(fun fDP ↦
p₁ ⊚ fDP = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA) ∧
p₂ ⊚ fDP = f₂ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA))
y →
y = Classical.choose ⋯h_left:fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = Classical.choose ⋯h_right:fDP (fD ((ConcreteCategory.hom X.toSrc) xA)) = Classical.choose ⋯⊢ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = fDP (fD ((ConcreteCategory.hom X.toSrc) xA))
rw [h_left, 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 xDxA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)hp₂:p₂ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₂ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)h_uniq:∀ (y : D ⟶ P),
(fun fDP ↦
p₁ ⊚ fDP = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA) ∧
p₂ ⊚ fDP = f₂ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA))
y →
y = Classical.choose ⋯h_left:fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = Classical.choose ⋯h_right:fDP (fD ((ConcreteCategory.hom X.toSrc) xA)) = Classical.choose ⋯⊢ Classical.choose ⋯ = fDP (fD ((ConcreteCategory.hom X.toSrc) xA)) h_right 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 xDxA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)hp₂:p₂ ⊚ fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = f₂ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA)h_uniq:∀ (y : D ⟶ P),
(fun fDP ↦
p₁ ⊚ fDP = f₁ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA) ∧
p₂ ⊚ fDP = f₂ ⊚ fDX ((ConcreteCategory.hom X.toSrc) xA))
y →
y = Classical.choose ⋯h_left:fDP ((ConcreteCategory.hom P.toSrc) (fA xA)) = Classical.choose ⋯h_right:fDP (fD ((ConcreteCategory.hom X.toSrc) xA)) = Classical.choose ⋯⊢ Classical.choose ⋯ = Classical.choose ⋯] 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)
have hTgt_comm :
∀ xA : X.carrierA, P.toTgt (fA xA) = fD (X.toTgt xA) := by 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₂
intro 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)xA:X.carrierA⊢ (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)
have hp₁ : p₁ ⊚ fDP (P.toTgt (fA xA)) =
f₁ ⊚ fDX (X.toTgt xA) := by 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₂
apply (homDEquiv B₁).injective 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)xA:X.carrierA⊢ (homDEquiv B₁) (p₁ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA))) =
(homDEquiv B₁) (f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA))
calc (p₁.val.2 ⊚ P.toTgt) (fA xA)
_ = (B₁.toTgt ⊚ p₁.val.1) (fA xA) := by 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)xA:X.carrierA⊢ (ConcreteCategory.hom ((↑p₁).2 ⊚ P.toTgt)) (fA xA) = (ConcreteCategory.hom (B₁.toTgt ⊚ (↑p₁).1)) (fA xA)
rw [p₁.property.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)xA:X.carrierA⊢ (ConcreteCategory.hom (B₁.toTgt ⊚ (↑p₁).1)) (fA xA) = (ConcreteCategory.hom (B₁.toTgt ⊚ (↑p₁).1)) (fA xA)] All goals completed! 🐙
_ = B₁.toTgt ((p₁ ⊚ fAP (fA xA)).val.1 ()) := rfl
_ = B₁.toTgt ((f₁ ⊚ fAX xA).val.1 ()) := by 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)xA:X.carrierA⊢ (ConcreteCategory.hom B₁.toTgt) ((ConcreteCategory.hom (↑(p₁ ⊚ fAP (fA xA))).1) ()) =
(ConcreteCategory.hom B₁.toTgt) ((ConcreteCategory.hom (↑(f₁ ⊚ fAX xA)).1) ())
rw [(hA_proj xA).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)xA:X.carrierA⊢ (ConcreteCategory.hom B₁.toTgt) ((ConcreteCategory.hom (↑(f₁ ⊚ fAX xA)).1) ()) =
(ConcreteCategory.hom B₁.toTgt) ((ConcreteCategory.hom (↑(f₁ ⊚ fAX xA)).1) ())] All goals completed! 🐙
_ = (B₁.toTgt ⊚ f₁.val.1) xA := rfl
_ = (f₁.val.2 ⊚ X.toTgt) xA := by 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)xA:X.carrierA⊢ (ConcreteCategory.hom (B₁.toTgt ⊚ (↑f₁).1)) xA = (ConcreteCategory.hom ((↑f₁).2 ⊚ X.toTgt)) xA
rw [f₁.property.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)xA:X.carrierA⊢ (ConcreteCategory.hom (B₁.toTgt ⊚ (↑f₁).1)) xA = (ConcreteCategory.hom (B₁.toTgt ⊚ (↑f₁).1)) 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)xA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)⊢ (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)
have hp₂ : p₂ ⊚ fDP (P.toTgt (fA xA)) =
f₂ ⊚ fDX (X.toTgt xA) := by 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₂
apply (homDEquiv B₂).injective 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)xA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)⊢ (homDEquiv B₂) (p₂ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA))) =
(homDEquiv B₂) (f₂ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA))
calc (p₂.val.2 ⊚ P.toTgt) (fA xA)
_ = (B₂.toTgt ⊚ p₂.val.1) (fA xA) := by 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)xA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)⊢ (ConcreteCategory.hom ((↑p₂).2 ⊚ P.toTgt)) (fA xA) = (ConcreteCategory.hom (B₂.toTgt ⊚ (↑p₂).1)) (fA xA)
rw [p₂.property.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)xA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)⊢ (ConcreteCategory.hom (B₂.toTgt ⊚ (↑p₂).1)) (fA xA) = (ConcreteCategory.hom (B₂.toTgt ⊚ (↑p₂).1)) (fA xA)] All goals completed! 🐙
_ = B₂.toTgt ((p₂ ⊚ fAP (fA xA)).val.1 ()) := rfl
_ = B₂.toTgt ((f₂ ⊚ fAX xA).val.1 ()) := by 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)xA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)⊢ (ConcreteCategory.hom B₂.toTgt) ((ConcreteCategory.hom (↑(p₂ ⊚ fAP (fA xA))).1) ()) =
(ConcreteCategory.hom B₂.toTgt) ((ConcreteCategory.hom (↑(f₂ ⊚ fAX xA)).1) ())
rw [(hA_proj xA).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)xA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)⊢ (ConcreteCategory.hom B₂.toTgt) ((ConcreteCategory.hom (↑(f₂ ⊚ fAX xA)).1) ()) =
(ConcreteCategory.hom B₂.toTgt) ((ConcreteCategory.hom (↑(f₂ ⊚ fAX xA)).1) ())] All goals completed! 🐙
_ = (B₂.toTgt ⊚ f₂.val.1) xA := rfl
_ = (f₂.val.2 ⊚ X.toTgt) xA := by 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)xA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)⊢ (ConcreteCategory.hom (B₂.toTgt ⊚ (↑f₂).1)) xA = (ConcreteCategory.hom ((↑f₂).2 ⊚ X.toTgt)) xA
rw [f₂.property.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)xA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)⊢ (ConcreteCategory.hom (B₂.toTgt ⊚ (↑f₂).1)) xA = (ConcreteCategory.hom (B₂.toTgt ⊚ (↑f₂).1)) 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)xA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)hp₂:p₂ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₂ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)⊢ (ConcreteCategory.hom P.toTgt) (fA xA) = fD ((ConcreteCategory.hom X.toTgt) xA)
apply (homDEquiv P).symm.injective 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)xA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)hp₂:p₂ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₂ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)⊢ (homDEquiv P).symm ((ConcreteCategory.hom P.toTgt) (fA xA)) =
(homDEquiv P).symm (fD ((ConcreteCategory.hom X.toTgt) xA))
change fDP (P.toTgt (fA xA)) = fDP (fD (X.toTgt 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)xA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)hp₂:p₂ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₂ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)⊢ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = fDP (fD ((ConcreteCategory.hom X.toTgt) xA))
have h_uniq := (Classical.choose_spec (hD (f₁ ⊚ fDX (X.toTgt xA))
(f₂ ⊚ fDX (X.toTgt xA)))).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)xA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)hp₂:p₂ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₂ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)h_uniq:∀ (y : D ⟶ P),
(fun fDP ↦
p₁ ⊚ fDP = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA) ∧
p₂ ⊚ fDP = f₂ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA))
y →
y = Classical.choose ⋯⊢ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = fDP (fD ((ConcreteCategory.hom X.toTgt) xA))
have h_left := h_uniq (fDP (P.toTgt (fA xA))) ⟨hp₁, hp₂⟩ 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)xA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)hp₂:p₂ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₂ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)h_uniq:∀ (y : D ⟶ P),
(fun fDP ↦
p₁ ⊚ fDP = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA) ∧
p₂ ⊚ fDP = f₂ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA))
y →
y = Classical.choose ⋯h_left:fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = Classical.choose ⋯⊢ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = fDP (fD ((ConcreteCategory.hom X.toTgt) xA))
have h_right := h_uniq (fDP (fD (X.toTgt xA)))
(hD_proj (X.toTgt 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)xA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)hp₂:p₂ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₂ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)h_uniq:∀ (y : D ⟶ P),
(fun fDP ↦
p₁ ⊚ fDP = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA) ∧
p₂ ⊚ fDP = f₂ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA))
y →
y = Classical.choose ⋯h_left:fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = Classical.choose ⋯h_right:fDP (fD ((ConcreteCategory.hom X.toTgt) xA)) = Classical.choose ⋯⊢ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = fDP (fD ((ConcreteCategory.hom X.toTgt) xA))
rw [h_left, 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)xA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)hp₂:p₂ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₂ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)h_uniq:∀ (y : D ⟶ P),
(fun fDP ↦
p₁ ⊚ fDP = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA) ∧
p₂ ⊚ fDP = f₂ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA))
y →
y = Classical.choose ⋯h_left:fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = Classical.choose ⋯h_right:fDP (fD ((ConcreteCategory.hom X.toTgt) xA)) = Classical.choose ⋯⊢ Classical.choose ⋯ = fDP (fD ((ConcreteCategory.hom X.toTgt) xA)) h_right 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)xA:X.carrierAhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)hp₂:p₂ ⊚ fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = f₂ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA)h_uniq:∀ (y : D ⟶ P),
(fun fDP ↦
p₁ ⊚ fDP = f₁ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA) ∧
p₂ ⊚ fDP = f₂ ⊚ fDX ((ConcreteCategory.hom X.toTgt) xA))
y →
y = Classical.choose ⋯h_left:fDP ((ConcreteCategory.hom P.toTgt) (fA xA)) = Classical.choose ⋯h_right:fDP (fD ((ConcreteCategory.hom X.toTgt) xA)) = Classical.choose ⋯⊢ Classical.choose ⋯ = Classical.choose ⋯] 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
let f : X ⟶ P := ⟨
(↾fA, ↾fD),
by 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)⊢ (↾fA, ↾fD).2 ⊚ X.toSrc = P.toSrc ⊚ (↾fA, ↾fD).1 ∧ (↾fA, ↾fD).2 ⊚ X.toTgt = P.toTgt ⊚ (↾fA, ↾fD).1
constructor left 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)⊢ (↾fA, ↾fD).2 ⊚ X.toSrc = P.toSrc ⊚ (↾fA, ↾fD).1right 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)⊢ (↾fA, ↾fD).2 ⊚ X.toTgt = P.toTgt ⊚ (↾fA, ↾fD).1 <;> left 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)⊢ (↾fA, ↾fD).2 ⊚ X.toSrc = P.toSrc ⊚ (↾fA, ↾fD).1right 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)⊢ (↾fA, ↾fD).2 ⊚ X.toTgt = P.toTgt ⊚ (↾fA, ↾fD).1 ext x right 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)x:X.carrierA⊢ (ConcreteCategory.hom ((↾fA, ↾fD).2 ⊚ X.toTgt)).toFun x = (ConcreteCategory.hom (P.toTgt ⊚ (↾fA, ↾fD).1)).toFun x
· left 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)x:X.carrierA⊢ (ConcreteCategory.hom ((↾fA, ↾fD).2 ⊚ X.toSrc)).toFun x = (ConcreteCategory.hom (P.toSrc ⊚ (↾fA, ↾fD).1)).toFun x exact (hSrc_comm x).symm All goals completed! 🐙
· right 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)x:X.carrierA⊢ (ConcreteCategory.hom ((↾fA, ↾fD).2 ⊚ X.toTgt)).toFun x = (ConcreteCategory.hom (P.toTgt ⊚ (↾fA, ↾fD).1)).toFun x exact (hTgt_comm x).symm 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), ⋯⟩⊢ ∃! f, p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂
-- Show that f satisfies commutativity and uniqueness conditions
use f h 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
constructor h.left 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₂) fh.right 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), (fun f ↦ p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂) y → y = f <;> h.left 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₂) fh.right 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), (fun f ↦ p₁ ⊚ f = f₁ ∧ p₂ ⊚ f = f₂) y → y = f dsimp h.right 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
· h.left 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₂ constructor h.left.left 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₁h.left.right 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₁
· h.left.left 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₁ apply IrreflexiveGraph.hom_ext h.left.left.hA 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₁).1h.left.left.hD 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
· h.left.left.hA 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 ext xA h.left.left.hA 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
have h := (hA_proj xA).1 h.left.left.hA 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
apply_fun (fun k => k.val.1 ()) at h h.left.left.hA 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
exact h All goals completed! 🐙
· h.left.left.hD 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 ext xD h.left.left.hD 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
have h := (hD_proj xD).1 h.left.left.hD 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
apply_fun (fun k => k.val.2 ()) at h h.left.left.hD 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
exact h All goals completed! 🐙
-- Show that p₂ ⊚ f = f₂
· h.left.right 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₂ apply IrreflexiveGraph.hom_ext h.left.right.hA 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₂).1h.left.right.hD 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
· h.left.right.hA 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 ext xA h.left.right.hA 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
have h := (hA_proj xA).2 h.left.right.hA 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
apply_fun (fun k => k.val.1 ()) at h h.left.right.hA 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
exact h All goals completed! 🐙
· h.left.right.hD 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 ext xD h.left.right.hD 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
have h := (hD_proj xD).2 h.left.right.hD 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
apply_fun (fun k => k.val.2 ()) at h h.left.right.hD 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
exact h All goals completed! 🐙
-- Prove uniqueness of f
· h.right 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 intro f' ⟨hf'₁, hf'₂⟩ h.right 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
apply IrreflexiveGraph.hom_ext h.right.hA 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).1h.right.hD 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
-- Show that arrow maps are equal
· h.right.hA 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 ext xA h.right.hA 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
have hp₁ : p₁ ⊚ fAP (f'.val.1 xA) = f₁ ⊚ fAX xA := by 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₂
apply (homAEquiv B₁).injective 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⊢ (homAEquiv B₁) (p₁ ⊚ fAP ((ConcreteCategory.hom (↑f').1) xA)) = (homAEquiv B₁) (f₁ ⊚ fAX xA)
apply_fun (fun k => k.val.1 xA) at hf'₁ 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₂xA:X.carrierAhf'₁:(ConcreteCategory.hom (↑(p₁ ⊚ f')).1) xA = (ConcreteCategory.hom (↑f₁).1) xA⊢ (homAEquiv B₁) (p₁ ⊚ fAP ((ConcreteCategory.hom (↑f').1) xA)) = (homAEquiv B₁) (f₁ ⊚ fAX xA)
exact hf'₁ h.right.hA 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
have hp₂ : p₂ ⊚ fAP (f'.val.1 xA) = f₂ ⊚ fAX xA := by 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₂
apply (homAEquiv B₂).injective 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⊢ (homAEquiv B₂) (p₂ ⊚ fAP ((ConcreteCategory.hom (↑f').1) xA)) = (homAEquiv B₂) (f₂ ⊚ fAX xA)
apply_fun (fun k => k.val.1 xA) at hf'₂ 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₁xA:X.carrierAhp₁:p₁ ⊚ fAP ((ConcreteCategory.hom (↑f').1) xA) = f₁ ⊚ fAX xAhf'₂:(ConcreteCategory.hom (↑(p₂ ⊚ f')).1) xA = (ConcreteCategory.hom (↑f₂).1) xA⊢ (homAEquiv B₂) (p₂ ⊚ fAP ((ConcreteCategory.hom (↑f').1) xA)) = (homAEquiv B₂) (f₂ ⊚ fAX xA)
exact hf'₂ h.right.hA 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
apply (homAEquiv P).symm.injective h.right.hA 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)
change fAP (f'.val.1 xA) = fAP (fA xA) h.right.hA 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)
have h_uniq := (Classical.choose_spec (hA (f₁ ⊚ fAX xA)
(f₂ ⊚ fAX xA))).2 h.right.hA 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)
have h_left := h_uniq (fAP (f'.val.1 xA)) ⟨hp₁, hp₂⟩ h.right.hA 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)
have h_right := h_uniq (fAP (fA xA)) (hA_proj xA) h.right.hA 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)
rw [h_left, h.right.hA 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 ⋯⊢ Classical.choose ⋯ = fAP (fA xA) h_right h.right.hA 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 ⋯⊢ Classical.choose ⋯ = Classical.choose ⋯] All goals completed! 🐙
-- Show dot maps are equal
· h.right.hD 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 ext xD h.right.hD 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
have hp₁ : p₁ ⊚ fDP (f'.val.2 xD) = f₁ ⊚ fDX xD := by 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₂
apply (homDEquiv B₁).injective 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⊢ (homDEquiv B₁) (p₁ ⊚ fDP ((ConcreteCategory.hom (↑f').2) xD)) = (homDEquiv B₁) (f₁ ⊚ fDX xD)
apply_fun (fun k => k.val.2 xD) at hf'₁ 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₂xD:X.carrierDhf'₁:(ConcreteCategory.hom (↑(p₁ ⊚ f')).2) xD = (ConcreteCategory.hom (↑f₁).2) xD⊢ (homDEquiv B₁) (p₁ ⊚ fDP ((ConcreteCategory.hom (↑f').2) xD)) = (homDEquiv B₁) (f₁ ⊚ fDX xD)
exact hf'₁ h.right.hD 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
have hp₂ : p₂ ⊚ fDP (f'.val.2 xD) = f₂ ⊚ fDX xD := by 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₂
apply (homDEquiv B₂).injective 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⊢ (homDEquiv B₂) (p₂ ⊚ fDP ((ConcreteCategory.hom (↑f').2) xD)) = (homDEquiv B₂) (f₂ ⊚ fDX xD)
apply_fun (fun k => k.val.2 xD) at hf'₂ 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₁xD:X.carrierDhp₁:p₁ ⊚ fDP ((ConcreteCategory.hom (↑f').2) xD) = f₁ ⊚ fDX xDhf'₂:(ConcreteCategory.hom (↑(p₂ ⊚ f')).2) xD = (ConcreteCategory.hom (↑f₂).2) xD⊢ (homDEquiv B₂) (p₂ ⊚ fDP ((ConcreteCategory.hom (↑f').2) xD)) = (homDEquiv B₂) (f₂ ⊚ fDX xD)
exact hf'₂ h.right.hD 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
apply (homDEquiv P).symm.injective h.right.hD 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)
change fDP (f'.val.2 xD) = fDP (fD xD) h.right.hD 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)
have h_uniq := (Classical.choose_spec (hD (f₁ ⊚ fDX xD)
(f₂ ⊚ fDX xD))).2 h.right.hD 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)
have h_left := h_uniq (fDP (f'.val.2 xD)) ⟨hp₁, hp₂⟩ h.right.hD 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)
have h_right := h_uniq (fDP (fD xD)) (hD_proj xD) h.right.hD 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)
rw [h_left, h.right.hD 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 ⋯⊢ Classical.choose ⋯ = fDP (fD xD) h_right h.right.hD 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 ⋯⊢ Classical.choose ⋯ = Classical.choose ⋯] All goals completed! 🐙
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 := by X:IrreflexiveGraphf:FigA₂ Xh:(ConcreteCategory.hom (↑f).1) 0 = (ConcreteCategory.hom (↑f).1) 1⊢ f.IsSingular
intro ⟨hA, _⟩ 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) (by 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 decide 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 := by X:IrreflexiveGraphf:FigA₂ Xh:(ConcreteCategory.hom (↑f).2) 0 = (ConcreteCategory.hom (↑f).2) 1⊢ f.IsSingular
intro ⟨_, hD⟩ 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) (by 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 decide 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 := by X:IrreflexiveGraphf:FigA₂ Xh:(ConcreteCategory.hom (↑f).2) 0 = (ConcreteCategory.hom (↑f).2) 2⊢ f.IsSingular
intro ⟨_, hD⟩ 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) (by 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 decide 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 := by X:IrreflexiveGraphf:FigA₂ Xh:(ConcreteCategory.hom (↑f).2) 1 = (ConcreteCategory.hom (↑f).2) 2⊢ f.IsSingular
intro ⟨_, hD⟩ 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) (by 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 decide 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.