A Lean Companion to Conceptual Mathematics

Session 25: Labelings and products of graphs🔗

1. Detecting the structure of a graph by means of labelings🔗

The book defines the graph 2_D on p. 271, and we formalise it here since it will be used in Exercise 2.

def IrreflexiveGraph.TwoD : IrreflexiveGraph := { carrierA := Fin 4 carrierD := Fin 2 toSrc := ↾fun | 0 => 0 -- a | 1 => 1 -- b | 2 => 0 -- u | 3 => 1 -- v toTgt := ↾fun | 0 => 1 -- a | 1 => 0 -- b | 2 => 0 -- u | 3 => 1 -- v }
Exercise 1 (p. 271)

Find a graph 2_A such that a map {X \rightarrow 2_A} amounts to a division of the arrows of X into two sorts.

Solution: Exercise 1

A graph 2_A has one dot and two arrows, with both arrows being loops on the single dot. Since all morphisms {X \rightarrow 2_A} map every dot in X to the single dot in 2_A, each arrow in X can be mapped to either one of the two arrows in 2_A. The choice of mapping for each arrow divides the arrows of X into two sorts. We formalise the graph 2_A as follows:

def IrreflexiveGraph.TwoA : IrreflexiveGraph := { carrierA := Fin 2 carrierD := Unit toSrc := ↾fun _ => () toTgt := ↾fun _ => () }
Exercise 2 (p. 272)

(a) Show that if a diagram of sets B_1 \xrightarrow{j_1} S \xleftarrow{j_2} B_2 has the property of a coproduct, but restricted to testing against only the one cofigure-type {Y = \mathbf{2}}, then it is actually a coproduct, i.e. has that property for each object Y.

(b) Show that if a diagram of graphs B_1 \xrightarrow{j_1} S \xleftarrow{j_2} B_2 has the property of a coproduct, but restricted to testing against only the two cofigure-types {Y = 2_A} and {Y = 2_D}, then it is actually a coproduct, i.e. has that property for each object Y.

Solution: Exercise 2

For part (a), we use the restricted universal property (testing against \mathbf{2}) to establish a bijection between S and {B_1 \oplus B_2}, the canonical coproduct in the category Type. We can then use the resulting equivalence to show that S inherits the full universal property for any arbitrary type Y.

open ConcreteCategory in example (B₁ B₂ S : Type) (j₁ : B₁ ⟶ S) (j₂ : B₂ ⟶ S) (hS : ∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), (∃! f : S ⟶ Two, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂)) : ∀ (Y : Type) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), (∃! g : S ⟶ Y, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂) := B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂⊢ ∀ (Y : Type) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ classical -- Bundle j₁, j₂ into single morphism j from disjoint union B₁ ⊕ B₂ B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)⊢ ∀ (Y : Type) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ -- Show that j satisfies universal property for Two B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ j⊢ ∀ (Y : Type) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ -- Show that j is injective B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)⊢ ∀ (Y : Type) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ -- Show that j is surjective B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)⊢ ∀ (Y : Type) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Y⊢ ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ -- Since j is bijective, we can construct equivalence B₁ ⊕ B₂ ≃ S B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯⊢ ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ -- Construct morphism g : S ⟶ Y B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯⊢ (fun g ↦ g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂) (↾fun s ↦ Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (e.symm s)) ∧ ∀ (y : S ⟶ Y), (fun g ↦ g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂) y → y = ↾fun s ↦ Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (e.symm s) B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯⊢ (fun g ↦ g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂) (↾fun s ↦ Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (e.symm s))B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯⊢ ∀ (y : S ⟶ Y), (fun g ↦ g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂) y → y = ↾fun s ↦ Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (e.symm s) B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯⊢ (fun g ↦ g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂) (↾fun s ↦ Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (e.symm s)) -- Prove commutativity B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯⊢ g₁ = (↾fun s ↦ Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (e.symm s)) ⊚ j₁B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯⊢ g₂ = (↾fun s ↦ Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (e.symm s)) ⊚ j₂ B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯⊢ g₁ = (↾fun s ↦ Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (e.symm s)) ⊚ j₁B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯⊢ g₂ = (↾fun s ↦ Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (e.symm s)) ⊚ j₂ B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯b:B₂⊢ (hom g₂).toFun b = (hom ((↾fun s ↦ Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (e.symm s)) ⊚ j₂)).toFun b B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯b:B₁⊢ (hom g₁).toFun b = (hom ((↾fun s ↦ Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (e.symm s)) ⊚ j₁)).toFun b B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯b:B₁⊢ (hom g₁) b = Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (e.symm (e (Sum.inl b))) B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯b:B₁⊢ (hom g₁) b = Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (Sum.inl b); All goals completed! 🐙 B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯b:B₂⊢ (hom g₂).toFun b = (hom ((↾fun s ↦ Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (e.symm s)) ⊚ j₂)).toFun b B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯b:B₂⊢ (hom g₂) b = Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (e.symm (e (Sum.inr b))) B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯b:B₂⊢ (hom g₂) b = Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (Sum.inr b); All goals completed! 🐙 B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯⊢ ∀ (y : S ⟶ Y), (fun g ↦ g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂) y → y = ↾fun s ↦ Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (e.symm s) -- Prove uniqueness B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂⊢ f' = ↾fun s ↦ Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (e.symm s) B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:S⊢ (hom f').toFun s = (hom (↾fun s ↦ Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (e.symm s))).toFun s B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:S⊢ (hom f') s = Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (e.symm s) nth_rw 1 [B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:S⊢ (hom f') (e (e.symm s)) = Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (e.symm s)B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:S⊢ (hom f') (e (e.symm s)) = Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (e.symm s) cases e.symm s with B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:Sb₁:B₁⊢ (hom f') (e (Sum.inl b₁)) = Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (Sum.inl b₁) All goals completed! 🐙 B₁:TypeB₂:TypeS:Typej₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS:∀ (f₁ : B₁ ⟶ Two) (f₂ : B₂ ⟶ Two), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂j:B₁ ⊕ B₂ ⟶ S := ↾Sum.elim ⇑(hom j₁) ⇑(hom j₂)hj:∀ (k : B₁ ⊕ B₂ ⟶ Two), ∃! f, k = f ⊚ jhj_inj:Function.Injective ⇑(hom j)hj_surj:Function.Surjective ⇑(hom j)Y:Typeg₁:B₁ ⟶ Yg₂:B₂ ⟶ Ye:B₁ ⊕ B₂ ≃ S := Equiv.ofBijective ⇑(hom j) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:Sb₂:B₂⊢ (hom f') (e (Sum.inr b₂)) = Sum.elim (⇑(hom g₁)) (⇑(hom g₂)) (Sum.inr b₂) All goals completed! 🐙

For part (b), we follow closely the proof strategy used in part (a). The task is rather more complicated, however, since we need to account for the additional structure of objects and morphisms in the category of graphs.

We begin with a few definitions and lemmas to facilitate moving, in the main proof, between objects in the IrreflexiveGraph category and their underlying sets (types) of dots and arrows. The definitions liftTwoA and liftTwoD construct morphisms from an arbitrary graph X to the graphs 2_A and 2_D, respectively, given maps from the underlying sets of dots and arrows of X to those of 2_A and 2_D. The lemmas liftTwoA_comp and liftTwoD_comp show that these constructions are compatible with composition of morphisms in the category of graphs.

open IrreflexiveGraph def liftTwoA {X : IrreflexiveGraph} (f : X.carrierA ⟶ TwoA.carrierA) : X ⟶ TwoA := ⟨(f, ↾fun _ ↦ ()), X:IrreflexiveGraphf:X.carrierA ⟶ TwoA.carrierA⊢ (f, ↾fun x ↦ ()).2 ⊚ X.toSrc = TwoA.toSrc ⊚ (f, ↾fun x ↦ ()).1 ∧ (f, ↾fun x ↦ ()).2 ⊚ X.toTgt = TwoA.toTgt ⊚ (f, ↾fun x ↦ ()).1 X:IrreflexiveGraphf:X.carrierA ⟶ TwoA.carrierA⊢ (f, ↾fun x ↦ ()).2 ⊚ X.toSrc = TwoA.toSrc ⊚ (f, ↾fun x ↦ ()).1X:IrreflexiveGraphf:X.carrierA ⟶ TwoA.carrierA⊢ (f, ↾fun x ↦ ()).2 ⊚ X.toTgt = TwoA.toTgt ⊚ (f, ↾fun x ↦ ()).1 X:IrreflexiveGraphf:X.carrierA ⟶ TwoA.carrierA⊢ (f, ↾fun x ↦ ()).2 ⊚ X.toSrc = TwoA.toSrc ⊚ (f, ↾fun x ↦ ()).1X:IrreflexiveGraphf:X.carrierA ⟶ TwoA.carrierA⊢ (f, ↾fun x ↦ ()).2 ⊚ X.toTgt = TwoA.toTgt ⊚ (f, ↾fun x ↦ ()).1 All goals completed! 🐙⟩ def mkTwoDArrow (s t : Fin 2) : Fin 4 := match (s, t) with | (0, 1) => 0 -- a | (1, 0) => 1 -- b | (0, 0) => 2 -- u | (1, 1) => 3 -- v lemma mkTwoDArrow_src (s t : Fin 2) : TwoD.toSrc (mkTwoDArrow s t) = s := s:Fin 2t:Fin 2⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow s t) = s t:Fin 2⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow ((fun i ↦ i) ⟨0, ⋯⟩) t) = (fun i ↦ i) ⟨0, ⋯⟩t:Fin 2⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) t) = (fun i ↦ i) ⟨1, ⋯⟩ t:Fin 2⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow ((fun i ↦ i) ⟨0, ⋯⟩) t) = (fun i ↦ i) ⟨0, ⋯⟩t:Fin 2⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) t) = (fun i ↦ i) ⟨1, ⋯⟩ ⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩)) = (fun i ↦ i) ⟨1, ⋯⟩⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩)) = (fun i ↦ i) ⟨1, ⋯⟩ ⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩)) = (fun i ↦ i) ⟨0, ⋯⟩⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩)) = (fun i ↦ i) ⟨0, ⋯⟩⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩)) = (fun i ↦ i) ⟨1, ⋯⟩⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩)) = (fun i ↦ i) ⟨1, ⋯⟩ All goals completed! 🐙 lemma mkTwoDArrow_tgt (s t : Fin 2) : TwoD.toTgt (mkTwoDArrow s t) = t := s:Fin 2t:Fin 2⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow s t) = t t:Fin 2⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow ((fun i ↦ i) ⟨0, ⋯⟩) t) = tt:Fin 2⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) t) = t t:Fin 2⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow ((fun i ↦ i) ⟨0, ⋯⟩) t) = tt:Fin 2⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) t) = t ⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩)) = (fun i ↦ i) ⟨0, ⋯⟩⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩)) = (fun i ↦ i) ⟨1, ⋯⟩ ⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩)) = (fun i ↦ i) ⟨0, ⋯⟩⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩)) = (fun i ↦ i) ⟨1, ⋯⟩⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩)) = (fun i ↦ i) ⟨0, ⋯⟩⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩)) = (fun i ↦ i) ⟨1, ⋯⟩ All goals completed! 🐙 def liftTwoD {X : IrreflexiveGraph} (f : X.carrierD ⟶ TwoD.carrierD) : X ⟶ TwoD := ⟨ (↾fun a ↦ mkTwoDArrow (f (X.toSrc a)) (f (X.toTgt a)), f), X:IrreflexiveGraphf:X.carrierD ⟶ TwoD.carrierD⊢ (↾fun a ↦ mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a)) ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)), f).2 ⊚ X.toSrc = TwoD.toSrc ⊚ (↾fun a ↦ mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a)) ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)), f).1 ∧ (↾fun a ↦ mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a)) ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)), f).2 ⊚ X.toTgt = TwoD.toTgt ⊚ (↾fun a ↦ mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a)) ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)), f).1 X:IrreflexiveGraphf:X.carrierD ⟶ TwoD.carrierD⊢ (↾fun a ↦ mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a)) ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)), f).2 ⊚ X.toSrc = TwoD.toSrc ⊚ (↾fun a ↦ mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a)) ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)), f).1X:IrreflexiveGraphf:X.carrierD ⟶ TwoD.carrierD⊢ (↾fun a ↦ mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a)) ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)), f).2 ⊚ X.toTgt = TwoD.toTgt ⊚ (↾fun a ↦ mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a)) ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)), f).1 X:IrreflexiveGraphf:X.carrierD ⟶ TwoD.carrierD⊢ (↾fun a ↦ mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a)) ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)), f).2 ⊚ X.toSrc = TwoD.toSrc ⊚ (↾fun a ↦ mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a)) ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)), f).1X:IrreflexiveGraphf:X.carrierD ⟶ TwoD.carrierD⊢ (↾fun a ↦ mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a)) ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)), f).2 ⊚ X.toTgt = TwoD.toTgt ⊚ (↾fun a ↦ mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a)) ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)), f).1 (X:IrreflexiveGraphf:X.carrierD ⟶ TwoD.carrierDa:X.carrierA⊢ (ConcreteCategory.hom ((↾fun a ↦ mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a)) ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)), f).2 ⊚ X.toTgt)).toFun a = (ConcreteCategory.hom (TwoD.toTgt ⊚ (↾fun a ↦ mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a)) ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)), f).1)).toFun a; X:IrreflexiveGraphf:X.carrierD ⟶ TwoD.carrierDa:X.carrierA⊢ (ConcreteCategory.hom (TwoD.toTgt ⊚ (↾fun a ↦ mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a)) ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)), f).1)).toFun a = (ConcreteCategory.hom ((↾fun a ↦ mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a)) ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)), f).2 ⊚ X.toTgt)).toFun a) X:IrreflexiveGraphf:X.carrierD ⟶ TwoD.carrierDa:X.carrierA⊢ (ConcreteCategory.hom (TwoD.toSrc ⊚ (↾fun a ↦ mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a)) ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)), f).1)).toFun a = (ConcreteCategory.hom ((↾fun a ↦ mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a)) ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)), f).2 ⊚ X.toSrc)).toFun a All goals completed! 🐙 X:IrreflexiveGraphf:X.carrierD ⟶ TwoD.carrierDa:X.carrierA⊢ (ConcreteCategory.hom (TwoD.toTgt ⊚ (↾fun a ↦ mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a)) ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)), f).1)).toFun a = (ConcreteCategory.hom ((↾fun a ↦ mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a)) ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)), f).2 ⊚ X.toTgt)).toFun a All goals completed! 🐙 ⟩ lemma liftTwoA_comp {X Y : IrreflexiveGraph} (f : X ⟶ Y) (g : Y.carrierA ⟶ TwoA.carrierA) : liftTwoA (g ⊚ f.val.1) = liftTwoA g ⊚ f := X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierA ⟶ TwoA.carrierA⊢ liftTwoA (g ⊚ (↑f).1) = liftTwoA g ⊚ f X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierA ⟶ TwoA.carrierA⊢ (↑(liftTwoA (g ⊚ (↑f).1))).1 = (↑(liftTwoA g ⊚ f)).1X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierA ⟶ TwoA.carrierA⊢ (↑(liftTwoA (g ⊚ (↑f).1))).2 = (↑(liftTwoA g ⊚ f)).2 X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierA ⟶ TwoA.carrierA⊢ (↑(liftTwoA (g ⊚ (↑f).1))).1 = (↑(liftTwoA g ⊚ f)).1X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierA ⟶ TwoA.carrierA⊢ (↑(liftTwoA (g ⊚ (↑f).1))).2 = (↑(liftTwoA g ⊚ f)).2 All goals completed! 🐙 lemma liftTwoD_comp {X Y : IrreflexiveGraph} (f : X ⟶ Y) (g : Y.carrierD ⟶ TwoD.carrierD) : liftTwoD (g ⊚ f.val.2) = liftTwoD g ⊚ f := X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierD ⟶ TwoD.carrierD⊢ liftTwoD (g ⊚ (↑f).2) = liftTwoD g ⊚ f X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierD ⟶ TwoD.carrierD⊢ (↑(liftTwoD (g ⊚ (↑f).2))).1 = (↑(liftTwoD g ⊚ f)).1X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierD ⟶ TwoD.carrierD⊢ (↑(liftTwoD (g ⊚ (↑f).2))).2 = (↑(liftTwoD g ⊚ f)).2 X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierD ⟶ TwoD.carrierD⊢ (↑(liftTwoD (g ⊚ (↑f).2))).1 = (↑(liftTwoD g ⊚ f)).1 X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierD ⟶ TwoD.carrierDa:X.carrierA⊢ (ConcreteCategory.hom (↑(liftTwoD (g ⊚ (↑f).2))).1).toFun a = (ConcreteCategory.hom (↑(liftTwoD g ⊚ f)).1).toFun a X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierD ⟶ TwoD.carrierDa:X.carrierA⊢ mkTwoDArrow ((ConcreteCategory.hom g) ((ConcreteCategory.hom ((↑f).2 ⊚ X.toSrc)) a)) ((ConcreteCategory.hom g) ((ConcreteCategory.hom ((↑f).2 ⊚ X.toTgt)) a)) = (ConcreteCategory.hom (↑(liftTwoD g ⊚ f)).1).toFun a X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierD ⟶ TwoD.carrierDa:X.carrierA⊢ mkTwoDArrow ((ConcreteCategory.hom g) ((ConcreteCategory.hom (Y.toSrc ⊚ (↑f).1)) a)) ((ConcreteCategory.hom g) ((ConcreteCategory.hom (Y.toTgt ⊚ (↑f).1)) a)) = (ConcreteCategory.hom (↑(liftTwoD g ⊚ f)).1).toFun a; All goals completed! 🐙 X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierD ⟶ TwoD.carrierD⊢ (↑(liftTwoD (g ⊚ (↑f).2))).2 = (↑(liftTwoD g ⊚ f)).2 All goals completed! 🐙

Our main proof now follows. It sacrifices brevity in order to remain as close as possible to the proof strategy in part (a).

open ConcreteCategory in example (B₁ B₂ S : IrreflexiveGraph) (j₁ : B₁ ⟶ S) (j₂ : B₂ ⟶ S) (hS₁ : ∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), (∃! f : S ⟶ TwoA, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂)) (hS₂ : ∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), (∃! f : S ⟶ TwoD, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂)) : ∀ (Y : IrreflexiveGraph) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), (∃! g : S ⟶ Y, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂) := B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂⊢ ∀ (Y : IrreflexiveGraph) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ classical -- Extract set-level hypothesis for arrows from hS₁ B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1⊢ ∀ (Y : IrreflexiveGraph) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ -- Bundle j₁, j₂ for arrows into single morphism jA from B₁ ⊕ B₂ B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)⊢ ∀ (Y : IrreflexiveGraph) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ -- Show that jA satisfies universal property for TwoA.carrierA B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jA⊢ ∀ (Y : IrreflexiveGraph) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ -- Show that jA is injective B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)⊢ ∀ (Y : IrreflexiveGraph) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ -- Show that jA is surjective B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)⊢ ∀ (Y : IrreflexiveGraph) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ -- Extract set-level hypothesis for dots from hS₂ B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2⊢ ∀ (Y : IrreflexiveGraph) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ -- Bundle j₁, j₂ for dots into single morphism jD from B₁ ⊕ B₂ B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)⊢ ∀ (Y : IrreflexiveGraph) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ -- Show that jD satisfies universal property for TwoD.carrierD B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jD⊢ ∀ (Y : IrreflexiveGraph) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ -- Show that jD is injective B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)⊢ ∀ (Y : IrreflexiveGraph) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ -- Show that jD is surjective B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)⊢ ∀ (Y : IrreflexiveGraph) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ Y⊢ ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ -- Since jA is bijective, we can construct equivalence for arrows B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯⊢ ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ -- Since jD is bijective, we can construct equivalence for dots B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯⊢ ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂ -- Construct morphism g : S ⟶ Y use ⟨ (↾fun sA ↦ Sum.elim g₁.val.1 g₂.val.1 (eA.symm sA), ↾fun sD ↦ Sum.elim g₁.val.2 g₂.val.2 (eD.symm sD)), ⟨B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯⊢ (↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)).2 ⊚ S.toSrc = Y.toSrc ⊚ (↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)).1 -- Prove that source commutes B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯sA:S.carrierA⊢ (hom ((↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)).2 ⊚ S.toSrc)).toFun sA = (hom (Y.toSrc ⊚ (↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)).1)).toFun sA B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA:B₁.carrierA ⊕ B₂.carrierA⊢ (hom ((↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)).2 ⊚ S.toSrc)).toFun (eA bA) = (hom (Y.toSrc ⊚ (↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)).1)).toFun (eA bA) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA:B₁.carrierA ⊕ B₂.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm ((hom S.toSrc) (eA bA))) = (hom Y.toSrc) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm (eA bA))) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA:B₁.carrierA ⊕ B₂.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm ((hom S.toSrc) (eA bA))) = (hom Y.toSrc) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) bA) cases bA with B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA₁:B₁.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm ((hom S.toSrc) (eA (Sum.inl bA₁)))) = (hom Y.toSrc) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inl bA₁)) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA₁:B₁.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm ((hom (S.toSrc ⊚ (↑j₁).1)) bA₁)) = (hom Y.toSrc) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inl bA₁)) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA₁:B₁.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm ((hom ((↑j₁).2 ⊚ B₁.toSrc)) bA₁)) = (hom Y.toSrc) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inl bA₁)) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA₁:B₁.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm (eD (Sum.inl ((hom B₁.toSrc) bA₁)))) = (hom Y.toSrc) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inl bA₁)) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA₁:B₁.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (Sum.inl ((hom B₁.toSrc) bA₁)) = (hom Y.toSrc) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inl bA₁)) All goals completed! 🐙 B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA₂:B₂.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm ((hom S.toSrc) (eA (Sum.inr bA₂)))) = (hom Y.toSrc) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inr bA₂)) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA₂:B₂.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm ((hom (S.toSrc ⊚ (↑j₂).1)) bA₂)) = (hom Y.toSrc) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inr bA₂)) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA₂:B₂.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm ((hom ((↑j₂).2 ⊚ B₂.toSrc)) bA₂)) = (hom Y.toSrc) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inr bA₂)) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA₂:B₂.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm (eD (Sum.inr ((hom B₂.toSrc) bA₂)))) = (hom Y.toSrc) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inr bA₂)) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA₂:B₂.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (Sum.inr ((hom B₂.toSrc) bA₂)) = (hom Y.toSrc) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inr bA₂)) All goals completed! 🐙, B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯⊢ (↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)).2 ⊚ S.toTgt = Y.toTgt ⊚ (↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)).1 -- Prove that target commutes B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯sA:S.carrierA⊢ (hom ((↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)).2 ⊚ S.toTgt)).toFun sA = (hom (Y.toTgt ⊚ (↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)).1)).toFun sA B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA:B₁.carrierA ⊕ B₂.carrierA⊢ (hom ((↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)).2 ⊚ S.toTgt)).toFun (eA bA) = (hom (Y.toTgt ⊚ (↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)).1)).toFun (eA bA) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA:B₁.carrierA ⊕ B₂.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm ((hom S.toTgt) (eA bA))) = (hom Y.toTgt) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm (eA bA))) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA:B₁.carrierA ⊕ B₂.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm ((hom S.toTgt) (eA bA))) = (hom Y.toTgt) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) bA) cases bA with B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA₁:B₁.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm ((hom S.toTgt) (eA (Sum.inl bA₁)))) = (hom Y.toTgt) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inl bA₁)) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA₁:B₁.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm ((hom (S.toTgt ⊚ (↑j₁).1)) bA₁)) = (hom Y.toTgt) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inl bA₁)) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA₁:B₁.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm ((hom ((↑j₁).2 ⊚ B₁.toTgt)) bA₁)) = (hom Y.toTgt) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inl bA₁)) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA₁:B₁.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm (eD (Sum.inl ((hom B₁.toTgt) bA₁)))) = (hom Y.toTgt) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inl bA₁)) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA₁:B₁.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (Sum.inl ((hom B₁.toTgt) bA₁)) = (hom Y.toTgt) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inl bA₁)) All goals completed! 🐙 B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA₂:B₂.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm ((hom S.toTgt) (eA (Sum.inr bA₂)))) = (hom Y.toTgt) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inr bA₂)) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA₂:B₂.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm ((hom (S.toTgt ⊚ (↑j₂).1)) bA₂)) = (hom Y.toTgt) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inr bA₂)) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA₂:B₂.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm ((hom ((↑j₂).2 ⊚ B₂.toTgt)) bA₂)) = (hom Y.toTgt) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inr bA₂)) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA₂:B₂.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm (eD (Sum.inr ((hom B₂.toTgt) bA₂)))) = (hom Y.toTgt) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inr bA₂)) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯bA₂:B₂.carrierA⊢ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (Sum.inr ((hom B₂.toTgt) bA₂)) = (hom Y.toTgt) (Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inr bA₂)) All goals completed! 🐙⟩ ⟩ B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯⊢ (fun g ↦ g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂) ⟨(↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)), ⋯⟩B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯⊢ ∀ (y : S ⟶ Y), (fun g ↦ g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂) y → y = ⟨(↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)), ⋯⟩ B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯⊢ (fun g ↦ g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂) ⟨(↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)), ⋯⟩ -- Prove commutativity B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯⊢ g₁ = ⟨(↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)), ⋯⟩ ⊚ j₁B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯⊢ g₂ = ⟨(↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)), ⋯⟩ ⊚ j₂ B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯⊢ g₁ = ⟨(↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)), ⋯⟩ ⊚ j₁B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯⊢ g₂ = ⟨(↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)), ⋯⟩ ⊚ j₂ B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯b:B₂.carrierA⊢ (hom (↑g₂).1).toFun b = (hom (↑(⟨(↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)), ⋯⟩ ⊚ j₂)).1).toFun bB₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯b:B₂.carrierD⊢ (hom (↑g₂).2).toFun b = (hom (↑(⟨(↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)), ⋯⟩ ⊚ j₂)).2).toFun b B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯b:B₁.carrierA⊢ (hom (↑g₁).1).toFun b = (hom (↑(⟨(↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)), ⋯⟩ ⊚ j₁)).1).toFun b B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯b:B₁.carrierA⊢ (hom (↑g₁).1).toFun b = Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm (eA (Sum.inl b))) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯b:B₁.carrierA⊢ (hom (↑g₁).1).toFun b = Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inl b); All goals completed! 🐙 B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯b:B₁.carrierD⊢ (hom (↑g₁).2).toFun b = (hom (↑(⟨(↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)), ⋯⟩ ⊚ j₁)).2).toFun b B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯b:B₁.carrierD⊢ (hom (↑g₁).2).toFun b = Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm (eD (Sum.inl b))) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯b:B₁.carrierD⊢ (hom (↑g₁).2).toFun b = Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (Sum.inl b); All goals completed! 🐙 B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯b:B₂.carrierA⊢ (hom (↑g₂).1).toFun b = (hom (↑(⟨(↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)), ⋯⟩ ⊚ j₂)).1).toFun b B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯b:B₂.carrierA⊢ (hom (↑g₂).1).toFun b = Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm (eA (Sum.inr b))) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯b:B₂.carrierA⊢ (hom (↑g₂).1).toFun b = Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inr b); All goals completed! 🐙 B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯b:B₂.carrierD⊢ (hom (↑g₂).2).toFun b = (hom (↑(⟨(↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)), ⋯⟩ ⊚ j₂)).2).toFun b B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯b:B₂.carrierD⊢ (hom (↑g₂).2).toFun b = Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm (eD (Sum.inr b))) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯b:B₂.carrierD⊢ (hom (↑g₂).2).toFun b = Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (Sum.inr b); All goals completed! 🐙 B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯⊢ ∀ (y : S ⟶ Y), (fun g ↦ g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂) y → y = ⟨(↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)), ⋯⟩ -- Prove uniqueness B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂⊢ f' = ⟨(↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)), ⋯⟩ B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:S.carrierA⊢ (hom (↑f').1).toFun s = (hom (↑⟨(↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)), ⋯⟩).1).toFun sB₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:S.carrierD⊢ (hom (↑f').2).toFun s = (hom (↑⟨(↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)), ⋯⟩).2).toFun s B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:S.carrierA⊢ (hom (↑f').1).toFun s = (hom (↑⟨(↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)), ⋯⟩).1).toFun sB₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:S.carrierD⊢ (hom (↑f').2).toFun s = (hom (↑⟨(↾fun sA ↦ Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm sA), ↾fun sD ↦ Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm sD)), ⋯⟩).2).toFun s B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:S.carrierD⊢ (hom (↑f').2) s = Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm s) B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:S.carrierA⊢ (hom (↑f').1) s = Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm s) nth_rw 1 [B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:S.carrierA⊢ (hom (↑f').1) (eA (eA.symm s)) = Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm s)B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:S.carrierA⊢ (hom (↑f').1) (eA (eA.symm s)) = Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (eA.symm s) cases eA.symm s with B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:S.carrierAbA₁:B₁.carrierA⊢ (hom (↑f').1) (eA (Sum.inl bA₁)) = Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inl bA₁) All goals completed! 🐙 B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:S.carrierAbA₂:B₂.carrierA⊢ (hom (↑f').1) (eA (Sum.inr bA₂)) = Sum.elim (⇑(hom (↑g₁).1)) (⇑(hom (↑g₂).1)) (Sum.inr bA₂) All goals completed! 🐙 B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:S.carrierD⊢ (hom (↑f').2) s = Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm s) nth_rw 1 [B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:S.carrierD⊢ (hom (↑f').2) (eD (eD.symm s)) = Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm s)B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:S.carrierD⊢ (hom (↑f').2) (eD (eD.symm s)) = Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (eD.symm s) cases eD.symm s with B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:S.carrierDbD₁:B₁.carrierD⊢ (hom (↑f').2) (eD (Sum.inl bD₁)) = Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (Sum.inl bD₁) All goals completed! 🐙 B₁:IrreflexiveGraphB₂:IrreflexiveGraphS:IrreflexiveGraphj₁:B₁ ⟶ Sj₂:B₂ ⟶ ShS₁:∀ (f₁ : B₁ ⟶ TwoA) (f₂ : B₂ ⟶ TwoA), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hS₂:∀ (f₁ : B₁ ⟶ TwoD) (f₂ : B₂ ⟶ TwoD), ∃! f, f₁ = f ⊚ j₁ ∧ f₂ = f ⊚ j₂hSA:∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA) (fA₂ : B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1jA:B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA := ↾Sum.elim ⇑(hom (↑j₁).1) ⇑(hom (↑j₂).1)hjA:∀ (kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA), ∃! fA, kA = fA ⊚ jAhjA_inj:Function.Injective ⇑(hom jA)hjA_surj:Function.Surjective ⇑(hom jA)hSD:∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD) (fD₂ : B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2jD:B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD := ↾Sum.elim ⇑(hom (↑j₁).2) ⇑(hom (↑j₂).2)hjD:∀ (kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD), ∃! fD, kD = fD ⊚ jDhjD_inj:Function.Injective ⇑(hom jD)hjD_surj:Function.Surjective ⇑(hom jD)Y:IrreflexiveGraphg₁:B₁ ⟶ Yg₂:B₂ ⟶ YeA:B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA := Equiv.ofBijective ⇑(hom jA) ⋯eD:B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD := Equiv.ofBijective ⇑(hom jD) ⋯f':S ⟶ Yh₁:g₁ = f' ⊚ j₁h₂:g₂ = f' ⊚ j₂s:S.carrierDbD₂:B₂.carrierD⊢ (hom (↑f').2) (eD (Sum.inr bD₂)) = Sum.elim (⇑(hom (↑g₁).2)) (⇑(hom (↑g₂).2)) (Sum.inr bD₂) All goals completed! 🐙
Exercise 3 (p. 273)

Tricoloring a graph means assigning to each dot one of the three colors white, red, or green, in such a way that for each arrow, the source and target have different colors. If you fix a tricoloring of a graph X, and you have a map of graphs {Y \xrightarrow{f} X}, then you can color the dots of Y also: just color each dot {D \xrightarrow{y} Y} the same color as {f y}. This is called the 'tricoloring of Y induced by f'.

(a) Show that this induced coloring is a tricoloring; i.e. no arrow of Y has source and target the same color.

(b) Find Fatima's tricolored graph F. It is the best tricolored graph: For any graph Y, each tricoloring of Y is induced by exactly one map {Y \rightarrow F}.

Solution: Exercise 3

We first define an inductive type to represent the three colours.

inductive Tricolour | white | red | green

For part (a), we define what it means for a colouring of an irreflexive graph to be a tricolouring. We then show that if we have a tricolouring of a graph X, we can induce a tricolouring of any graph Y that maps to X.

def IsTricolouring (X : IrreflexiveGraph) (c : X.carrierD ⟶ Tricolour) : Prop := ∀ a : X.carrierA, c (X.toSrc a) ≠ c (X.toTgt a) def inducedColouring {Y X : IrreflexiveGraph} (f : Y ⟶ X) (c : X.carrierD ⟶ Tricolour) : Y.carrierD ⟶ Tricolour := c ⊚ f.val.2 example {Y X : IrreflexiveGraph} (f : Y ⟶ X) (c : X.carrierD ⟶ Tricolour) (h : IsTricolouring X c) : IsTricolouring Y (inducedColouring f c) := Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:X.carrierD ⟶ Tricolourh:IsTricolouring X c⊢ IsTricolouring Y (inducedColouring f c) Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:X.carrierD ⟶ Tricolourh:IsTricolouring X ca:Y.carrierA⊢ (ConcreteCategory.hom (inducedColouring f c)) ((ConcreteCategory.hom Y.toSrc) a) ≠ (ConcreteCategory.hom (inducedColouring f c)) ((ConcreteCategory.hom Y.toTgt) a) Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:X.carrierD ⟶ Tricolourh:IsTricolouring X ca:Y.carrierA⊢ (ConcreteCategory.hom c) ((ConcreteCategory.hom ((↑f).2 ⊚ Y.toSrc)) a) ≠ (ConcreteCategory.hom c) ((ConcreteCategory.hom ((↑f).2 ⊚ Y.toTgt)) a) Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:X.carrierD ⟶ Tricolourh:IsTricolouring X ca:Y.carrierA⊢ (ConcreteCategory.hom c) ((ConcreteCategory.hom (X.toSrc ⊚ (↑f).1)) a) ≠ (ConcreteCategory.hom c) ((ConcreteCategory.hom (X.toTgt ⊚ (↑f).1)) a) All goals completed! 🐙

Strictly speaking, since the exercise defines a 'dot' as a morphism {D \xrightarrow{y} Y}, we should be working only with morphisms and not elements of the carrier types. We can reformulate the above definitions and proof exclusively in terms of morphisms, as follows:

def Dot (X : IrreflexiveGraph) := IrreflexiveGraph.D ⟶ X def srcDot {X : IrreflexiveGraph} (a : X.carrierA) : Dot X := ⟨ (↾Empty.elim, ↾fun _ ↦ X.toSrc a), ⟨X:IrreflexiveGrapha:X.carrierA⊢ (↾Empty.elim, ↾fun x ↦ (ConcreteCategory.hom X.toSrc) a).2 ⊚ IrreflexiveGraph.D.toSrc = X.toSrc ⊚ (↾Empty.elim, ↾fun x ↦ (ConcreteCategory.hom X.toSrc) a).1 X:IrreflexiveGrapha:X.carrierAx:IrreflexiveGraph.D.carrierA⊢ (ConcreteCategory.hom ((↾Empty.elim, ↾fun x ↦ (ConcreteCategory.hom X.toSrc) a).2 ⊚ IrreflexiveGraph.D.toSrc)).toFun x = (ConcreteCategory.hom (X.toSrc ⊚ (↾Empty.elim, ↾fun x ↦ (ConcreteCategory.hom X.toSrc) a).1)).toFun x; All goals completed! 🐙, X:IrreflexiveGrapha:X.carrierA⊢ (↾Empty.elim, ↾fun x ↦ (ConcreteCategory.hom X.toSrc) a).2 ⊚ IrreflexiveGraph.D.toTgt = X.toTgt ⊚ (↾Empty.elim, ↾fun x ↦ (ConcreteCategory.hom X.toSrc) a).1 X:IrreflexiveGrapha:X.carrierAx:IrreflexiveGraph.D.carrierA⊢ (ConcreteCategory.hom ((↾Empty.elim, ↾fun x ↦ (ConcreteCategory.hom X.toSrc) a).2 ⊚ IrreflexiveGraph.D.toTgt)).toFun x = (ConcreteCategory.hom (X.toTgt ⊚ (↾Empty.elim, ↾fun x ↦ (ConcreteCategory.hom X.toSrc) a).1)).toFun x; All goals completed! 🐙⟩ ⟩ def tgtDot {X : IrreflexiveGraph} (a : X.carrierA) : Dot X := ⟨ (↾Empty.elim, ↾fun _ ↦ X.toTgt a), ⟨X:IrreflexiveGrapha:X.carrierA⊢ (↾Empty.elim, ↾fun x ↦ (ConcreteCategory.hom X.toTgt) a).2 ⊚ IrreflexiveGraph.D.toSrc = X.toSrc ⊚ (↾Empty.elim, ↾fun x ↦ (ConcreteCategory.hom X.toTgt) a).1 X:IrreflexiveGrapha:X.carrierAx:IrreflexiveGraph.D.carrierA⊢ (ConcreteCategory.hom ((↾Empty.elim, ↾fun x ↦ (ConcreteCategory.hom X.toTgt) a).2 ⊚ IrreflexiveGraph.D.toSrc)).toFun x = (ConcreteCategory.hom (X.toSrc ⊚ (↾Empty.elim, ↾fun x ↦ (ConcreteCategory.hom X.toTgt) a).1)).toFun x; All goals completed! 🐙, X:IrreflexiveGrapha:X.carrierA⊢ (↾Empty.elim, ↾fun x ↦ (ConcreteCategory.hom X.toTgt) a).2 ⊚ IrreflexiveGraph.D.toTgt = X.toTgt ⊚ (↾Empty.elim, ↾fun x ↦ (ConcreteCategory.hom X.toTgt) a).1 X:IrreflexiveGrapha:X.carrierAx:IrreflexiveGraph.D.carrierA⊢ (ConcreteCategory.hom ((↾Empty.elim, ↾fun x ↦ (ConcreteCategory.hom X.toTgt) a).2 ⊚ IrreflexiveGraph.D.toTgt)).toFun x = (ConcreteCategory.hom (X.toTgt ⊚ (↾Empty.elim, ↾fun x ↦ (ConcreteCategory.hom X.toTgt) a).1)).toFun x; All goals completed! 🐙⟩ ⟩ def IsTricolouring' (X : IrreflexiveGraph) (c : Dot X ⟶ Tricolour) : Prop := ∀ a : X.carrierA, c (srcDot a) ≠ c (tgtDot a) def inducedColouring' {Y X : IrreflexiveGraph} (f : Y ⟶ X) (c : Dot X ⟶ Tricolour) : Dot Y ⟶ Tricolour := ↾fun y ↦ c (f ⊚ y) open ConcreteCategory in example {Y X : IrreflexiveGraph} (f : Y ⟶ X) (c : Dot X ⟶ Tricolour) (h : IsTricolouring' X c) : IsTricolouring' Y (inducedColouring' f c) := Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X c⊢ IsTricolouring' Y (inducedColouring' f c) Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X ca:Y.carrierA⊢ (hom (inducedColouring' f c)) (srcDot a) ≠ (hom (inducedColouring' f c)) (tgtDot a) Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X ca:Y.carrierA⊢ (hom c) (f ⊚ srcDot a) ≠ (hom c) (f ⊚ tgtDot a) Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X ca:Y.carrierAh_src:f ⊚ srcDot a = srcDot ((hom (↑f).1) a)⊢ (hom c) (f ⊚ srcDot a) ≠ (hom c) (f ⊚ tgtDot a) Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X ca:Y.carrierAh_src:f ⊚ srcDot a = srcDot ((hom (↑f).1) a)h_tgt:f ⊚ tgtDot a = tgtDot ((hom (↑f).1) a)⊢ (hom c) (f ⊚ srcDot a) ≠ (hom c) (f ⊚ tgtDot a) Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X ca:Y.carrierAh_src:f ⊚ srcDot a = srcDot ((hom (↑f).1) a)h_tgt:f ⊚ tgtDot a = tgtDot ((hom (↑f).1) a)⊢ (hom c) (srcDot ((hom (↑f).1) a)) ≠ (hom c) (tgtDot ((hom (↑f).1) a)) All goals completed! 🐙

In part (b), we find that Fatima's tricoloured graph F consists of exactly six arrows: white-to-red, white-to-green, red-to-white, red-to-green, green-to-white, and green-to-red. That is, F consists of exactly one arrow for each ordered pair of distinct colours, which we formalise as follows:

def F : IrreflexiveGraph := { carrierA := { p : Tricolour × Tricolour // p.1 ≠ p.2 } carrierD := Tricolour toSrc := ↾fun p ↦ p.val.1 toTgt := ↾fun p ↦ p.val.2 }

We then prove that for any graph Y, each tricolouring of Y is induced by exactly one map {Y \rightarrow F}.

example : IsTricolouring F (𝟙 F.carrierD) := fun a ↦ a.property open ConcreteCategory in example {Y : IrreflexiveGraph} (c : Y.carrierD ⟶ Tricolour) (h : IsTricolouring Y c) : ∃! g : Y ⟶ F, inducedColouring g (𝟙 F.carrierD) = c := Y:IrreflexiveGraphc:Y.carrierD ⟶ Tricolourh:IsTricolouring Y c⊢ ∃! g, inducedColouring g (𝟙 F.carrierD) = c Y:IrreflexiveGraphc:Y.carrierD ⟶ Tricolourh:IsTricolouring Y c⊢ ∀ (y : Y ⟶ F), (fun g ↦ inducedColouring g (𝟙 F.carrierD) = c) y → y = ⟨(↾fun a ↦ ⟨((hom c) ((hom Y.toSrc) a), (hom c) ((hom Y.toTgt) a)), ⋯⟩, c), ⋯⟩ Y:IrreflexiveGraphfst✝:Y.carrierA ⟶ F.carrierAgD:Y.carrierD ⟶ F.carrierDh_src:(fst✝, gD).2 ⊚ Y.toSrc = F.toSrc ⊚ (fst✝, gD).1h_tgt:(fst✝, gD).2 ⊚ Y.toTgt = F.toTgt ⊚ (fst✝, gD).1h:IsTricolouring Y gD⊢ ⟨(fst✝, gD), ⋯⟩ = ⟨(↾fun a ↦ ⟨((hom gD) ((hom Y.toSrc) a), (hom gD) ((hom Y.toTgt) a)), ⋯⟩, gD), ⋯⟩ Y:IrreflexiveGraphfst✝:Y.carrierA ⟶ F.carrierAgD:Y.carrierD ⟶ F.carrierDh_src:(fst✝, gD).2 ⊚ Y.toSrc = F.toSrc ⊚ (fst✝, gD).1h_tgt:(fst✝, gD).2 ⊚ Y.toTgt = F.toTgt ⊚ (fst✝, gD).1h:IsTricolouring Y gD⊢ (↑⟨(fst✝, gD), ⋯⟩).1 = (↑⟨(↾fun a ↦ ⟨((hom gD) ((hom Y.toSrc) a), (hom gD) ((hom Y.toTgt) a)), ⋯⟩, gD), ⋯⟩).1Y:IrreflexiveGraphfst✝:Y.carrierA ⟶ F.carrierAgD:Y.carrierD ⟶ F.carrierDh_src:(fst✝, gD).2 ⊚ Y.toSrc = F.toSrc ⊚ (fst✝, gD).1h_tgt:(fst✝, gD).2 ⊚ Y.toTgt = F.toTgt ⊚ (fst✝, gD).1h:IsTricolouring Y gD⊢ (↑⟨(fst✝, gD), ⋯⟩).2 = (↑⟨(↾fun a ↦ ⟨((hom gD) ((hom Y.toSrc) a), (hom gD) ((hom Y.toTgt) a)), ⋯⟩, gD), ⋯⟩).2 Y:IrreflexiveGraphfst✝:Y.carrierA ⟶ F.carrierAgD:Y.carrierD ⟶ F.carrierDh_src:(fst✝, gD).2 ⊚ Y.toSrc = F.toSrc ⊚ (fst✝, gD).1h_tgt:(fst✝, gD).2 ⊚ Y.toTgt = F.toTgt ⊚ (fst✝, gD).1h:IsTricolouring Y gD⊢ (↑⟨(fst✝, gD), ⋯⟩).1 = (↑⟨(↾fun a ↦ ⟨((hom gD) ((hom Y.toSrc) a), (hom gD) ((hom Y.toTgt) a)), ⋯⟩, gD), ⋯⟩).1 Y:IrreflexiveGraphfst✝:Y.carrierA ⟶ F.carrierAgD:Y.carrierD ⟶ F.carrierDh_src:(fst✝, gD).2 ⊚ Y.toSrc = F.toSrc ⊚ (fst✝, gD).1h_tgt:(fst✝, gD).2 ⊚ Y.toTgt = F.toTgt ⊚ (fst✝, gD).1h:IsTricolouring Y gDa:Y.carrierA⊢ (hom (↑⟨(fst✝, gD), ⋯⟩).1).toFun a = (hom (↑⟨(↾fun a ↦ ⟨((hom gD) ((hom Y.toSrc) a), (hom gD) ((hom Y.toTgt) a)), ⋯⟩, gD), ⋯⟩).1).toFun a Y:IrreflexiveGraphfst✝:Y.carrierA ⟶ F.carrierAgD:Y.carrierD ⟶ F.carrierDh_src:(fst✝, gD).2 ⊚ Y.toSrc = F.toSrc ⊚ (fst✝, gD).1h_tgt:(fst✝, gD).2 ⊚ Y.toTgt = F.toTgt ⊚ (fst✝, gD).1h:IsTricolouring Y gDa:Y.carrierA⊢ ↑((hom (↑⟨(fst✝, gD), ⋯⟩).1).toFun a) = ↑((hom (↑⟨(↾fun a ↦ ⟨((hom gD) ((hom Y.toSrc) a), (hom gD) ((hom Y.toTgt) a)), ⋯⟩, gD), ⋯⟩).1).toFun a) Y:IrreflexiveGraphfst✝:Y.carrierA ⟶ F.carrierAgD:Y.carrierD ⟶ F.carrierDh_src:(fst✝, gD).2 ⊚ Y.toSrc = F.toSrc ⊚ (fst✝, gD).1h_tgt:(fst✝, gD).2 ⊚ Y.toTgt = F.toTgt ⊚ (fst✝, gD).1h:IsTricolouring Y gDa:Y.carrierA⊢ (↑((hom (↑⟨(fst✝, gD), ⋯⟩).1).toFun a)).1 = (↑((hom (↑⟨(↾fun a ↦ ⟨((hom gD) ((hom Y.toSrc) a), (hom gD) ((hom Y.toTgt) a)), ⋯⟩, gD), ⋯⟩).1).toFun a)).1Y:IrreflexiveGraphfst✝:Y.carrierA ⟶ F.carrierAgD:Y.carrierD ⟶ F.carrierDh_src:(fst✝, gD).2 ⊚ Y.toSrc = F.toSrc ⊚ (fst✝, gD).1h_tgt:(fst✝, gD).2 ⊚ Y.toTgt = F.toTgt ⊚ (fst✝, gD).1h:IsTricolouring Y gDa:Y.carrierA⊢ (↑((hom (↑⟨(fst✝, gD), ⋯⟩).1).toFun a)).2 = (↑((hom (↑⟨(↾fun a ↦ ⟨((hom gD) ((hom Y.toSrc) a), (hom gD) ((hom Y.toTgt) a)), ⋯⟩, gD), ⋯⟩).1).toFun a)).2 Y:IrreflexiveGraphfst✝:Y.carrierA ⟶ F.carrierAgD:Y.carrierD ⟶ F.carrierDh_src:(fst✝, gD).2 ⊚ Y.toSrc = F.toSrc ⊚ (fst✝, gD).1h_tgt:(fst✝, gD).2 ⊚ Y.toTgt = F.toTgt ⊚ (fst✝, gD).1h:IsTricolouring Y gDa:Y.carrierA⊢ (↑((hom (↑⟨(fst✝, gD), ⋯⟩).1).toFun a)).1 = (↑((hom (↑⟨(↾fun a ↦ ⟨((hom gD) ((hom Y.toSrc) a), (hom gD) ((hom Y.toTgt) a)), ⋯⟩, gD), ⋯⟩).1).toFun a)).1 All goals completed! 🐙 Y:IrreflexiveGraphfst✝:Y.carrierA ⟶ F.carrierAgD:Y.carrierD ⟶ F.carrierDh_src:(fst✝, gD).2 ⊚ Y.toSrc = F.toSrc ⊚ (fst✝, gD).1h_tgt:(fst✝, gD).2 ⊚ Y.toTgt = F.toTgt ⊚ (fst✝, gD).1h:IsTricolouring Y gDa:Y.carrierA⊢ (↑((hom (↑⟨(fst✝, gD), ⋯⟩).1).toFun a)).2 = (↑((hom (↑⟨(↾fun a ↦ ⟨((hom gD) ((hom Y.toSrc) a), (hom gD) ((hom Y.toTgt) a)), ⋯⟩, gD), ⋯⟩).1).toFun a)).2 All goals completed! 🐙 Y:IrreflexiveGraphfst✝:Y.carrierA ⟶ F.carrierAgD:Y.carrierD ⟶ F.carrierDh_src:(fst✝, gD).2 ⊚ Y.toSrc = F.toSrc ⊚ (fst✝, gD).1h_tgt:(fst✝, gD).2 ⊚ Y.toTgt = F.toTgt ⊚ (fst✝, gD).1h:IsTricolouring Y gD⊢ (↑⟨(fst✝, gD), ⋯⟩).2 = (↑⟨(↾fun a ↦ ⟨((hom gD) ((hom Y.toSrc) a), (hom gD) ((hom Y.toTgt) a)), ⋯⟩, gD), ⋯⟩).2 All goals completed! 🐙
Exercise 4 (p. 273)

In this exercise, \mathbf{0} is the initial graph, with no dots (and, of course, no arrows)

abbrev IrreflexiveGraph.Zero : IrreflexiveGraph := emptyIG

and A_2 is the graph

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

Show that for each graph X:

(a) there is either a map {X \rightarrow \mathbf{0}} or a map {D \rightarrow X}, but not both; and

(b) there is either a map {X \rightarrow D} or {A \rightarrow X}, but not both; and

(c) there is either a map {X \rightarrow A} or {A_2 \rightarrow X}, but not both.

Can the sequence \mathbf{0}, D, A, A_2 be continued? That is, is there a graph C such that for each graph X

(d) there is either a map {X \rightarrow A_2} or {C \rightarrow X}, but not both?

Solution: Exercise 4

Our proof of part (a) relies on the fact that a map {X \rightarrow \mathbf{0}} can only exist if X has no dots, while a map {D \rightarrow X} can only exist if X has at least one dot.

open IrreflexiveGraph in example : ∀ X : IrreflexiveGraph, Xor (Nonempty (X ⟶ Zero)) (Nonempty (D ⟶ X)) := ⊢ ∀ (X : IrreflexiveGraph), Xor (Nonempty (X ⟶ IrreflexiveGraph.Zero)) (Nonempty (D ⟶ X)) X:IrreflexiveGraph⊢ Xor (Nonempty (X ⟶ IrreflexiveGraph.Zero)) (Nonempty (D ⟶ X)) X:IrreflexiveGraphh:Nonempty X.carrierD⊢ Xor (Nonempty (X ⟶ IrreflexiveGraph.Zero)) (Nonempty (D ⟶ X))X:IrreflexiveGraphh:¬Nonempty X.carrierD⊢ Xor (Nonempty (X ⟶ IrreflexiveGraph.Zero)) (Nonempty (D ⟶ X)) X:IrreflexiveGraphh:Nonempty X.carrierD⊢ Xor (Nonempty (X ⟶ IrreflexiveGraph.Zero)) (Nonempty (D ⟶ X)) X:IrreflexiveGraphh:Nonempty X.carrierD⊢ Nonempty (D ⟶ X) ∧ ¬Nonempty (X ⟶ IrreflexiveGraph.Zero) X:IrreflexiveGraphh:Nonempty X.carrierD⊢ Nonempty (D ⟶ X)X:IrreflexiveGraphh:Nonempty X.carrierD⊢ ¬Nonempty (X ⟶ IrreflexiveGraph.Zero) X:IrreflexiveGraphh:Nonempty X.carrierD⊢ Nonempty (D ⟶ X)X:IrreflexiveGraphh:Nonempty X.carrierD⊢ ¬Nonempty (X ⟶ IrreflexiveGraph.Zero) X:IrreflexiveGraphdX:X.carrierD⊢ ¬Nonempty (X ⟶ IrreflexiveGraph.Zero) X:IrreflexiveGraphdX:X.carrierD⊢ Nonempty (D ⟶ X) X:IrreflexiveGraphdX:X.carrierD⊢ (↾Empty.elim, ↾fun x ↦ dX).2 ⊚ D.toSrc = X.toSrc ⊚ (↾Empty.elim, ↾fun x ↦ dX).1X:IrreflexiveGraphdX:X.carrierD⊢ (↾Empty.elim, ↾fun x ↦ dX).2 ⊚ D.toTgt = X.toTgt ⊚ (↾Empty.elim, ↾fun x ↦ dX).1 all_goals X:IrreflexiveGraphdX:X.carrierDaD:D.carrierA⊢ (ConcreteCategory.hom ((↾Empty.elim, ↾fun x ↦ dX).2 ⊚ D.toTgt)).toFun aD = (ConcreteCategory.hom (X.toTgt ⊚ (↾Empty.elim, ↾fun x ↦ dX).1)).toFun aD All goals completed! 🐙 X:IrreflexiveGraphdX:X.carrierD⊢ ¬Nonempty (X ⟶ IrreflexiveGraph.Zero) X:IrreflexiveGraphdX:X.carrierDf:X ⟶ IrreflexiveGraph.Zero⊢ False All goals completed! 🐙 X:IrreflexiveGraphh:¬Nonempty X.carrierD⊢ Xor (Nonempty (X ⟶ IrreflexiveGraph.Zero)) (Nonempty (D ⟶ X)) X:IrreflexiveGraphh:¬Nonempty X.carrierD⊢ Nonempty (X ⟶ IrreflexiveGraph.Zero) ∧ ¬Nonempty (D ⟶ X) X:IrreflexiveGraphh:¬Nonempty X.carrierD⊢ Nonempty (X ⟶ IrreflexiveGraph.Zero)X:IrreflexiveGraphh:¬Nonempty X.carrierD⊢ ¬Nonempty (D ⟶ X) X:IrreflexiveGraphh:¬Nonempty X.carrierD⊢ Nonempty (X ⟶ IrreflexiveGraph.Zero) X:IrreflexiveGraphh:¬Nonempty X.carrierD⊢ (↾fun aX ↦ ⋯.elim, ↾fun dX ↦ ⋯.elim).2 ⊚ X.toSrc = IrreflexiveGraph.Zero.toSrc ⊚ (↾fun aX ↦ ⋯.elim, ↾fun dX ↦ ⋯.elim).1X:IrreflexiveGraphh:¬Nonempty X.carrierD⊢ (↾fun aX ↦ ⋯.elim, ↾fun dX ↦ ⋯.elim).2 ⊚ X.toTgt = IrreflexiveGraph.Zero.toTgt ⊚ (↾fun aX ↦ ⋯.elim, ↾fun dX ↦ ⋯.elim).1 all_goals X:IrreflexiveGraphh:¬Nonempty X.carrierDaX:X.carrierA⊢ (ConcreteCategory.hom ((↾fun aX ↦ ⋯.elim, ↾fun dX ↦ ⋯.elim).2 ⊚ X.toTgt)).toFun aX = (ConcreteCategory.hom (IrreflexiveGraph.Zero.toTgt ⊚ (↾fun aX ↦ ⋯.elim, ↾fun dX ↦ ⋯.elim).1)).toFun aX X:IrreflexiveGraphh:¬Nonempty X.carrierDaX:X.carrierA⊢ (ConcreteCategory.hom ((↾fun aX ↦ ⋯.elim, ↾fun dX ↦ ⋯.elim).2 ⊚ X.toSrc)).toFun aX = (ConcreteCategory.hom (IrreflexiveGraph.Zero.toSrc ⊚ (↾fun aX ↦ ⋯.elim, ↾fun dX ↦ ⋯.elim).1)).toFun aX All goals completed! 🐙 X:IrreflexiveGraphh:¬Nonempty X.carrierDaX:X.carrierA⊢ (ConcreteCategory.hom ((↾fun aX ↦ ⋯.elim, ↾fun dX ↦ ⋯.elim).2 ⊚ X.toTgt)).toFun aX = (ConcreteCategory.hom (IrreflexiveGraph.Zero.toTgt ⊚ (↾fun aX ↦ ⋯.elim, ↾fun dX ↦ ⋯.elim).1)).toFun aX All goals completed! 🐙 X:IrreflexiveGraphh:¬Nonempty X.carrierD⊢ ¬Nonempty (D ⟶ X) X:IrreflexiveGraphh:¬Nonempty X.carrierDg:D ⟶ X⊢ False All goals completed! 🐙

Our proof of part (b) follows a similar approach to that of part (a) but relies instead on reasoning about the existence of arrows in X.

open IrreflexiveGraph in example : ∀ X : IrreflexiveGraph, Xor (Nonempty (X ⟶ D)) (Nonempty (A ⟶ X)) := ⊢ ∀ (X : IrreflexiveGraph), Xor (Nonempty (X ⟶ D)) (Nonempty (A ⟶ X)) X:IrreflexiveGraph⊢ Xor (Nonempty (X ⟶ D)) (Nonempty (A ⟶ X)) X:IrreflexiveGraphh:Nonempty X.carrierA⊢ Xor (Nonempty (X ⟶ D)) (Nonempty (A ⟶ X))X:IrreflexiveGraphh:¬Nonempty X.carrierA⊢ Xor (Nonempty (X ⟶ D)) (Nonempty (A ⟶ X)) X:IrreflexiveGraphh:Nonempty X.carrierA⊢ Xor (Nonempty (X ⟶ D)) (Nonempty (A ⟶ X)) X:IrreflexiveGraphh:Nonempty X.carrierA⊢ Nonempty (A ⟶ X) ∧ ¬Nonempty (X ⟶ D) X:IrreflexiveGraphh:Nonempty X.carrierA⊢ Nonempty (A ⟶ X)X:IrreflexiveGraphh:Nonempty X.carrierA⊢ ¬Nonempty (X ⟶ D) X:IrreflexiveGraphh:Nonempty X.carrierA⊢ Nonempty (A ⟶ X)X:IrreflexiveGraphh:Nonempty X.carrierA⊢ ¬Nonempty (X ⟶ D) X:IrreflexiveGraphaX:X.carrierA⊢ ¬Nonempty (X ⟶ D) X:IrreflexiveGraphaX:X.carrierA⊢ Nonempty (A ⟶ X) X:IrreflexiveGraphaX:X.carrierA⊢ (↾fun x ↦ aX, ↾fun x ↦ match x with | 0 => (ConcreteCategory.hom X.toSrc) aX | 1 => (ConcreteCategory.hom X.toTgt) aX).2 ⊚ A.toSrc = X.toSrc ⊚ (↾fun x ↦ aX, ↾fun x ↦ match x with | 0 => (ConcreteCategory.hom X.toSrc) aX | 1 => (ConcreteCategory.hom X.toTgt) aX).1X:IrreflexiveGraphaX:X.carrierA⊢ (↾fun x ↦ aX, ↾fun x ↦ match x with | 0 => (ConcreteCategory.hom X.toSrc) aX | 1 => (ConcreteCategory.hom X.toTgt) aX).2 ⊚ A.toTgt = X.toTgt ⊚ (↾fun x ↦ aX, ↾fun x ↦ match x with | 0 => (ConcreteCategory.hom X.toSrc) aX | 1 => (ConcreteCategory.hom X.toTgt) aX).1 all_goals X:IrreflexiveGraphaX:X.carrierAaA:A.carrierA⊢ (ConcreteCategory.hom ((↾fun x ↦ aX, ↾fun x ↦ match x with | 0 => (ConcreteCategory.hom X.toSrc) aX | 1 => (ConcreteCategory.hom X.toTgt) aX).2 ⊚ A.toTgt)).toFun aA = (ConcreteCategory.hom (X.toTgt ⊚ (↾fun x ↦ aX, ↾fun x ↦ match x with | 0 => (ConcreteCategory.hom X.toSrc) aX | 1 => (ConcreteCategory.hom X.toTgt) aX).1)).toFun aA All goals completed! 🐙 X:IrreflexiveGraphaX:X.carrierA⊢ ¬Nonempty (X ⟶ D) X:IrreflexiveGraphaX:X.carrierAf:X ⟶ D⊢ False All goals completed! 🐙 X:IrreflexiveGraphh:¬Nonempty X.carrierA⊢ Xor (Nonempty (X ⟶ D)) (Nonempty (A ⟶ X)) X:IrreflexiveGraphh:¬Nonempty X.carrierA⊢ Nonempty (X ⟶ D) ∧ ¬Nonempty (A ⟶ X) X:IrreflexiveGraphh:IsEmpty X.carrierA⊢ Nonempty (X ⟶ D) ∧ ¬Nonempty (A ⟶ X) X:IrreflexiveGraphh:IsEmpty X.carrierA⊢ Nonempty (X ⟶ D)X:IrreflexiveGraphh:IsEmpty X.carrierA⊢ ¬Nonempty (A ⟶ X) X:IrreflexiveGraphh:IsEmpty X.carrierA⊢ Nonempty (X ⟶ D) X:IrreflexiveGraphh:IsEmpty X.carrierA⊢ (↾fun aX ↦ h.elim aX, ↾fun x ↦ ()).2 ⊚ X.toSrc = D.toSrc ⊚ (↾fun aX ↦ h.elim aX, ↾fun x ↦ ()).1X:IrreflexiveGraphh:IsEmpty X.carrierA⊢ (↾fun aX ↦ h.elim aX, ↾fun x ↦ ()).2 ⊚ X.toTgt = D.toTgt ⊚ (↾fun aX ↦ h.elim aX, ↾fun x ↦ ()).1 all_goals All goals completed! 🐙 X:IrreflexiveGraphh:IsEmpty X.carrierA⊢ ¬Nonempty (A ⟶ X) X:IrreflexiveGraphh:IsEmpty X.carrierAg:A ⟶ X⊢ False All goals completed! 🐙

Our proof of part (c) again follows a similar approach but relies this time on reasoning about the existence of a path of length two in X.

open IrreflexiveGraph ConcreteCategory in example : ∀ X : IrreflexiveGraph, Xor (Nonempty (X ⟶ A)) (Nonempty (A₂ ⟶ X)) := ⊢ ∀ (X : IrreflexiveGraph), Xor (Nonempty (X ⟶ A)) (Nonempty (A₂ ⟶ X)) X:IrreflexiveGraph⊢ Xor (Nonempty (X ⟶ A)) (Nonempty (A₂ ⟶ X)) X:IrreflexiveGraphh:∃ a₁ a₂, (hom X.toSrc) a₂ = (hom X.toTgt) a₁⊢ Xor (Nonempty (X ⟶ A)) (Nonempty (A₂ ⟶ X))X:IrreflexiveGraphh:¬∃ a₁ a₂, (hom X.toSrc) a₂ = (hom X.toTgt) a₁⊢ Xor (Nonempty (X ⟶ A)) (Nonempty (A₂ ⟶ X)) X:IrreflexiveGraphh:∃ a₁ a₂, (hom X.toSrc) a₂ = (hom X.toTgt) a₁⊢ Xor (Nonempty (X ⟶ A)) (Nonempty (A₂ ⟶ X)) X:IrreflexiveGraphh:∃ a₁ a₂, (hom X.toSrc) a₂ = (hom X.toTgt) a₁⊢ Nonempty (A₂ ⟶ X) ∧ ¬Nonempty (X ⟶ A) X:IrreflexiveGraphh:∃ a₁ a₂, (hom X.toSrc) a₂ = (hom X.toTgt) a₁⊢ Nonempty (A₂ ⟶ X)X:IrreflexiveGraphh:∃ a₁ a₂, (hom X.toSrc) a₂ = (hom X.toTgt) a₁⊢ ¬Nonempty (X ⟶ A) X:IrreflexiveGraphh:∃ a₁ a₂, (hom X.toSrc) a₂ = (hom X.toTgt) a₁⊢ Nonempty (A₂ ⟶ X)X:IrreflexiveGraphh:∃ a₁ a₂, (hom X.toSrc) a₂ = (hom X.toTgt) a₁⊢ ¬Nonempty (X ⟶ A) X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁⊢ ¬Nonempty (X ⟶ A) X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁⊢ Nonempty (A₂ ⟶ X) X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁⊢ (↾fun x ↦ match x with | 0 => aX₁ | 1 => aX₂, ↾fun x ↦ match x with | 0 => (hom X.toSrc) aX₁ | 1 => (hom X.toSrc) aX₂ | 2 => (hom X.toTgt) aX₂).2 ⊚ A₂.toSrc = X.toSrc ⊚ (↾fun x ↦ match x with | 0 => aX₁ | 1 => aX₂, ↾fun x ↦ match x with | 0 => (hom X.toSrc) aX₁ | 1 => (hom X.toSrc) aX₂ | 2 => (hom X.toTgt) aX₂).1X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁⊢ (↾fun x ↦ match x with | 0 => aX₁ | 1 => aX₂, ↾fun x ↦ match x with | 0 => (hom X.toSrc) aX₁ | 1 => (hom X.toSrc) aX₂ | 2 => (hom X.toTgt) aX₂).2 ⊚ A₂.toTgt = X.toTgt ⊚ (↾fun x ↦ match x with | 0 => aX₁ | 1 => aX₂, ↾fun x ↦ match x with | 0 => (hom X.toSrc) aX₁ | 1 => (hom X.toSrc) aX₂ | 2 => (hom X.toTgt) aX₂).1 all_goals X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁aA2:A₂.carrierA⊢ (hom ((↾fun x ↦ match x with | 0 => aX₁ | 1 => aX₂, ↾fun x ↦ match x with | 0 => (hom X.toSrc) aX₁ | 1 => (hom X.toSrc) aX₂ | 2 => (hom X.toTgt) aX₂).2 ⊚ A₂.toTgt)).toFun aA2 = (hom (X.toTgt ⊚ (↾fun x ↦ match x with | 0 => aX₁ | 1 => aX₂, ↾fun x ↦ match x with | 0 => (hom X.toSrc) aX₁ | 1 => (hom X.toSrc) aX₂ | 2 => (hom X.toTgt) aX₂).1)).toFun aA2 X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁aA2:Fin 2⊢ (hom ((↾fun x ↦ match x with | 0 => aX₁ | 1 => aX₂, ↾fun x ↦ match x with | 0 => (hom X.toSrc) aX₁ | 1 => (hom X.toSrc) aX₂ | 2 => (hom X.toTgt) aX₂).2 ⊚ A₂.toTgt)).toFun aA2 = (hom (X.toTgt ⊚ (↾fun x ↦ match x with | 0 => aX₁ | 1 => aX₂, ↾fun x ↦ match x with | 0 => (hom X.toSrc) aX₁ | 1 => (hom X.toSrc) aX₂ | 2 => (hom X.toTgt) aX₂).1)).toFun aA2 X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁⊢ (hom ((↾fun x ↦ match x with | 0 => aX₁ | 1 => aX₂, ↾fun x ↦ match x with | 0 => (hom X.toSrc) aX₁ | 1 => (hom X.toSrc) aX₂ | 2 => (hom X.toTgt) aX₂).2 ⊚ A₂.toTgt)).toFun ((fun i ↦ i) ⟨0, ⋯⟩) = (hom (X.toTgt ⊚ (↾fun x ↦ match x with | 0 => aX₁ | 1 => aX₂, ↾fun x ↦ match x with | 0 => (hom X.toSrc) aX₁ | 1 => (hom X.toSrc) aX₂ | 2 => (hom X.toTgt) aX₂).1)).toFun ((fun i ↦ i) ⟨0, ⋯⟩)X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁⊢ (hom ((↾fun x ↦ match x with | 0 => aX₁ | 1 => aX₂, ↾fun x ↦ match x with | 0 => (hom X.toSrc) aX₁ | 1 => (hom X.toSrc) aX₂ | 2 => (hom X.toTgt) aX₂).2 ⊚ A₂.toTgt)).toFun ((fun i ↦ i) ⟨1, ⋯⟩) = (hom (X.toTgt ⊚ (↾fun x ↦ match x with | 0 => aX₁ | 1 => aX₂, ↾fun x ↦ match x with | 0 => (hom X.toSrc) aX₁ | 1 => (hom X.toSrc) aX₂ | 2 => (hom X.toTgt) aX₂).1)).toFun ((fun i ↦ i) ⟨1, ⋯⟩) try (X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁⊢ (hom ((↾fun x ↦ match x with | 0 => aX₁ | 1 => aX₂, ↾fun x ↦ match x with | 0 => (hom X.toSrc) aX₁ | 1 => (hom X.toTgt) aX₁ | 2 => (hom X.toTgt) aX₂).2 ⊚ A₂.toTgt)).toFun ((fun i ↦ i) ⟨0, ⋯⟩) = (hom (X.toTgt ⊚ (↾fun x ↦ match x with | 0 => aX₁ | 1 => aX₂, ↾fun x ↦ match x with | 0 => (hom X.toSrc) aX₁ | 1 => (hom X.toTgt) aX₁ | 2 => (hom X.toTgt) aX₂).1)).toFun ((fun i ↦ i) ⟨0, ⋯⟩)X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁⊢ (hom ((↾fun x ↦ match x with | 0 => aX₁ | 1 => aX₂, ↾fun x ↦ match x with | 0 => (hom X.toSrc) aX₁ | 1 => (hom X.toSrc) aX₂ | 2 => (hom X.toTgt) aX₂).2 ⊚ A₂.toTgt)).toFun ((fun i ↦ i) ⟨1, ⋯⟩) = (hom (X.toTgt ⊚ (↾fun x ↦ match x with | 0 => aX₁ | 1 => aX₂, ↾fun x ↦ match x with | 0 => (hom X.toSrc) aX₁ | 1 => (hom X.toSrc) aX₂ | 2 => (hom X.toTgt) aX₂).1)).toFun ((fun i ↦ i) ⟨1, ⋯⟩); X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁⊢ (hom ((↾fun x ↦ match x with | 0 => aX₁ | 1 => aX₂, ↾fun x ↦ match x with | 0 => (hom X.toSrc) aX₁ | 1 => (hom X.toSrc) aX₂ | 2 => (hom X.toTgt) aX₂).2 ⊚ A₂.toTgt)).toFun ((fun i ↦ i) ⟨1, ⋯⟩) = (hom (X.toTgt ⊚ (↾fun x ↦ match x with | 0 => aX₁ | 1 => aX₂, ↾fun x ↦ match x with | 0 => (hom X.toSrc) aX₁ | 1 => (hom X.toSrc) aX₂ | 2 => (hom X.toTgt) aX₂).1)).toFun ((fun i ↦ i) ⟨1, ⋯⟩)) All goals completed! 🐙 X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁⊢ ¬Nonempty (X ⟶ A) X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁f:X ⟶ A⊢ False X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁f:X ⟶ Ah_src:(hom (↑f).2) ((hom X.toSrc) aX₂) = (hom A.toSrc) ((hom (↑f).1) aX₂)⊢ False X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁f:X ⟶ Ah_src:(hom (↑f).2) ((hom X.toSrc) aX₂) = (hom A.toSrc) ((hom (↑f).1) aX₂)h_tgt:(hom (↑f).2) ((hom X.toTgt) aX₁) = (hom A.toTgt) ((hom (↑f).1) aX₁)⊢ False X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁f:X ⟶ Ah_src:(hom A.toTgt) ((hom (↑f).1) aX₁) = (hom A.toSrc) ((hom (↑f).1) aX₂)h_tgt:(hom (↑f).2) ((hom X.toTgt) aX₁) = (hom A.toTgt) ((hom (↑f).1) aX₁)⊢ False X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁f:X ⟶ Ah_tgt:(hom (↑f).2) ((hom X.toTgt) aX₁) = (hom A.toTgt) ((hom (↑f).1) aX₁)h_src:1 = 0⊢ False All goals completed! 🐙 X:IrreflexiveGraphh:¬∃ a₁ a₂, (hom X.toSrc) a₂ = (hom X.toTgt) a₁⊢ Xor (Nonempty (X ⟶ A)) (Nonempty (A₂ ⟶ X)) X:IrreflexiveGraphh:¬∃ a₁ a₂, (hom X.toSrc) a₂ = (hom X.toTgt) a₁⊢ Nonempty (X ⟶ A) ∧ ¬Nonempty (A₂ ⟶ X) X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁⊢ Nonempty (X ⟶ A) ∧ ¬Nonempty (A₂ ⟶ X) X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁⊢ Nonempty (X ⟶ A)X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁⊢ ¬Nonempty (A₂ ⟶ X) X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁⊢ Nonempty (X ⟶ A) classical X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁⊢ (↾fun x ↦ (), ↾fun dX ↦ if ∃ aX, (hom X.toTgt) aX = dX then 1 else 0).2 ⊚ X.toSrc = A.toSrc ⊚ (↾fun x ↦ (), ↾fun dX ↦ if ∃ aX, (hom X.toTgt) aX = dX then 1 else 0).1X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁⊢ (↾fun x ↦ (), ↾fun dX ↦ if ∃ aX, (hom X.toTgt) aX = dX then 1 else 0).2 ⊚ X.toTgt = A.toTgt ⊚ (↾fun x ↦ (), ↾fun dX ↦ if ∃ aX, (hom X.toTgt) aX = dX then 1 else 0).1 all_goals X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁aX:X.carrierA⊢ ↑((hom ((↾fun x ↦ (), ↾fun dX ↦ if ∃ aX, (hom X.toTgt) aX = dX then 1 else 0).2 ⊚ X.toTgt)).toFun aX) = ↑((hom (A.toTgt ⊚ (↾fun x ↦ (), ↾fun dX ↦ if ∃ aX, (hom X.toTgt) aX = dX then 1 else 0).1)).toFun aX) X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁aX:X.carrierA⊢ ↑((hom ((↾fun x ↦ (), ↾fun dX ↦ if ∃ aX, (hom X.toTgt) aX = dX then 1 else 0).2 ⊚ X.toSrc)).toFun aX) = ↑((hom (A.toSrc ⊚ (↾fun x ↦ (), ↾fun dX ↦ if ∃ aX, (hom X.toTgt) aX = dX then 1 else 0).1)).toFun aX) X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁aX:X.carrierA⊢ ↑(if ∃ aX_1, (hom X.toTgt) aX_1 = (hom X.toSrc) aX then 1 else 0) = 0 X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁aX:X.carrierAhc:∃ aX_1, (hom X.toTgt) aX_1 = (hom X.toSrc) aX⊢ ↑1 = 0X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁aX:X.carrierAhc:¬∃ aX_1, (hom X.toTgt) aX_1 = (hom X.toSrc) aX⊢ ↑0 = 0 X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁aX:X.carrierAhc:∃ aX_1, (hom X.toTgt) aX_1 = (hom X.toSrc) aX⊢ ↑1 = 0 X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁aX:X.carrierAa:X.carrierAha:(hom X.toTgt) a = (hom X.toSrc) aX⊢ ↑1 = 0 All goals completed! 🐙 X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁aX:X.carrierAhc:¬∃ aX_1, (hom X.toTgt) aX_1 = (hom X.toSrc) aX⊢ ↑0 = 0 All goals completed! 🐙 X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁aX:X.carrierA⊢ ↑((hom ((↾fun x ↦ (), ↾fun dX ↦ if ∃ aX, (hom X.toTgt) aX = dX then 1 else 0).2 ⊚ X.toTgt)).toFun aX) = ↑((hom (A.toTgt ⊚ (↾fun x ↦ (), ↾fun dX ↦ if ∃ aX, (hom X.toTgt) aX = dX then 1 else 0).1)).toFun aX) X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁aX:X.carrierA⊢ ↑(if ∃ aX_1, (hom X.toTgt) aX_1 = (hom X.toTgt) aX then 1 else 0) = 1 X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁aX:X.carrierAhc:∃ aX_1, (hom X.toTgt) aX_1 = (hom X.toTgt) aX⊢ ↑1 = 1X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁aX:X.carrierAhc:¬∃ aX_1, (hom X.toTgt) aX_1 = (hom X.toTgt) aX⊢ ↑0 = 1 X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁aX:X.carrierAhc:∃ aX_1, (hom X.toTgt) aX_1 = (hom X.toTgt) aX⊢ ↑1 = 1 All goals completed! 🐙 X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁aX:X.carrierAhc:¬∃ aX_1, (hom X.toTgt) aX_1 = (hom X.toTgt) aX⊢ ↑0 = 1 All goals completed! 🐙 X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁⊢ ¬Nonempty (A₂ ⟶ X) X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁g:A₂ ⟶ X⊢ False X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁g:A₂ ⟶ Xh_src:(hom ((↑g).2 ⊚ A₂.toSrc)) 1 = (hom (X.toSrc ⊚ (↑g).1)) 1⊢ False X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁g:A₂ ⟶ Xh_src:(hom ((↑g).2 ⊚ A₂.toSrc)) 1 = (hom (X.toSrc ⊚ (↑g).1)) 1h_tgt:(hom ((↑g).2 ⊚ A₂.toTgt)) 0 = (hom (X.toTgt ⊚ (↑g).1)) 0⊢ False X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁g:A₂ ⟶ Xh_src:(hom ((↑g).2 ⊚ A₂.toSrc)) 1 = (hom (X.toSrc ⊚ (↑g).1)) 1h_tgt:(hom ((↑g).2 ⊚ A₂.toTgt)) 0 = (hom (X.toTgt ⊚ (↑g).1)) 0this:(hom (X.toSrc ⊚ (↑g).1)) 1 = (hom (X.toTgt ⊚ (↑g).1)) 0⊢ False All goals completed! 🐙

TODO Exercise 25.4 (d)

2. Calculating the graphs A ⨯ Y🔗

Exercise 5 (p. 274)

In this exercise, {B =}

def B : IrreflexiveGraph := { carrierA := Fin 2 carrierD := Fin 3 toSrc := ↾fun | 0 => 0 | 1 => 1 toTgt := ↾fun | 0 => 1 | 1 => 2 }

and {C =}

def C : IrreflexiveGraph := { carrierA := Fin 2 carrierD := Fin 3 toSrc := ↾fun | 0 => 0 | 1 => 1 toTgt := ↾fun | 0 => 1 | 1 => 0 }

Show that B is not isomorphic to C, but that {A \times B} is isomorphic to {A \times C}. (We already know examples of the 'failure of cancellation': {\mathbf{0} \times X} and {\mathbf{0} \times Y} are isomorphic for every X and Y; we also saw that {D \times A} is isomorphic to {D \times \mathbf{2}}. This exercise shows that cancellation can fail even when the factor we want to cancel is more 'substantial'.)

Solution: Exercise 5

We show that B is not isomorphic to C by proving that there is no valid morphism from C to B.

open ConcreteCategory in example : IsEmpty (B ≅ C) := ⊢ IsEmpty (B ≅ C) ⊢ ∀ (a : B ≅ C), False hom✝:B ⟶ Cg:C ⟶ Bhom_inv_id✝:g ⊚ hom✝ = 𝟙 Binv_hom_id✝:hom✝ ⊚ g = 𝟙 C⊢ False hom✝:B ⟶ Cg:C ⟶ Bhom_inv_id✝:g ⊚ hom✝ = 𝟙 Binv_hom_id✝:hom✝ ⊚ g = 𝟙 Ch_false:∀ (gA : Fin 2 → Fin 2) (gD : Fin 3 → Fin 3), (∀ (a : Fin 2), gD ((fun x ↦ match x with | 0 => 0 | 1 => 1) a) = (fun x ↦ match x with | 0 => 0 | 1 => 1) (gA a)) → (∀ (a : Fin 2), gD ((fun x ↦ match x with | 0 => 1 | 1 => 0) a) = (fun x ↦ match x with | 0 => 1 | 1 => 2) (gA a)) → False⊢ False All goals completed! 🐙

To show that {A \times B} is isomorphic to {A \times C}, we first extend our IrreflexiveGraph category to allow use of the infix operator ⨯ for the categorical product.

def IrreflexiveGraph.prodObj (X Y : IrreflexiveGraph) : IrreflexiveGraph := { carrierA := X.carrierA × Y.carrierA carrierD := X.carrierD × Y.carrierD toSrc := ↾fun p ↦ (X.toSrc p.1, Y.toSrc p.2) toTgt := ↾fun p ↦ (X.toTgt p.1, Y.toTgt p.2) } def IrreflexiveGraph.fstHom (X Y : IrreflexiveGraph) : prodObj X Y ⟶ X := ⟨(↾Prod.fst, ↾Prod.fst), ⟨rfl, rfl⟩⟩ def IrreflexiveGraph.sndHom (X Y : IrreflexiveGraph) : prodObj X Y ⟶ Y := ⟨(↾Prod.snd, ↾Prod.snd), ⟨rfl, rfl⟩⟩ def IrreflexiveGraph.binaryFan (X Y : IrreflexiveGraph) : BinaryFan X Y := BinaryFan.mk (fstHom X Y) (sndHom X Y) open ConcreteCategory in def IrreflexiveGraph.isLimit (X Y : IrreflexiveGraph) : IsLimit (binaryFan X Y) := BinaryFan.isLimitMk (fun s ↦ ⟨ (↾fun a ↦ (s.fst.val.1 a, s.snd.val.1 a), ↾fun d ↦ (s.fst.val.2 d, s.snd.val.2 d)), X:IrreflexiveGraphY:IrreflexiveGraphs:BinaryFan X Y⊢ (↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).2 ⊚ s.pt.toSrc = (X.prodObj Y).toSrc ⊚ (↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).1 ∧ (↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).2 ⊚ s.pt.toTgt = (X.prodObj Y).toTgt ⊚ (↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).1 X:IrreflexiveGraphY:IrreflexiveGraphs:BinaryFan X Y⊢ (↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).2 ⊚ s.pt.toSrc = (X.prodObj Y).toSrc ⊚ (↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).1X:IrreflexiveGraphY:IrreflexiveGraphs:BinaryFan X Y⊢ (↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).2 ⊚ s.pt.toTgt = (X.prodObj Y).toTgt ⊚ (↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).1 X:IrreflexiveGraphY:IrreflexiveGraphs:BinaryFan X Y⊢ (↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).2 ⊚ s.pt.toSrc = (X.prodObj Y).toSrc ⊚ (↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).1X:IrreflexiveGraphY:IrreflexiveGraphs:BinaryFan X Y⊢ (↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).2 ⊚ s.pt.toTgt = (X.prodObj Y).toTgt ⊚ (↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).1 (X:IrreflexiveGraphY:IrreflexiveGraphs:BinaryFan X Ya:s.pt.carrierA⊢ (hom ((↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).2 ⊚ s.pt.toTgt)).toFun a = (hom ((X.prodObj Y).toTgt ⊚ (↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).1)).toFun a; X:IrreflexiveGraphY:IrreflexiveGraphs:BinaryFan X Ya:s.pt.carrierA⊢ ((hom ((↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).2 ⊚ s.pt.toTgt)).toFun a).1 = ((hom ((X.prodObj Y).toTgt ⊚ (↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).1)).toFun a).1X:IrreflexiveGraphY:IrreflexiveGraphs:BinaryFan X Ya:s.pt.carrierA⊢ ((hom ((↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).2 ⊚ s.pt.toTgt)).toFun a).2 = ((hom ((X.prodObj Y).toTgt ⊚ (↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).1)).toFun a).2) X:IrreflexiveGraphY:IrreflexiveGraphs:BinaryFan X Ya:s.pt.carrierA⊢ ((hom ((↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).2 ⊚ s.pt.toSrc)).toFun a).1 = ((hom ((X.prodObj Y).toSrc ⊚ (↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).1)).toFun a).1 All goals completed! 🐙 X:IrreflexiveGraphY:IrreflexiveGraphs:BinaryFan X Ya:s.pt.carrierA⊢ ((hom ((↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).2 ⊚ s.pt.toSrc)).toFun a).2 = ((hom ((X.prodObj Y).toSrc ⊚ (↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).1)).toFun a).2 All goals completed! 🐙 X:IrreflexiveGraphY:IrreflexiveGraphs:BinaryFan X Ya:s.pt.carrierA⊢ ((hom ((↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).2 ⊚ s.pt.toTgt)).toFun a).1 = ((hom ((X.prodObj Y).toTgt ⊚ (↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).1)).toFun a).1 All goals completed! 🐙 X:IrreflexiveGraphY:IrreflexiveGraphs:BinaryFan X Ya:s.pt.carrierA⊢ ((hom ((↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).2 ⊚ s.pt.toTgt)).toFun a).2 = ((hom ((X.prodObj Y).toTgt ⊚ (↾fun a ↦ ((hom (↑s.fst).1) a, (hom (↑s.snd).1) a), ↾fun d ↦ ((hom (↑s.fst).2) d, (hom (↑s.snd).2) d)).1)).toFun a).2 All goals completed! 🐙⟩) (fun _ ↦ X:IrreflexiveGraphY:IrreflexiveGraphx✝:BinaryFan X Y⊢ X.fstHom Y ⊚ ⟨(↾fun a ↦ ((hom (↑x✝.fst).1) a, (hom (↑x✝.snd).1) a), ↾fun d ↦ ((hom (↑x✝.fst).2) d, (hom (↑x✝.snd).2) d)), ⋯⟩ = x✝.fst X:IrreflexiveGraphY:IrreflexiveGraphx✝:BinaryFan X Y⊢ (↑(X.fstHom Y ⊚ ⟨(↾fun a ↦ ((hom (↑x✝.fst).1) a, (hom (↑x✝.snd).1) a), ↾fun d ↦ ((hom (↑x✝.fst).2) d, (hom (↑x✝.snd).2) d)), ⋯⟩)).1 = (↑x✝.fst).1X:IrreflexiveGraphY:IrreflexiveGraphx✝:BinaryFan X Y⊢ (↑(X.fstHom Y ⊚ ⟨(↾fun a ↦ ((hom (↑x✝.fst).1) a, (hom (↑x✝.snd).1) a), ↾fun d ↦ ((hom (↑x✝.fst).2) d, (hom (↑x✝.snd).2) d)), ⋯⟩)).2 = (↑x✝.fst).2 X:IrreflexiveGraphY:IrreflexiveGraphx✝:BinaryFan X Y⊢ (↑(X.fstHom Y ⊚ ⟨(↾fun a ↦ ((hom (↑x✝.fst).1) a, (hom (↑x✝.snd).1) a), ↾fun d ↦ ((hom (↑x✝.fst).2) d, (hom (↑x✝.snd).2) d)), ⋯⟩)).1 = (↑x✝.fst).1X:IrreflexiveGraphY:IrreflexiveGraphx✝:BinaryFan X Y⊢ (↑(X.fstHom Y ⊚ ⟨(↾fun a ↦ ((hom (↑x✝.fst).1) a, (hom (↑x✝.snd).1) a), ↾fun d ↦ ((hom (↑x✝.fst).2) d, (hom (↑x✝.snd).2) d)), ⋯⟩)).2 = (↑x✝.fst).2 All goals completed! 🐙) (fun _ ↦ X:IrreflexiveGraphY:IrreflexiveGraphx✝:BinaryFan X Y⊢ X.sndHom Y ⊚ ⟨(↾fun a ↦ ((hom (↑x✝.fst).1) a, (hom (↑x✝.snd).1) a), ↾fun d ↦ ((hom (↑x✝.fst).2) d, (hom (↑x✝.snd).2) d)), ⋯⟩ = x✝.snd X:IrreflexiveGraphY:IrreflexiveGraphx✝:BinaryFan X Y⊢ (↑(X.sndHom Y ⊚ ⟨(↾fun a ↦ ((hom (↑x✝.fst).1) a, (hom (↑x✝.snd).1) a), ↾fun d ↦ ((hom (↑x✝.fst).2) d, (hom (↑x✝.snd).2) d)), ⋯⟩)).1 = (↑x✝.snd).1X:IrreflexiveGraphY:IrreflexiveGraphx✝:BinaryFan X Y⊢ (↑(X.sndHom Y ⊚ ⟨(↾fun a ↦ ((hom (↑x✝.fst).1) a, (hom (↑x✝.snd).1) a), ↾fun d ↦ ((hom (↑x✝.fst).2) d, (hom (↑x✝.snd).2) d)), ⋯⟩)).2 = (↑x✝.snd).2 X:IrreflexiveGraphY:IrreflexiveGraphx✝:BinaryFan X Y⊢ (↑(X.sndHom Y ⊚ ⟨(↾fun a ↦ ((hom (↑x✝.fst).1) a, (hom (↑x✝.snd).1) a), ↾fun d ↦ ((hom (↑x✝.fst).2) d, (hom (↑x✝.snd).2) d)), ⋯⟩)).1 = (↑x✝.snd).1X:IrreflexiveGraphY:IrreflexiveGraphx✝:BinaryFan X Y⊢ (↑(X.sndHom Y ⊚ ⟨(↾fun a ↦ ((hom (↑x✝.fst).1) a, (hom (↑x✝.snd).1) a), ↾fun d ↦ ((hom (↑x✝.fst).2) d, (hom (↑x✝.snd).2) d)), ⋯⟩)).2 = (↑x✝.snd).2 All goals completed! 🐙) (fun _ _ hm₁ hm₂ ↦ X:IrreflexiveGraphY:IrreflexiveGraphx✝¹:BinaryFan X Yx✝:x✝¹.pt ⟶ X.prodObj Yhm₁:X.fstHom Y ⊚ x✝ = x✝¹.fsthm₂:X.sndHom Y ⊚ x✝ = x✝¹.snd⊢ x✝ = ⟨(↾fun a ↦ ((hom (↑x✝¹.fst).1) a, (hom (↑x✝¹.snd).1) a), ↾fun d ↦ ((hom (↑x✝¹.fst).2) d, (hom (↑x✝¹.snd).2) d)), ⋯⟩ X:IrreflexiveGraphY:IrreflexiveGraphx✝¹:BinaryFan X Yx✝:x✝¹.pt ⟶ X.prodObj Yhm₁:X.fstHom Y ⊚ x✝ = x✝¹.fsthm₂:X.sndHom Y ⊚ x✝ = x✝¹.snd⊢ (↑x✝).1 = (↑⟨(↾fun a ↦ ((hom (↑x✝¹.fst).1) a, (hom (↑x✝¹.snd).1) a), ↾fun d ↦ ((hom (↑x✝¹.fst).2) d, (hom (↑x✝¹.snd).2) d)), ⋯⟩).1X:IrreflexiveGraphY:IrreflexiveGraphx✝¹:BinaryFan X Yx✝:x✝¹.pt ⟶ X.prodObj Yhm₁:X.fstHom Y ⊚ x✝ = x✝¹.fsthm₂:X.sndHom Y ⊚ x✝ = x✝¹.snd⊢ (↑x✝).2 = (↑⟨(↾fun a ↦ ((hom (↑x✝¹.fst).1) a, (hom (↑x✝¹.snd).1) a), ↾fun d ↦ ((hom (↑x✝¹.fst).2) d, (hom (↑x✝¹.snd).2) d)), ⋯⟩).2 X:IrreflexiveGraphY:IrreflexiveGraphx✝¹:BinaryFan X Yx✝:x✝¹.pt ⟶ X.prodObj Yhm₁:X.fstHom Y ⊚ x✝ = x✝¹.fsthm₂:X.sndHom Y ⊚ x✝ = x✝¹.snd⊢ (↑x✝).1 = (↑⟨(↾fun a ↦ ((hom (↑x✝¹.fst).1) a, (hom (↑x✝¹.snd).1) a), ↾fun d ↦ ((hom (↑x✝¹.fst).2) d, (hom (↑x✝¹.snd).2) d)), ⋯⟩).1X:IrreflexiveGraphY:IrreflexiveGraphx✝¹:BinaryFan X Yx✝:x✝¹.pt ⟶ X.prodObj Yhm₁:X.fstHom Y ⊚ x✝ = x✝¹.fsthm₂:X.sndHom Y ⊚ x✝ = x✝¹.snd⊢ (↑x✝).2 = (↑⟨(↾fun a ↦ ((hom (↑x✝¹.fst).1) a, (hom (↑x✝¹.snd).1) a), ↾fun d ↦ ((hom (↑x✝¹.fst).2) d, (hom (↑x✝¹.snd).2) d)), ⋯⟩).2 (X:IrreflexiveGraphY:IrreflexiveGraphx✝¹:BinaryFan X Yx✝:x✝¹.pt ⟶ X.prodObj Yhm₁:X.fstHom Y ⊚ x✝ = x✝¹.fsthm₂:X.sndHom Y ⊚ x✝ = x✝¹.sndx:x✝¹.pt.carrierD⊢ (hom (↑x✝).2).toFun x = (hom (↑⟨(↾fun a ↦ ((hom (↑x✝¹.fst).1) a, (hom (↑x✝¹.snd).1) a), ↾fun d ↦ ((hom (↑x✝¹.fst).2) d, (hom (↑x✝¹.snd).2) d)), ⋯⟩).2).toFun x; X:IrreflexiveGraphY:IrreflexiveGraphx✝¹:BinaryFan X Yx✝:x✝¹.pt ⟶ X.prodObj Yhm₁:X.fstHom Y ⊚ x✝ = x✝¹.fsthm₂:X.sndHom Y ⊚ x✝ = x✝¹.sndx:x✝¹.pt.carrierD⊢ ((hom (↑x✝).2).toFun x).1 = ((hom (↑⟨(↾fun a ↦ ((hom (↑x✝¹.fst).1) a, (hom (↑x✝¹.snd).1) a), ↾fun d ↦ ((hom (↑x✝¹.fst).2) d, (hom (↑x✝¹.snd).2) d)), ⋯⟩).2).toFun x).1X:IrreflexiveGraphY:IrreflexiveGraphx✝¹:BinaryFan X Yx✝:x✝¹.pt ⟶ X.prodObj Yhm₁:X.fstHom Y ⊚ x✝ = x✝¹.fsthm₂:X.sndHom Y ⊚ x✝ = x✝¹.sndx:x✝¹.pt.carrierD⊢ ((hom (↑x✝).2).toFun x).2 = ((hom (↑⟨(↾fun a ↦ ((hom (↑x✝¹.fst).1) a, (hom (↑x✝¹.snd).1) a), ↾fun d ↦ ((hom (↑x✝¹.fst).2) d, (hom (↑x✝¹.snd).2) d)), ⋯⟩).2).toFun x).2) X:IrreflexiveGraphY:IrreflexiveGraphx✝¹:BinaryFan X Yx✝:x✝¹.pt ⟶ X.prodObj Yhm₁:X.fstHom Y ⊚ x✝ = x✝¹.fsthm₂:X.sndHom Y ⊚ x✝ = x✝¹.sndx:x✝¹.pt.carrierA⊢ ((hom (↑x✝).1).toFun x).1 = ((hom (↑⟨(↾fun a ↦ ((hom (↑x✝¹.fst).1) a, (hom (↑x✝¹.snd).1) a), ↾fun d ↦ ((hom (↑x✝¹.fst).2) d, (hom (↑x✝¹.snd).2) d)), ⋯⟩).1).toFun x).1 All goals completed! 🐙 X:IrreflexiveGraphY:IrreflexiveGraphx✝¹:BinaryFan X Yx✝:x✝¹.pt ⟶ X.prodObj Yhm₁:X.fstHom Y ⊚ x✝ = x✝¹.fsthm₂:X.sndHom Y ⊚ x✝ = x✝¹.sndx:x✝¹.pt.carrierA⊢ ((hom (↑x✝).1).toFun x).2 = ((hom (↑⟨(↾fun a ↦ ((hom (↑x✝¹.fst).1) a, (hom (↑x✝¹.snd).1) a), ↾fun d ↦ ((hom (↑x✝¹.fst).2) d, (hom (↑x✝¹.snd).2) d)), ⋯⟩).1).toFun x).2 All goals completed! 🐙 X:IrreflexiveGraphY:IrreflexiveGraphx✝¹:BinaryFan X Yx✝:x✝¹.pt ⟶ X.prodObj Yhm₁:X.fstHom Y ⊚ x✝ = x✝¹.fsthm₂:X.sndHom Y ⊚ x✝ = x✝¹.sndx:x✝¹.pt.carrierD⊢ ((hom (↑x✝).2).toFun x).1 = ((hom (↑⟨(↾fun a ↦ ((hom (↑x✝¹.fst).1) a, (hom (↑x✝¹.snd).1) a), ↾fun d ↦ ((hom (↑x✝¹.fst).2) d, (hom (↑x✝¹.snd).2) d)), ⋯⟩).2).toFun x).1 All goals completed! 🐙 X:IrreflexiveGraphY:IrreflexiveGraphx✝¹:BinaryFan X Yx✝:x✝¹.pt ⟶ X.prodObj Yhm₁:X.fstHom Y ⊚ x✝ = x✝¹.fsthm₂:X.sndHom Y ⊚ x✝ = x✝¹.sndx:x✝¹.pt.carrierD⊢ ((hom (↑x✝).2).toFun x).2 = ((hom (↑⟨(↾fun a ↦ ((hom (↑x✝¹.fst).1) a, (hom (↑x✝¹.snd).1) a), ↾fun d ↦ ((hom (↑x✝¹.fst).2) d, (hom (↑x✝¹.snd).2) d)), ⋯⟩).2).toFun x).2 All goals completed! 🐙) open IrreflexiveGraph in instance (X Y : IrreflexiveGraph) : HasBinaryProduct X Y := HasLimit.mk ⟨binaryFan X Y, isLimit X Y⟩

We then construct an isomorphism between {A \times B} and {A \times C} by applying the identity mapping to the arrows and swapping the dots {(1, 2)} and {(1, 0)}. This permutation aligns the target of the second arrow in the product graphs, exactly compensating for the structural difference between B and C.

def swapD : Fin 2 × Fin 3 → Fin 2 × Fin 3 | (1, 2) => (1, 0) | (1, 0) => (1, 2) | d => d open IrreflexiveGraph in noncomputable example : A ⨯ B ≅ A ⨯ C := ⊢ A ⨯ B ≅ A ⨯ C h_iso:A.prodObj B ≅ A.prodObj C⊢ A ⨯ B ≅ A ⨯ C calc A ⨯ B _ ≅ prodObj A B := limit.isoLimitCone ⟨_, isLimit A B⟩ _ ≅ prodObj A C := h_iso _ ≅ A ⨯ C := (limit.isoLimitCone ⟨_, isLimit A C⟩).symm

3. The distributive law🔗

Exercise 6 (p. 275)

Assuming that X, B_1 and B_2 are objects of a category with sums and products, construct a map from the sum of {X \times B_1} and {X \times B_2} to the product of X with {B_1 + B_2}, i.e. construct a map (X \times B_1) + (X \times B_2) \rightarrow X \times (B_1 + B_2) Hint: Use the universal mapping properties of sum and product, and combine appropriate injections and projections.

Solution: Exercise 6

By the universal mapping property of the sum, to construct a map from {(X \times B_1) + (X \times B_2)} to {X \times (B_1 + B_2)}, it suffices to construct maps from {X \times B_1} and {X \times B_2} to {X \times (B_1 + B_2)}. We can construct these maps using the universal mapping property of the product.

noncomputable example {𝒞 : Type u} [Category.{v, u} 𝒞] {X B₁ B₂ : 𝒞} [HasBinaryProducts 𝒞] [HasBinaryCoproducts 𝒞] : (X ⨯ B₁) ⨿ (X ⨯ B₂) ⟶ X ⨯ (B₁ ⨿ B₂) := coprod.desc (prod.lift prod.fst (coprod.inl ⊚ prod.snd)) (prod.lift prod.fst (coprod.inr ⊚ prod.snd))