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
}
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 _ => ()
}
(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
have hj_inj : Function.Injective j := by
intro x y hxy 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 ⊚ jx:B₁ ⊕ B₂y:B₁ ⊕ B₂hxy:(hom j) x = (hom j) y⊢ x = y
obtain ⟨f, hf, _⟩ := hj (↾fun b ↦ if x = b then 1 else 0) 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 ⊚ jx:B₁ ⊕ B₂y:B₁ ⊕ B₂hxy:(hom j) x = (hom j) yf:S ⟶ Twohf:(↾fun b ↦ if x = b then 1 else 0) = f ⊚ jright✝:∀ (y : S ⟶ Two), (fun f ↦ (↾fun b ↦ if x = b then 1 else 0) = f ⊚ j) y → y = f⊢ x = y
have h : (1 : Two) = if x = y then 1 else 0 :=
calc (1 : Two)
_ = if x = x then 1 else 0 := (if_pos rfl).symm
_ = f (j x) := congr_hom hf x
_ = f (j y) := by 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 ⊚ jx:B₁ ⊕ B₂y:B₁ ⊕ B₂hxy:(hom j) x = (hom j) yf:S ⟶ Twohf:(↾fun b ↦ if x = b then 1 else 0) = f ⊚ jright✝:∀ (y : S ⟶ Two), (fun f ↦ (↾fun b ↦ if x = b then 1 else 0) = f ⊚ j) y → y = f⊢ (hom f) ((hom j) x) = (hom f) ((hom j) y) rw [hxy 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 ⊚ jx:B₁ ⊕ B₂y:B₁ ⊕ B₂hxy:(hom j) x = (hom j) yf:S ⟶ Twohf:(↾fun b ↦ if x = b then 1 else 0) = f ⊚ jright✝:∀ (y : S ⟶ Two), (fun f ↦ (↾fun b ↦ if x = b then 1 else 0) = f ⊚ j) y → y = f⊢ (hom f) ((hom j) y) = (hom f) ((hom j) y)] All goals completed! 🐙
_ = if x = y then 1 else 0 := congr_hom hf.symm 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 ⊚ jx:B₁ ⊕ B₂y:B₁ ⊕ B₂hxy:(hom j) x = (hom j) yf:S ⟶ Twohf:(↾fun b ↦ if x = b then 1 else 0) = f ⊚ jright✝:∀ (y : S ⟶ Two), (fun f ↦ (↾fun b ↦ if x = b then 1 else 0) = f ⊚ j) y → y = fh:1 = if x = y then 1 else 0⊢ x = y
split_ifs at h with heq pos 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 ⊚ jx:B₁ ⊕ B₂y:B₁ ⊕ B₂hxy:(hom j) x = (hom j) yf:S ⟶ Twohf:(↾fun b ↦ if x = b then 1 else 0) = f ⊚ jright✝:∀ (y : S ⟶ Two), (fun f ↦ (↾fun b ↦ if x = b then 1 else 0) = f ⊚ j) y → y = fheq:x = yh:1 = 1⊢ x = yneg 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 ⊚ jx:B₁ ⊕ B₂y:B₁ ⊕ B₂hxy:(hom j) x = (hom j) yf:S ⟶ Twohf:(↾fun b ↦ if x = b then 1 else 0) = f ⊚ jright✝:∀ (y : S ⟶ Two), (fun f ↦ (↾fun b ↦ if x = b then 1 else 0) = f ⊚ j) y → y = fheq:¬x = yh:1 = 0⊢ x = y
· pos 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 ⊚ jx:B₁ ⊕ B₂y:B₁ ⊕ B₂hxy:(hom j) x = (hom j) yf:S ⟶ Twohf:(↾fun b ↦ if x = b then 1 else 0) = f ⊚ jright✝:∀ (y : S ⟶ Two), (fun f ↦ (↾fun b ↦ if x = b then 1 else 0) = f ⊚ j) y → y = fheq:x = yh:1 = 1⊢ x = y exact heq All goals completed! 🐙
· neg 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 ⊚ jx:B₁ ⊕ B₂y:B₁ ⊕ B₂hxy:(hom j) x = (hom j) yf:S ⟶ Twohf:(↾fun b ↦ if x = b then 1 else 0) = f ⊚ jright✝:∀ (y : S ⟶ Two), (fun f ↦ (↾fun b ↦ if x = b then 1 else 0) = f ⊚ j) y → y = fheq:¬x = yh:1 = 0⊢ x = y contradiction 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
have hj_surj : Function.Surjective j := by
intro 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)s:S⊢ ∃ a, (hom j) a = s
by_contra h_not_mem 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)s:Sh_not_mem:¬∃ a, (hom j) a = s⊢ False
let f₀ : S ⟶ Two := ↾fun _ ↦ 0 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)s:Sh_not_mem:¬∃ a, (hom j) a = sf₀:S ⟶ Two := ↾fun x ↦ 0⊢ False
let f₁ : S ⟶ Two := ↾fun x ↦ if x = s then 1 else 0 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)s:Sh_not_mem:¬∃ a, (hom j) a = sf₀:S ⟶ Two := ↾fun x ↦ 0f₁:S ⟶ Two := ↾fun x ↦ if x = s then 1 else 0⊢ False
have h₀ : (↾fun _ : B₁ ⊕ B₂ ↦ (0 : Two)) = f₀ ⊚ j := rfl 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)s:Sh_not_mem:¬∃ a, (hom j) a = sf₀:S ⟶ Two := ↾fun x ↦ 0f₁:S ⟶ Two := ↾fun x ↦ if x = s then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ j⊢ False
have h₁ : (↾fun _ : B₁ ⊕ B₂ ↦ (0 : Two)) = f₁ ⊚ j := by 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₂
ext x 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)s:Sh_not_mem:¬∃ a, (hom j) a = sf₀:S ⟶ Two := ↾fun x ↦ 0f₁:S ⟶ Two := ↾fun x ↦ if x = s then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jx:B₁ ⊕ B₂⊢ ↑((hom (↾fun x ↦ 0)).toFun x) = ↑((hom (f₁ ⊚ j)).toFun x)
have hnc : ¬(j x = s) := fun h ↦ h_not_mem ⟨x, h⟩ 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)s:Sh_not_mem:¬∃ a, (hom j) a = sf₀:S ⟶ Two := ↾fun x ↦ 0f₁:S ⟶ Two := ↾fun x ↦ if x = s then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jx:B₁ ⊕ B₂hnc:¬(hom j) x = s⊢ ↑((hom (↾fun x ↦ 0)).toFun x) = ↑((hom (f₁ ⊚ j)).toFun x)
dsimp [f₁] 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)s:Sh_not_mem:¬∃ a, (hom j) a = sf₀:S ⟶ Two := ↾fun x ↦ 0f₁:S ⟶ Two := ↾fun x ↦ if x = s then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jx:B₁ ⊕ B₂hnc:¬(hom j) x = s⊢ 0 = ↑(if (hom j) x = s then 1 else 0)
rw [if_neg hnc 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)s:Sh_not_mem:¬∃ a, (hom j) a = sf₀:S ⟶ Two := ↾fun x ↦ 0f₁:S ⟶ Two := ↾fun x ↦ if x = s then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jx:B₁ ⊕ B₂hnc:¬(hom j) x = s⊢ 0 = ↑0] 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)s:Sh_not_mem:¬∃ a, (hom j) a = sf₀:S ⟶ Two := ↾fun x ↦ 0f₁:S ⟶ Two := ↾fun x ↦ if x = s then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jx:B₁ ⊕ B₂hnc:¬(hom j) x = s⊢ 0 = ↑0
rfl 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)s:Sh_not_mem:¬∃ a, (hom j) a = sf₀:S ⟶ Two := ↾fun x ↦ 0f₁:S ⟶ Two := ↾fun x ↦ if x = s then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jh₁:(↾fun x ↦ 0) = f₁ ⊚ j⊢ False
have heq : f₀ = f₁ := (hj (↾fun _ ↦ 0)).unique h₀ h₁ 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)s:Sh_not_mem:¬∃ a, (hom j) a = sf₀:S ⟶ Two := ↾fun x ↦ 0f₁:S ⟶ Two := ↾fun x ↦ if x = s then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jh₁:(↾fun x ↦ 0) = f₁ ⊚ jheq:f₀ = f₁⊢ False
have h_absurd : (0 : Two) = 1 :=
calc (0 : Two)
_ = f₀ s := rfl
_ = f₁ s := by 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)s:Sh_not_mem:¬∃ a, (hom j) a = sf₀:S ⟶ Two := ↾fun x ↦ 0f₁:S ⟶ Two := ↾fun x ↦ if x = s then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jh₁:(↾fun x ↦ 0) = f₁ ⊚ jheq:f₀ = f₁⊢ (hom f₀) s = (hom f₁) s rw [heq 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)s:Sh_not_mem:¬∃ a, (hom j) a = sf₀:S ⟶ Two := ↾fun x ↦ 0f₁:S ⟶ Two := ↾fun x ↦ if x = s then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jh₁:(↾fun x ↦ 0) = f₁ ⊚ jheq:f₀ = f₁⊢ (hom f₁) s = (hom f₁) s] All goals completed! 🐙
_ = if s = s then 1 else 0 := rfl
_ = 1 := if_pos rfl 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)s:Sh_not_mem:¬∃ a, (hom j) a = sf₀:S ⟶ Two := ↾fun x ↦ 0f₁:S ⟶ Two := ↾fun x ↦ if x = s then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jh₁:(↾fun x ↦ 0) = f₁ ⊚ jheq:f₀ = f₁h_absurd:0 = 1⊢ False
contradiction 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₂
intro Y g₁ g₂ 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
let e : B₁ ⊕ B₂ ≃ S := Equiv.ofBijective j ⟨hj_inj, hj_surj⟩ 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
use ↾fun s ↦ Sum.elim g₁ g₂ (e.symm s) h 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)
constructor h.left 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))h.right 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)
· h.left 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
constructor h.left.left 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₁h.left.right 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₂ <;> h.left.left 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₁h.left.right 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₂ ext b h.left.right 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
· h.left.left 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 change g₁ b = Sum.elim g₁ g₂ (e.symm (e (Sum.inl b))) h.left.left 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)))
rw [Equiv.symm_apply_apply h.left.left 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)] h.left.left 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); rfl All goals completed! 🐙
· h.left.right 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 change g₂ b = Sum.elim g₁ g₂ (e.symm (e (Sum.inr b))) h.left.right 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)))
rw [Equiv.symm_apply_apply h.left.right 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)] h.left.right 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); rfl All goals completed! 🐙
· h.right 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
intro f' ⟨h₁, h₂⟩ h.right 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)
ext s h.right 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
change (hom f') s = Sum.elim g₁ g₂ (e.symm s) h.right 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 [← Equiv.apply_symm_apply e s h.right 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)] h.right 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
| inl b₁ => h.right.inl 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₁) exact congr_hom h₁.symm b₁ All goals completed! 🐙
| inr b₂ => h.right.inr 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₂) exact congr_hom h₂.symm 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 _ ↦ ()), by 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 constructor left X:IrreflexiveGraphf:X.carrierA ⟶ TwoA.carrierA⊢ (f, ↾fun x ↦ ()).2 ⊚ X.toSrc = TwoA.toSrc ⊚ (f, ↾fun x ↦ ()).1right X:IrreflexiveGraphf:X.carrierA ⟶ TwoA.carrierA⊢ (f, ↾fun x ↦ ()).2 ⊚ X.toTgt = TwoA.toTgt ⊚ (f, ↾fun x ↦ ()).1 <;> left X:IrreflexiveGraphf:X.carrierA ⟶ TwoA.carrierA⊢ (f, ↾fun x ↦ ()).2 ⊚ X.toSrc = TwoA.toSrc ⊚ (f, ↾fun x ↦ ()).1right X:IrreflexiveGraphf:X.carrierA ⟶ TwoA.carrierA⊢ (f, ↾fun x ↦ ()).2 ⊚ X.toTgt = TwoA.toTgt ⊚ (f, ↾fun x ↦ ()).1 rfl 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 := by s:Fin 2t:Fin 2⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow s t) = s
fin_cases s «0» t:Fin 2⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow ((fun i ↦ i) ⟨0, ⋯⟩) t) = (fun i ↦ i) ⟨0, ⋯⟩«1» t:Fin 2⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) t) = (fun i ↦ i) ⟨1, ⋯⟩ <;> «0» t:Fin 2⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow ((fun i ↦ i) ⟨0, ⋯⟩) t) = (fun i ↦ i) ⟨0, ⋯⟩«1» t:Fin 2⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) t) = (fun i ↦ i) ⟨1, ⋯⟩ fin_cases t «1».«0» ⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩)) = (fun i ↦ i) ⟨1, ⋯⟩«1».«1» ⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩)) = (fun i ↦ i) ⟨1, ⋯⟩ <;> «0».«0» ⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩)) = (fun i ↦ i) ⟨0, ⋯⟩«0».«1» ⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩)) = (fun i ↦ i) ⟨0, ⋯⟩«1».«0» ⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩)) = (fun i ↦ i) ⟨1, ⋯⟩«1».«1» ⊢ (ConcreteCategory.hom TwoD.toSrc) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩)) = (fun i ↦ i) ⟨1, ⋯⟩ rfl All goals completed! 🐙
lemma mkTwoDArrow_tgt (s t : Fin 2)
: TwoD.toTgt (mkTwoDArrow s t) = t := by s:Fin 2t:Fin 2⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow s t) = t
fin_cases s «0» t:Fin 2⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow ((fun i ↦ i) ⟨0, ⋯⟩) t) = t«1» t:Fin 2⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) t) = t <;> «0» t:Fin 2⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow ((fun i ↦ i) ⟨0, ⋯⟩) t) = t«1» t:Fin 2⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) t) = t fin_cases t «1».«0» ⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩)) = (fun i ↦ i) ⟨0, ⋯⟩«1».«1» ⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩)) = (fun i ↦ i) ⟨1, ⋯⟩ <;> «0».«0» ⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩)) = (fun i ↦ i) ⟨0, ⋯⟩«0».«1» ⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow ((fun i ↦ i) ⟨0, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩)) = (fun i ↦ i) ⟨1, ⋯⟩«1».«0» ⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨0, ⋯⟩)) = (fun i ↦ i) ⟨0, ⋯⟩«1».«1» ⊢ (ConcreteCategory.hom TwoD.toTgt) (mkTwoDArrow ((fun i ↦ i) ⟨1, ⋯⟩) ((fun i ↦ i) ⟨1, ⋯⟩)) = (fun i ↦ i) ⟨1, ⋯⟩ rfl 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),
by 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
constructor left 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).1right 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.toTgt =
TwoD.toTgt ⊚
(↾fun a ↦
mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a))
((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)),
f).1 <;> left 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).1right 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.toTgt =
TwoD.toTgt ⊚
(↾fun a ↦
mkTwoDArrow ((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toSrc) a))
((ConcreteCategory.hom f) ((ConcreteCategory.hom X.toTgt) a)),
f).1 (ext a right 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; apply Eq.symm right 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)
· left 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 exact mkTwoDArrow_src (f (X.toSrc a)) (f (X.toTgt a)) All goals completed! 🐙
· right 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 exact mkTwoDArrow_tgt (f (X.toSrc a)) (f (X.toTgt 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 := by X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierA ⟶ TwoA.carrierA⊢ liftTwoA (g ⊚ (↑f).1) = liftTwoA g ⊚ f
apply IrreflexiveGraph.hom_ext hA X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierA ⟶ TwoA.carrierA⊢ (↑(liftTwoA (g ⊚ (↑f).1))).1 = (↑(liftTwoA g ⊚ f)).1hD X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierA ⟶ TwoA.carrierA⊢ (↑(liftTwoA (g ⊚ (↑f).1))).2 = (↑(liftTwoA g ⊚ f)).2 <;> hA X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierA ⟶ TwoA.carrierA⊢ (↑(liftTwoA (g ⊚ (↑f).1))).1 = (↑(liftTwoA g ⊚ f)).1hD X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierA ⟶ TwoA.carrierA⊢ (↑(liftTwoA (g ⊚ (↑f).1))).2 = (↑(liftTwoA g ⊚ f)).2 rfl 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 := by X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierD ⟶ TwoD.carrierD⊢ liftTwoD (g ⊚ (↑f).2) = liftTwoD g ⊚ f
apply IrreflexiveGraph.hom_ext hA X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierD ⟶ TwoD.carrierD⊢ (↑(liftTwoD (g ⊚ (↑f).2))).1 = (↑(liftTwoD g ⊚ f)).1hD X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierD ⟶ TwoD.carrierD⊢ (↑(liftTwoD (g ⊚ (↑f).2))).2 = (↑(liftTwoD g ⊚ f)).2
· hA X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierD ⟶ TwoD.carrierD⊢ (↑(liftTwoD (g ⊚ (↑f).2))).1 = (↑(liftTwoD g ⊚ f)).1 ext a hA 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
change mkTwoDArrow (g ((f.val.2 ⊚ X.toSrc) a))
(g ((f.val.2 ⊚ X.toTgt) a)) = _ hA 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
rw [f.property.1, hA 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 ((↑f).2 ⊚ X.toTgt)) a)) =
(ConcreteCategory.hom (↑(liftTwoD g ⊚ f)).1).toFun a f.property.2 hA 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] hA 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; rfl All goals completed! 🐙
· hD X:IrreflexiveGraphY:IrreflexiveGraphf:X ⟶ Yg:Y.carrierD ⟶ TwoD.carrierD⊢ (↑(liftTwoD (g ⊚ (↑f).2))).2 = (↑(liftTwoD g ⊚ f)).2 rfl 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₂) := by 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₁
have hSA : ∀ (fA₁ : B₁.carrierA ⟶ TwoA.carrierA)
(fA₂ : B₂.carrierA ⟶ TwoA.carrierA),
∃! fA : S.carrierA ⟶ TwoA.carrierA,
fA₁ = fA ⊚ j₁.val.1 ∧ fA₂ = fA ⊚ j₂.val.1 := by
intro fA₁ fA₂ 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₂fA₁:B₁.carrierA ⟶ TwoA.carrierAfA₂:B₂.carrierA ⟶ TwoA.carrierA⊢ ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1
obtain ⟨f, ⟨hf₁, hf₂⟩, hf_uniq⟩ :=
hS₁ (liftTwoA fA₁) (liftTwoA fA₂) 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₂fA₁:B₁.carrierA ⟶ TwoA.carrierAfA₂:B₂.carrierA ⟶ TwoA.carrierAf:S ⟶ TwoAhf_uniq:∀ (y : S ⟶ TwoA), (fun f ↦ liftTwoA fA₁ = f ⊚ j₁ ∧ liftTwoA fA₂ = f ⊚ j₂) y → y = fhf₁:liftTwoA fA₁ = f ⊚ j₁hf₂:liftTwoA fA₂ = f ⊚ j₂⊢ ∃! fA, fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1
use f.val.1 h 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₂fA₁:B₁.carrierA ⟶ TwoA.carrierAfA₂:B₂.carrierA ⟶ TwoA.carrierAf:S ⟶ TwoAhf_uniq:∀ (y : S ⟶ TwoA), (fun f ↦ liftTwoA fA₁ = f ⊚ j₁ ∧ liftTwoA fA₂ = f ⊚ j₂) y → y = fhf₁:liftTwoA fA₁ = f ⊚ j₁hf₂:liftTwoA fA₂ = f ⊚ j₂⊢ (fun fA ↦ fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1) (↑f).1 ∧
∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1) y → y = (↑f).1
constructor h.left 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₂fA₁:B₁.carrierA ⟶ TwoA.carrierAfA₂:B₂.carrierA ⟶ TwoA.carrierAf:S ⟶ TwoAhf_uniq:∀ (y : S ⟶ TwoA), (fun f ↦ liftTwoA fA₁ = f ⊚ j₁ ∧ liftTwoA fA₂ = f ⊚ j₂) y → y = fhf₁:liftTwoA fA₁ = f ⊚ j₁hf₂:liftTwoA fA₂ = f ⊚ j₂⊢ (fun fA ↦ fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1) (↑f).1h.right 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₂fA₁:B₁.carrierA ⟶ TwoA.carrierAfA₂:B₂.carrierA ⟶ TwoA.carrierAf:S ⟶ TwoAhf_uniq:∀ (y : S ⟶ TwoA), (fun f ↦ liftTwoA fA₁ = f ⊚ j₁ ∧ liftTwoA fA₂ = f ⊚ j₂) y → y = fhf₁:liftTwoA fA₁ = f ⊚ j₁hf₂:liftTwoA fA₂ = f ⊚ j₂⊢ ∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1) y → y = (↑f).1
· h.left 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₂fA₁:B₁.carrierA ⟶ TwoA.carrierAfA₂:B₂.carrierA ⟶ TwoA.carrierAf:S ⟶ TwoAhf_uniq:∀ (y : S ⟶ TwoA), (fun f ↦ liftTwoA fA₁ = f ⊚ j₁ ∧ liftTwoA fA₂ = f ⊚ j₂) y → y = fhf₁:liftTwoA fA₁ = f ⊚ j₁hf₂:liftTwoA fA₂ = f ⊚ j₂⊢ (fun fA ↦ fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1) (↑f).1 constructor h.left.left 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₂fA₁:B₁.carrierA ⟶ TwoA.carrierAfA₂:B₂.carrierA ⟶ TwoA.carrierAf:S ⟶ TwoAhf_uniq:∀ (y : S ⟶ TwoA), (fun f ↦ liftTwoA fA₁ = f ⊚ j₁ ∧ liftTwoA fA₂ = f ⊚ j₂) y → y = fhf₁:liftTwoA fA₁ = f ⊚ j₁hf₂:liftTwoA fA₂ = f ⊚ j₂⊢ fA₁ = (↑f).1 ⊚ (↑j₁).1h.left.right 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₂fA₁:B₁.carrierA ⟶ TwoA.carrierAfA₂:B₂.carrierA ⟶ TwoA.carrierAf:S ⟶ TwoAhf_uniq:∀ (y : S ⟶ TwoA), (fun f ↦ liftTwoA fA₁ = f ⊚ j₁ ∧ liftTwoA fA₂ = f ⊚ j₂) y → y = fhf₁:liftTwoA fA₁ = f ⊚ j₁hf₂:liftTwoA fA₂ = f ⊚ j₂⊢ fA₂ = (↑f).1 ⊚ (↑j₂).1
· h.left.left 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₂fA₁:B₁.carrierA ⟶ TwoA.carrierAfA₂:B₂.carrierA ⟶ TwoA.carrierAf:S ⟶ TwoAhf_uniq:∀ (y : S ⟶ TwoA), (fun f ↦ liftTwoA fA₁ = f ⊚ j₁ ∧ liftTwoA fA₂ = f ⊚ j₂) y → y = fhf₁:liftTwoA fA₁ = f ⊚ j₁hf₂:liftTwoA fA₂ = f ⊚ j₂⊢ fA₁ = (↑f).1 ⊚ (↑j₁).1 exact congr_arg (·.val.1) hf₁ All goals completed! 🐙
· h.left.right 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₂fA₁:B₁.carrierA ⟶ TwoA.carrierAfA₂:B₂.carrierA ⟶ TwoA.carrierAf:S ⟶ TwoAhf_uniq:∀ (y : S ⟶ TwoA), (fun f ↦ liftTwoA fA₁ = f ⊚ j₁ ∧ liftTwoA fA₂ = f ⊚ j₂) y → y = fhf₁:liftTwoA fA₁ = f ⊚ j₁hf₂:liftTwoA fA₂ = f ⊚ j₂⊢ fA₂ = (↑f).1 ⊚ (↑j₂).1 exact congr_arg (·.val.1) hf₂ All goals completed! 🐙
· h.right 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₂fA₁:B₁.carrierA ⟶ TwoA.carrierAfA₂:B₂.carrierA ⟶ TwoA.carrierAf:S ⟶ TwoAhf_uniq:∀ (y : S ⟶ TwoA), (fun f ↦ liftTwoA fA₁ = f ⊚ j₁ ∧ liftTwoA fA₂ = f ⊚ j₂) y → y = fhf₁:liftTwoA fA₁ = f ⊚ j₁hf₂:liftTwoA fA₂ = f ⊚ j₂⊢ ∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ fA₁ = fA ⊚ (↑j₁).1 ∧ fA₂ = fA ⊚ (↑j₂).1) y → y = (↑f).1 intro fA' ⟨hfA'₁, hfA'₂⟩ h.right 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₂fA₁:B₁.carrierA ⟶ TwoA.carrierAfA₂:B₂.carrierA ⟶ TwoA.carrierAf:S ⟶ TwoAhf_uniq:∀ (y : S ⟶ TwoA), (fun f ↦ liftTwoA fA₁ = f ⊚ j₁ ∧ liftTwoA fA₂ = f ⊚ j₂) y → y = fhf₁:liftTwoA fA₁ = f ⊚ j₁hf₂:liftTwoA fA₂ = f ⊚ j₂fA':S.carrierA ⟶ TwoA.carrierAhfA'₁:fA₁ = fA' ⊚ (↑j₁).1hfA'₂:fA₂ = fA' ⊚ (↑j₂).1⊢ fA' = (↑f).1
have := hf_uniq (liftTwoA fA') ⟨
by 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₂fA₁:B₁.carrierA ⟶ TwoA.carrierAfA₂:B₂.carrierA ⟶ TwoA.carrierAf:S ⟶ TwoAhf_uniq:∀ (y : S ⟶ TwoA), (fun f ↦ liftTwoA fA₁ = f ⊚ j₁ ∧ liftTwoA fA₂ = f ⊚ j₂) y → y = fhf₁:liftTwoA fA₁ = f ⊚ j₁hf₂:liftTwoA fA₂ = f ⊚ j₂fA':S.carrierA ⟶ TwoA.carrierAhfA'₁:fA₁ = fA' ⊚ (↑j₁).1hfA'₂:fA₂ = fA' ⊚ (↑j₂).1⊢ liftTwoA fA₁ = liftTwoA fA' ⊚ j₁ rw [hfA'₁, 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₂fA₁:B₁.carrierA ⟶ TwoA.carrierAfA₂:B₂.carrierA ⟶ TwoA.carrierAf:S ⟶ TwoAhf_uniq:∀ (y : S ⟶ TwoA), (fun f ↦ liftTwoA fA₁ = f ⊚ j₁ ∧ liftTwoA fA₂ = f ⊚ j₂) y → y = fhf₁:liftTwoA fA₁ = f ⊚ j₁hf₂:liftTwoA fA₂ = f ⊚ j₂fA':S.carrierA ⟶ TwoA.carrierAhfA'₁:fA₁ = fA' ⊚ (↑j₁).1hfA'₂:fA₂ = fA' ⊚ (↑j₂).1⊢ liftTwoA (fA' ⊚ (↑j₁).1) = liftTwoA fA' ⊚ j₁ liftTwoA_comp 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₂fA₁:B₁.carrierA ⟶ TwoA.carrierAfA₂:B₂.carrierA ⟶ TwoA.carrierAf:S ⟶ TwoAhf_uniq:∀ (y : S ⟶ TwoA), (fun f ↦ liftTwoA fA₁ = f ⊚ j₁ ∧ liftTwoA fA₂ = f ⊚ j₂) y → y = fhf₁:liftTwoA fA₁ = f ⊚ j₁hf₂:liftTwoA fA₂ = f ⊚ j₂fA':S.carrierA ⟶ TwoA.carrierAhfA'₁:fA₁ = fA' ⊚ (↑j₁).1hfA'₂:fA₂ = fA' ⊚ (↑j₂).1⊢ liftTwoA fA' ⊚ j₁ = liftTwoA fA' ⊚ j₁] All goals completed! 🐙,
by 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₂fA₁:B₁.carrierA ⟶ TwoA.carrierAfA₂:B₂.carrierA ⟶ TwoA.carrierAf:S ⟶ TwoAhf_uniq:∀ (y : S ⟶ TwoA), (fun f ↦ liftTwoA fA₁ = f ⊚ j₁ ∧ liftTwoA fA₂ = f ⊚ j₂) y → y = fhf₁:liftTwoA fA₁ = f ⊚ j₁hf₂:liftTwoA fA₂ = f ⊚ j₂fA':S.carrierA ⟶ TwoA.carrierAhfA'₁:fA₁ = fA' ⊚ (↑j₁).1hfA'₂:fA₂ = fA' ⊚ (↑j₂).1⊢ liftTwoA fA₂ = liftTwoA fA' ⊚ j₂ rw [hfA'₂, 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₂fA₁:B₁.carrierA ⟶ TwoA.carrierAfA₂:B₂.carrierA ⟶ TwoA.carrierAf:S ⟶ TwoAhf_uniq:∀ (y : S ⟶ TwoA), (fun f ↦ liftTwoA fA₁ = f ⊚ j₁ ∧ liftTwoA fA₂ = f ⊚ j₂) y → y = fhf₁:liftTwoA fA₁ = f ⊚ j₁hf₂:liftTwoA fA₂ = f ⊚ j₂fA':S.carrierA ⟶ TwoA.carrierAhfA'₁:fA₁ = fA' ⊚ (↑j₁).1hfA'₂:fA₂ = fA' ⊚ (↑j₂).1⊢ liftTwoA (fA' ⊚ (↑j₂).1) = liftTwoA fA' ⊚ j₂ liftTwoA_comp 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₂fA₁:B₁.carrierA ⟶ TwoA.carrierAfA₂:B₂.carrierA ⟶ TwoA.carrierAf:S ⟶ TwoAhf_uniq:∀ (y : S ⟶ TwoA), (fun f ↦ liftTwoA fA₁ = f ⊚ j₁ ∧ liftTwoA fA₂ = f ⊚ j₂) y → y = fhf₁:liftTwoA fA₁ = f ⊚ j₁hf₂:liftTwoA fA₂ = f ⊚ j₂fA':S.carrierA ⟶ TwoA.carrierAhfA'₁:fA₁ = fA' ⊚ (↑j₁).1hfA'₂:fA₂ = fA' ⊚ (↑j₂).1⊢ liftTwoA fA' ⊚ j₂ = liftTwoA fA' ⊚ j₂] All goals completed! 🐙
⟩ h.right 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₂fA₁:B₁.carrierA ⟶ TwoA.carrierAfA₂:B₂.carrierA ⟶ TwoA.carrierAf:S ⟶ TwoAhf_uniq:∀ (y : S ⟶ TwoA), (fun f ↦ liftTwoA fA₁ = f ⊚ j₁ ∧ liftTwoA fA₂ = f ⊚ j₂) y → y = fhf₁:liftTwoA fA₁ = f ⊚ j₁hf₂:liftTwoA fA₂ = f ⊚ j₂fA':S.carrierA ⟶ TwoA.carrierAhfA'₁:fA₁ = fA' ⊚ (↑j₁).1hfA'₂:fA₂ = fA' ⊚ (↑j₂).1this:liftTwoA fA' = f⊢ fA' = (↑f).1
exact congr_arg (·.val.1) this 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₂
let jA : B₁.carrierA ⊕ B₂.carrierA ⟶ S.carrierA :=
↾Sum.elim j₁.val.1 j₂.val.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)⊢ ∀ (Y : IrreflexiveGraph) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂
-- Show that jA satisfies universal property for TwoA.carrierA
have hjA : ∀ kA : B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA,
∃! fA : S.carrierA ⟶ TwoA.carrierA, kA = fA ⊚ jA := by
intro kA 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)kA:B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierA⊢ ∃! fA, kA = fA ⊚ jA
obtain ⟨fA, ⟨hfA₁, hfA₂⟩, hfA_uniq⟩ :=
hSA (kA ⊚ ↾Sum.inl) (kA ⊚ ↾Sum.inr) 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)kA:B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierAfA:S.carrierA ⟶ TwoA.carrierAhfA_uniq:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1 ∧ kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1) y → y = fAhfA₁:kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1hfA₂:kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1⊢ ∃! fA, kA = fA ⊚ jA
use fA h 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)kA:B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierAfA:S.carrierA ⟶ TwoA.carrierAhfA_uniq:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1 ∧ kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1) y → y = fAhfA₁:kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1hfA₂:kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1⊢ (fun fA ↦ kA = fA ⊚ jA) fA ∧ ∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA = fA ⊚ jA) y → y = fA
constructor h.left 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)kA:B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierAfA:S.carrierA ⟶ TwoA.carrierAhfA_uniq:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1 ∧ kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1) y → y = fAhfA₁:kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1hfA₂:kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1⊢ (fun fA ↦ kA = fA ⊚ jA) fAh.right 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)kA:B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierAfA:S.carrierA ⟶ TwoA.carrierAhfA_uniq:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1 ∧ kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1) y → y = fAhfA₁:kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1hfA₂:kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1⊢ ∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA = fA ⊚ jA) y → y = fA
· h.left 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)kA:B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierAfA:S.carrierA ⟶ TwoA.carrierAhfA_uniq:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1 ∧ kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1) y → y = fAhfA₁:kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1hfA₂:kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1⊢ (fun fA ↦ kA = fA ⊚ jA) fA ext x h.left 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)kA:B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierAfA:S.carrierA ⟶ TwoA.carrierAhfA_uniq:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1 ∧ kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1) y → y = fAhfA₁:kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1hfA₂:kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1x:B₁.carrierA ⊕ B₂.carrierA⊢ (hom kA).toFun x = (hom (fA ⊚ jA)).toFun x
cases x with
| inl bA₁ => h.left.inl 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)kA:B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierAfA:S.carrierA ⟶ TwoA.carrierAhfA_uniq:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1 ∧ kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1) y → y = fAhfA₁:kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1hfA₂:kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1bA₁:B₁.carrierA⊢ (hom kA).toFun (Sum.inl bA₁) = (hom (fA ⊚ jA)).toFun (Sum.inl bA₁) exact congr_hom hfA₁ bA₁ All goals completed! 🐙
| inr bA₂ => h.left.inr 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)kA:B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierAfA:S.carrierA ⟶ TwoA.carrierAhfA_uniq:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1 ∧ kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1) y → y = fAhfA₁:kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1hfA₂:kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1bA₂:B₂.carrierA⊢ (hom kA).toFun (Sum.inr bA₂) = (hom (fA ⊚ jA)).toFun (Sum.inr bA₂) exact congr_hom hfA₂ bA₂ All goals completed! 🐙
· h.right 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)kA:B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierAfA:S.carrierA ⟶ TwoA.carrierAhfA_uniq:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1 ∧ kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1) y → y = fAhfA₁:kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1hfA₂:kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1⊢ ∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA = fA ⊚ jA) y → y = fA intro fA' hfA' h.right 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)kA:B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierAfA:S.carrierA ⟶ TwoA.carrierAhfA_uniq:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1 ∧ kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1) y → y = fAhfA₁:kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1hfA₂:kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1fA':S.carrierA ⟶ TwoA.carrierAhfA':kA = fA' ⊚ jA⊢ fA' = fA
apply hfA_uniq h.right 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)kA:B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierAfA:S.carrierA ⟶ TwoA.carrierAhfA_uniq:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1 ∧ kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1) y → y = fAhfA₁:kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1hfA₂:kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1fA':S.carrierA ⟶ TwoA.carrierAhfA':kA = fA' ⊚ jA⊢ kA ⊚ ↾Sum.inl = fA' ⊚ (↑j₁).1 ∧ kA ⊚ ↾Sum.inr = fA' ⊚ (↑j₂).1
constructor h.right.left 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)kA:B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierAfA:S.carrierA ⟶ TwoA.carrierAhfA_uniq:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1 ∧ kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1) y → y = fAhfA₁:kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1hfA₂:kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1fA':S.carrierA ⟶ TwoA.carrierAhfA':kA = fA' ⊚ jA⊢ kA ⊚ ↾Sum.inl = fA' ⊚ (↑j₁).1h.right.right 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)kA:B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierAfA:S.carrierA ⟶ TwoA.carrierAhfA_uniq:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1 ∧ kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1) y → y = fAhfA₁:kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1hfA₂:kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1fA':S.carrierA ⟶ TwoA.carrierAhfA':kA = fA' ⊚ jA⊢ kA ⊚ ↾Sum.inr = fA' ⊚ (↑j₂).1 <;> h.right.left 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)kA:B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierAfA:S.carrierA ⟶ TwoA.carrierAhfA_uniq:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1 ∧ kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1) y → y = fAhfA₁:kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1hfA₂:kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1fA':S.carrierA ⟶ TwoA.carrierAhfA':kA = fA' ⊚ jA⊢ kA ⊚ ↾Sum.inl = fA' ⊚ (↑j₁).1h.right.right 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)kA:B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierAfA:S.carrierA ⟶ TwoA.carrierAhfA_uniq:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1 ∧ kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1) y → y = fAhfA₁:kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1hfA₂:kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1fA':S.carrierA ⟶ TwoA.carrierAhfA':kA = fA' ⊚ jA⊢ kA ⊚ ↾Sum.inr = fA' ⊚ (↑j₂).1 (rw [hfA' h.right.left 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)kA:B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierAfA:S.carrierA ⟶ TwoA.carrierAhfA_uniq:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1 ∧ kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1) y → y = fAhfA₁:kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1hfA₂:kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1fA':S.carrierA ⟶ TwoA.carrierAhfA':kA = fA' ⊚ jA⊢ (fA' ⊚ jA) ⊚ ↾Sum.inl = fA' ⊚ (↑j₁).1] h.right.left 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)kA:B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierAfA:S.carrierA ⟶ TwoA.carrierAhfA_uniq:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1 ∧ kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1) y → y = fAhfA₁:kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1hfA₂:kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1fA':S.carrierA ⟶ TwoA.carrierAhfA':kA = fA' ⊚ jA⊢ (fA' ⊚ jA) ⊚ ↾Sum.inl = fA' ⊚ (↑j₁).1 h.right.right 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)kA:B₁.carrierA ⊕ B₂.carrierA ⟶ TwoA.carrierAfA:S.carrierA ⟶ TwoA.carrierAhfA_uniq:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1 ∧ kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1) y → y = fAhfA₁:kA ⊚ ↾Sum.inl = fA ⊚ (↑j₁).1hfA₂:kA ⊚ ↾Sum.inr = fA ⊚ (↑j₂).1fA':S.carrierA ⟶ TwoA.carrierAhfA':kA = fA' ⊚ jA⊢ (fA' ⊚ jA) ⊚ ↾Sum.inr = fA' ⊚ (↑j₂).1; rfl 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 ⊚ jA⊢ ∀ (Y : IrreflexiveGraph) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂
-- Show that jA is injective
have hjA_inj : Function.Injective jA := by
intro x y hxy 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 ⊚ jAx:B₁.carrierA ⊕ B₂.carrierAy:B₁.carrierA ⊕ B₂.carrierAhxy:(hom jA) x = (hom jA) y⊢ x = y
obtain ⟨fA, hfA, _⟩ :=
hjA (↾fun b ↦ if x = b then (1 : Fin 2) else (0 : Fin 2)) 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 ⊚ jAx:B₁.carrierA ⊕ B₂.carrierAy:B₁.carrierA ⊕ B₂.carrierAhxy:(hom jA) x = (hom jA) yfA:S.carrierA ⟶ TwoA.carrierAhfA:(↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jAright✝:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ (↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jA) y → y = fA⊢ x = y
have h : (1 : Fin 2) = (if x = x then 1 else 0) :=
(if_pos rfl).symm 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 ⊚ jAx:B₁.carrierA ⊕ B₂.carrierAy:B₁.carrierA ⊕ B₂.carrierAhxy:(hom jA) x = (hom jA) yfA:S.carrierA ⟶ TwoA.carrierAhfA:(↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jAright✝:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ (↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jA) y → y = fAh:1 = if x = x then 1 else 0⊢ x = y
have hfA_x : (if x = x then (1 : Fin 2) else (0 : Fin 2)) =
(fA ⊚ jA) x := congr_hom hfA x 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 ⊚ jAx:B₁.carrierA ⊕ B₂.carrierAy:B₁.carrierA ⊕ B₂.carrierAhxy:(hom jA) x = (hom jA) yfA:S.carrierA ⟶ TwoA.carrierAhfA:(↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jAright✝:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ (↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jA) y → y = fAh:1 = if x = x then 1 else 0hfA_x:(if x = x then 1 else 0) = (hom (fA ⊚ jA)) x⊢ x = y
erw [hfA_x 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 ⊚ jAx:B₁.carrierA ⊕ B₂.carrierAy:B₁.carrierA ⊕ B₂.carrierAhxy:(hom jA) x = (hom jA) yfA:S.carrierA ⟶ TwoA.carrierAhfA:(↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jAright✝:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ (↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jA) y → y = fAh:1 = (hom (fA ⊚ jA)) xhfA_x:(if x = x then 1 else 0) = (hom (fA ⊚ jA)) x⊢ x = y] 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 ⊚ jAx:B₁.carrierA ⊕ B₂.carrierAy:B₁.carrierA ⊕ B₂.carrierAhxy:(hom jA) x = (hom jA) yfA:S.carrierA ⟶ TwoA.carrierAhfA:(↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jAright✝:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ (↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jA) y → y = fAh:1 = (hom (fA ⊚ jA)) xhfA_x:(if x = x then 1 else 0) = (hom (fA ⊚ jA)) x⊢ x = y at h
rw [types_comp_apply, 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 ⊚ jAx:B₁.carrierA ⊕ B₂.carrierAy:B₁.carrierA ⊕ B₂.carrierAhxy:(hom jA) x = (hom jA) yfA:S.carrierA ⟶ TwoA.carrierAhfA:(↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jAright✝:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ (↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jA) y → y = fAh:1 = (hom fA) ((hom jA) x)hfA_x:(if x = x then 1 else 0) = (hom (fA ⊚ jA)) x⊢ x = y hxy, 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 ⊚ jAx:B₁.carrierA ⊕ B₂.carrierAy:B₁.carrierA ⊕ B₂.carrierAhxy:(hom jA) x = (hom jA) yfA:S.carrierA ⟶ TwoA.carrierAhfA:(↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jAright✝:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ (↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jA) y → y = fAh:1 = (hom fA) ((hom jA) y)hfA_x:(if x = x then 1 else 0) = (hom (fA ⊚ jA)) x⊢ x = y ← types_comp_apply jA fA 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 ⊚ jAx:B₁.carrierA ⊕ B₂.carrierAy:B₁.carrierA ⊕ B₂.carrierAhxy:(hom jA) x = (hom jA) yfA:S.carrierA ⟶ TwoA.carrierAhfA:(↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jAright✝:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ (↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jA) y → y = fAh:1 = (hom (fA ⊚ jA)) yhfA_x:(if x = x then 1 else 0) = (hom (fA ⊚ jA)) x⊢ x = y] at h 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 ⊚ jAx:B₁.carrierA ⊕ B₂.carrierAy:B₁.carrierA ⊕ B₂.carrierAhxy:(hom jA) x = (hom jA) yfA:S.carrierA ⟶ TwoA.carrierAhfA:(↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jAright✝:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ (↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jA) y → y = fAh:1 = (hom (fA ⊚ jA)) yhfA_x:(if x = x then 1 else 0) = (hom (fA ⊚ jA)) x⊢ x = y
have hfA_y : (if x = y then (1 : Fin 2) else (0 : Fin 2)) =
(fA ⊚ jA) y := congr_hom hfA y 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 ⊚ jAx:B₁.carrierA ⊕ B₂.carrierAy:B₁.carrierA ⊕ B₂.carrierAhxy:(hom jA) x = (hom jA) yfA:S.carrierA ⟶ TwoA.carrierAhfA:(↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jAright✝:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ (↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jA) y → y = fAh:1 = (hom (fA ⊚ jA)) yhfA_x:(if x = x then 1 else 0) = (hom (fA ⊚ jA)) xhfA_y:(if x = y then 1 else 0) = (hom (fA ⊚ jA)) y⊢ x = y
erw [← hfA_y 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 ⊚ jAx:B₁.carrierA ⊕ B₂.carrierAy:B₁.carrierA ⊕ B₂.carrierAhxy:(hom jA) x = (hom jA) yfA:S.carrierA ⟶ TwoA.carrierAhfA:(↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jAright✝:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ (↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jA) y → y = fAh:1 = if x = y then 1 else 0hfA_x:(if x = x then 1 else 0) = (hom (fA ⊚ jA)) xhfA_y:(if x = y then 1 else 0) = (hom (fA ⊚ jA)) y⊢ x = y] 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 ⊚ jAx:B₁.carrierA ⊕ B₂.carrierAy:B₁.carrierA ⊕ B₂.carrierAhxy:(hom jA) x = (hom jA) yfA:S.carrierA ⟶ TwoA.carrierAhfA:(↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jAright✝:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ (↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jA) y → y = fAh:1 = if x = y then 1 else 0hfA_x:(if x = x then 1 else 0) = (hom (fA ⊚ jA)) xhfA_y:(if x = y then 1 else 0) = (hom (fA ⊚ jA)) y⊢ x = y at h
split_ifs at h with heq pos 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 ⊚ jAx:B₁.carrierA ⊕ B₂.carrierAy:B₁.carrierA ⊕ B₂.carrierAhxy:(hom jA) x = (hom jA) yfA:S.carrierA ⟶ TwoA.carrierAhfA:(↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jAright✝:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ (↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jA) y → y = fAhfA_x:(if x = x then 1 else 0) = (hom (fA ⊚ jA)) xhfA_y:(if x = y then 1 else 0) = (hom (fA ⊚ jA)) yheq:x = yh:1 = 1⊢ x = yneg 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 ⊚ jAx:B₁.carrierA ⊕ B₂.carrierAy:B₁.carrierA ⊕ B₂.carrierAhxy:(hom jA) x = (hom jA) yfA:S.carrierA ⟶ TwoA.carrierAhfA:(↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jAright✝:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ (↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jA) y → y = fAhfA_x:(if x = x then 1 else 0) = (hom (fA ⊚ jA)) xhfA_y:(if x = y then 1 else 0) = (hom (fA ⊚ jA)) yheq:¬x = yh:1 = 0⊢ x = y
· pos 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 ⊚ jAx:B₁.carrierA ⊕ B₂.carrierAy:B₁.carrierA ⊕ B₂.carrierAhxy:(hom jA) x = (hom jA) yfA:S.carrierA ⟶ TwoA.carrierAhfA:(↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jAright✝:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ (↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jA) y → y = fAhfA_x:(if x = x then 1 else 0) = (hom (fA ⊚ jA)) xhfA_y:(if x = y then 1 else 0) = (hom (fA ⊚ jA)) yheq:x = yh:1 = 1⊢ x = y exact heq All goals completed! 🐙
· neg 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 ⊚ jAx:B₁.carrierA ⊕ B₂.carrierAy:B₁.carrierA ⊕ B₂.carrierAhxy:(hom jA) x = (hom jA) yfA:S.carrierA ⟶ TwoA.carrierAhfA:(↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jAright✝:∀ (y : S.carrierA ⟶ TwoA.carrierA), (fun fA ↦ (↾fun b ↦ if x = b then 1 else 0) = fA ⊚ jA) y → y = fAhfA_x:(if x = x then 1 else 0) = (hom (fA ⊚ jA)) xhfA_y:(if x = y then 1 else 0) = (hom (fA ⊚ jA)) yheq:¬x = yh:1 = 0⊢ x = y contradiction 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
have hjA_surj : Function.Surjective jA := by
intro 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)sA:S.carrierA⊢ ∃ a, (hom jA) a = sA
by_contra h_not_mem 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)sA:S.carrierAh_not_mem:¬∃ a, (hom jA) a = sA⊢ False
let f₀ : S.carrierA ⟶ TwoA.carrierA := ↾fun _ ↦ (0 : Fin 2) 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)sA:S.carrierAh_not_mem:¬∃ a, (hom jA) a = sAf₀:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ 0⊢ False
let f₁ : S.carrierA ⟶ TwoA.carrierA :=
↾fun x ↦ if x = sA then (1 : Fin 2) else (0 : Fin 2) 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)sA:S.carrierAh_not_mem:¬∃ a, (hom jA) a = sAf₀:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ 0f₁:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ if x = sA then 1 else 0⊢ False
have h₀ : (↾fun _ ↦ (0 : Fin 2)) = f₀ ⊚ jA := rfl 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)sA:S.carrierAh_not_mem:¬∃ a, (hom jA) a = sAf₀:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ 0f₁:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ if x = sA then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jA⊢ False
have h₁ : (↾fun _ ↦ (0 : Fin 2)) = f₁ ⊚ jA := by 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₂
change ↾(fun _ ↦ (0 : Fin 2)) = ↾(fun x ↦
if (hom jA) x = sA then (1 : Fin 2) else (0 : Fin 2)) 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)sA:S.carrierAh_not_mem:¬∃ a, (hom jA) a = sAf₀:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ 0f₁:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ if x = sA then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jA⊢ (↾fun x ↦ 0) = ↾fun x ↦ if (hom jA) x = sA then 1 else 0
apply congrArg 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)sA:S.carrierAh_not_mem:¬∃ a, (hom jA) a = sAf₀:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ 0f₁:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ if x = sA then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jA⊢ (fun x ↦ 0) = fun x ↦ if (hom jA) x = sA then 1 else 0
funext x 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)sA:S.carrierAh_not_mem:¬∃ a, (hom jA) a = sAf₀:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ 0f₁:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ if x = sA then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jAx:B₁.carrierA ⊕ B₂.carrierA⊢ 0 = if (hom jA) x = sA then 1 else 0
have hnc : ¬(jA x = sA) := fun h ↦ h_not_mem ⟨x, h⟩ 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)sA:S.carrierAh_not_mem:¬∃ a, (hom jA) a = sAf₀:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ 0f₁:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ if x = sA then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jAx:B₁.carrierA ⊕ B₂.carrierAhnc:¬(hom jA) x = sA⊢ 0 = if (hom jA) x = sA then 1 else 0
exact (if_neg hnc).symm 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)sA:S.carrierAh_not_mem:¬∃ a, (hom jA) a = sAf₀:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ 0f₁:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ if x = sA then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jAh₁:(↾fun x ↦ 0) = f₁ ⊚ jA⊢ False
have heq : f₀ = f₁ := (hjA (↾fun _ ↦ (0 : Fin 2))).unique h₀ h₁ 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)sA:S.carrierAh_not_mem:¬∃ a, (hom jA) a = sAf₀:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ 0f₁:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ if x = sA then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jAh₁:(↾fun x ↦ 0) = f₁ ⊚ jAheq:f₀ = f₁⊢ False
have h_absurd : (0 : Fin 2) = f₀ sA := rfl 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)sA:S.carrierAh_not_mem:¬∃ a, (hom jA) a = sAf₀:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ 0f₁:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ if x = sA then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jAh₁:(↾fun x ↦ 0) = f₁ ⊚ jAheq:f₀ = f₁h_absurd:0 = (hom f₀) sA⊢ False
rw [heq 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)sA:S.carrierAh_not_mem:¬∃ a, (hom jA) a = sAf₀:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ 0f₁:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ if x = sA then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jAh₁:(↾fun x ↦ 0) = f₁ ⊚ jAheq:f₀ = f₁h_absurd:0 = (hom f₁) sA⊢ False] at h_absurd 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)sA:S.carrierAh_not_mem:¬∃ a, (hom jA) a = sAf₀:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ 0f₁:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ if x = sA then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jAh₁:(↾fun x ↦ 0) = f₁ ⊚ jAheq:f₀ = f₁h_absurd:0 = (hom f₁) sA⊢ False
change (0 : Fin 2) = (if sA = sA then 1 else (0 : Fin 2))
at h_absurd 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)sA:S.carrierAh_not_mem:¬∃ a, (hom jA) a = sAf₀:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ 0f₁:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ if x = sA then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jAh₁:(↾fun x ↦ 0) = f₁ ⊚ jAheq:f₀ = f₁h_absurd:0 = if sA = sA then 1 else 0⊢ False
rw [if_pos rfl 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)sA:S.carrierAh_not_mem:¬∃ a, (hom jA) a = sAf₀:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ 0f₁:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ if x = sA then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jAh₁:(↾fun x ↦ 0) = f₁ ⊚ jAheq:f₀ = f₁h_absurd:0 = 1⊢ False] at h_absurd 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)sA:S.carrierAh_not_mem:¬∃ a, (hom jA) a = sAf₀:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ 0f₁:S.carrierA ⟶ TwoA.carrierA := ↾fun x ↦ if x = sA then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jAh₁:(↾fun x ↦ 0) = f₁ ⊚ jAheq:f₀ = f₁h_absurd:0 = 1⊢ False
contradiction 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₂
have hSD : ∀ (fD₁ : B₁.carrierD ⟶ TwoD.carrierD)
(fD₂ : B₂.carrierD ⟶ TwoD.carrierD),
∃! fD : S.carrierD ⟶ TwoD.carrierD,
fD₁ = fD ⊚ j₁.val.2 ∧ fD₂ = fD ⊚ j₂.val.2 := by
intro fD₁ fD₂ 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)fD₁:B₁.carrierD ⟶ TwoD.carrierDfD₂:B₂.carrierD ⟶ TwoD.carrierD⊢ ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2
obtain ⟨f, ⟨hf₁, hf₂⟩, hf_uniq⟩ :=
hS₂ (liftTwoD fD₁) (liftTwoD fD₂) 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)fD₁:B₁.carrierD ⟶ TwoD.carrierDfD₂:B₂.carrierD ⟶ TwoD.carrierDf:S ⟶ TwoDhf_uniq:∀ (y : S ⟶ TwoD), (fun f ↦ liftTwoD fD₁ = f ⊚ j₁ ∧ liftTwoD fD₂ = f ⊚ j₂) y → y = fhf₁:liftTwoD fD₁ = f ⊚ j₁hf₂:liftTwoD fD₂ = f ⊚ j₂⊢ ∃! fD, fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2
use f.val.2 h 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)fD₁:B₁.carrierD ⟶ TwoD.carrierDfD₂:B₂.carrierD ⟶ TwoD.carrierDf:S ⟶ TwoDhf_uniq:∀ (y : S ⟶ TwoD), (fun f ↦ liftTwoD fD₁ = f ⊚ j₁ ∧ liftTwoD fD₂ = f ⊚ j₂) y → y = fhf₁:liftTwoD fD₁ = f ⊚ j₁hf₂:liftTwoD fD₂ = f ⊚ j₂⊢ (fun fD ↦ fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2) (↑f).2 ∧
∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2) y → y = (↑f).2
constructor h.left 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)fD₁:B₁.carrierD ⟶ TwoD.carrierDfD₂:B₂.carrierD ⟶ TwoD.carrierDf:S ⟶ TwoDhf_uniq:∀ (y : S ⟶ TwoD), (fun f ↦ liftTwoD fD₁ = f ⊚ j₁ ∧ liftTwoD fD₂ = f ⊚ j₂) y → y = fhf₁:liftTwoD fD₁ = f ⊚ j₁hf₂:liftTwoD fD₂ = f ⊚ j₂⊢ (fun fD ↦ fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2) (↑f).2h.right 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)fD₁:B₁.carrierD ⟶ TwoD.carrierDfD₂:B₂.carrierD ⟶ TwoD.carrierDf:S ⟶ TwoDhf_uniq:∀ (y : S ⟶ TwoD), (fun f ↦ liftTwoD fD₁ = f ⊚ j₁ ∧ liftTwoD fD₂ = f ⊚ j₂) y → y = fhf₁:liftTwoD fD₁ = f ⊚ j₁hf₂:liftTwoD fD₂ = f ⊚ j₂⊢ ∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2) y → y = (↑f).2
· h.left 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)fD₁:B₁.carrierD ⟶ TwoD.carrierDfD₂:B₂.carrierD ⟶ TwoD.carrierDf:S ⟶ TwoDhf_uniq:∀ (y : S ⟶ TwoD), (fun f ↦ liftTwoD fD₁ = f ⊚ j₁ ∧ liftTwoD fD₂ = f ⊚ j₂) y → y = fhf₁:liftTwoD fD₁ = f ⊚ j₁hf₂:liftTwoD fD₂ = f ⊚ j₂⊢ (fun fD ↦ fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2) (↑f).2 constructor h.left.left 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)fD₁:B₁.carrierD ⟶ TwoD.carrierDfD₂:B₂.carrierD ⟶ TwoD.carrierDf:S ⟶ TwoDhf_uniq:∀ (y : S ⟶ TwoD), (fun f ↦ liftTwoD fD₁ = f ⊚ j₁ ∧ liftTwoD fD₂ = f ⊚ j₂) y → y = fhf₁:liftTwoD fD₁ = f ⊚ j₁hf₂:liftTwoD fD₂ = f ⊚ j₂⊢ fD₁ = (↑f).2 ⊚ (↑j₁).2h.left.right 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)fD₁:B₁.carrierD ⟶ TwoD.carrierDfD₂:B₂.carrierD ⟶ TwoD.carrierDf:S ⟶ TwoDhf_uniq:∀ (y : S ⟶ TwoD), (fun f ↦ liftTwoD fD₁ = f ⊚ j₁ ∧ liftTwoD fD₂ = f ⊚ j₂) y → y = fhf₁:liftTwoD fD₁ = f ⊚ j₁hf₂:liftTwoD fD₂ = f ⊚ j₂⊢ fD₂ = (↑f).2 ⊚ (↑j₂).2
· h.left.left 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)fD₁:B₁.carrierD ⟶ TwoD.carrierDfD₂:B₂.carrierD ⟶ TwoD.carrierDf:S ⟶ TwoDhf_uniq:∀ (y : S ⟶ TwoD), (fun f ↦ liftTwoD fD₁ = f ⊚ j₁ ∧ liftTwoD fD₂ = f ⊚ j₂) y → y = fhf₁:liftTwoD fD₁ = f ⊚ j₁hf₂:liftTwoD fD₂ = f ⊚ j₂⊢ fD₁ = (↑f).2 ⊚ (↑j₁).2 exact congr_arg (·.val.2) hf₁ All goals completed! 🐙
· h.left.right 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)fD₁:B₁.carrierD ⟶ TwoD.carrierDfD₂:B₂.carrierD ⟶ TwoD.carrierDf:S ⟶ TwoDhf_uniq:∀ (y : S ⟶ TwoD), (fun f ↦ liftTwoD fD₁ = f ⊚ j₁ ∧ liftTwoD fD₂ = f ⊚ j₂) y → y = fhf₁:liftTwoD fD₁ = f ⊚ j₁hf₂:liftTwoD fD₂ = f ⊚ j₂⊢ fD₂ = (↑f).2 ⊚ (↑j₂).2 exact congr_arg (·.val.2) hf₂ All goals completed! 🐙
· h.right 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)fD₁:B₁.carrierD ⟶ TwoD.carrierDfD₂:B₂.carrierD ⟶ TwoD.carrierDf:S ⟶ TwoDhf_uniq:∀ (y : S ⟶ TwoD), (fun f ↦ liftTwoD fD₁ = f ⊚ j₁ ∧ liftTwoD fD₂ = f ⊚ j₂) y → y = fhf₁:liftTwoD fD₁ = f ⊚ j₁hf₂:liftTwoD fD₂ = f ⊚ j₂⊢ ∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ fD₁ = fD ⊚ (↑j₁).2 ∧ fD₂ = fD ⊚ (↑j₂).2) y → y = (↑f).2 intro fD' ⟨hfD'₁, hfD'₂⟩ h.right 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)fD₁:B₁.carrierD ⟶ TwoD.carrierDfD₂:B₂.carrierD ⟶ TwoD.carrierDf:S ⟶ TwoDhf_uniq:∀ (y : S ⟶ TwoD), (fun f ↦ liftTwoD fD₁ = f ⊚ j₁ ∧ liftTwoD fD₂ = f ⊚ j₂) y → y = fhf₁:liftTwoD fD₁ = f ⊚ j₁hf₂:liftTwoD fD₂ = f ⊚ j₂fD':S.carrierD ⟶ TwoD.carrierDhfD'₁:fD₁ = fD' ⊚ (↑j₁).2hfD'₂:fD₂ = fD' ⊚ (↑j₂).2⊢ fD' = (↑f).2
have := hf_uniq (liftTwoD fD') ⟨
by 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)fD₁:B₁.carrierD ⟶ TwoD.carrierDfD₂:B₂.carrierD ⟶ TwoD.carrierDf:S ⟶ TwoDhf_uniq:∀ (y : S ⟶ TwoD), (fun f ↦ liftTwoD fD₁ = f ⊚ j₁ ∧ liftTwoD fD₂ = f ⊚ j₂) y → y = fhf₁:liftTwoD fD₁ = f ⊚ j₁hf₂:liftTwoD fD₂ = f ⊚ j₂fD':S.carrierD ⟶ TwoD.carrierDhfD'₁:fD₁ = fD' ⊚ (↑j₁).2hfD'₂:fD₂ = fD' ⊚ (↑j₂).2⊢ liftTwoD fD₁ = liftTwoD fD' ⊚ j₁ rw [hfD'₁, 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)fD₁:B₁.carrierD ⟶ TwoD.carrierDfD₂:B₂.carrierD ⟶ TwoD.carrierDf:S ⟶ TwoDhf_uniq:∀ (y : S ⟶ TwoD), (fun f ↦ liftTwoD fD₁ = f ⊚ j₁ ∧ liftTwoD fD₂ = f ⊚ j₂) y → y = fhf₁:liftTwoD fD₁ = f ⊚ j₁hf₂:liftTwoD fD₂ = f ⊚ j₂fD':S.carrierD ⟶ TwoD.carrierDhfD'₁:fD₁ = fD' ⊚ (↑j₁).2hfD'₂:fD₂ = fD' ⊚ (↑j₂).2⊢ liftTwoD (fD' ⊚ (↑j₁).2) = liftTwoD fD' ⊚ j₁ liftTwoD_comp 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)fD₁:B₁.carrierD ⟶ TwoD.carrierDfD₂:B₂.carrierD ⟶ TwoD.carrierDf:S ⟶ TwoDhf_uniq:∀ (y : S ⟶ TwoD), (fun f ↦ liftTwoD fD₁ = f ⊚ j₁ ∧ liftTwoD fD₂ = f ⊚ j₂) y → y = fhf₁:liftTwoD fD₁ = f ⊚ j₁hf₂:liftTwoD fD₂ = f ⊚ j₂fD':S.carrierD ⟶ TwoD.carrierDhfD'₁:fD₁ = fD' ⊚ (↑j₁).2hfD'₂:fD₂ = fD' ⊚ (↑j₂).2⊢ liftTwoD fD' ⊚ j₁ = liftTwoD fD' ⊚ j₁] All goals completed! 🐙,
by 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)fD₁:B₁.carrierD ⟶ TwoD.carrierDfD₂:B₂.carrierD ⟶ TwoD.carrierDf:S ⟶ TwoDhf_uniq:∀ (y : S ⟶ TwoD), (fun f ↦ liftTwoD fD₁ = f ⊚ j₁ ∧ liftTwoD fD₂ = f ⊚ j₂) y → y = fhf₁:liftTwoD fD₁ = f ⊚ j₁hf₂:liftTwoD fD₂ = f ⊚ j₂fD':S.carrierD ⟶ TwoD.carrierDhfD'₁:fD₁ = fD' ⊚ (↑j₁).2hfD'₂:fD₂ = fD' ⊚ (↑j₂).2⊢ liftTwoD fD₂ = liftTwoD fD' ⊚ j₂ rw [hfD'₂, 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)fD₁:B₁.carrierD ⟶ TwoD.carrierDfD₂:B₂.carrierD ⟶ TwoD.carrierDf:S ⟶ TwoDhf_uniq:∀ (y : S ⟶ TwoD), (fun f ↦ liftTwoD fD₁ = f ⊚ j₁ ∧ liftTwoD fD₂ = f ⊚ j₂) y → y = fhf₁:liftTwoD fD₁ = f ⊚ j₁hf₂:liftTwoD fD₂ = f ⊚ j₂fD':S.carrierD ⟶ TwoD.carrierDhfD'₁:fD₁ = fD' ⊚ (↑j₁).2hfD'₂:fD₂ = fD' ⊚ (↑j₂).2⊢ liftTwoD (fD' ⊚ (↑j₂).2) = liftTwoD fD' ⊚ j₂ liftTwoD_comp 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)fD₁:B₁.carrierD ⟶ TwoD.carrierDfD₂:B₂.carrierD ⟶ TwoD.carrierDf:S ⟶ TwoDhf_uniq:∀ (y : S ⟶ TwoD), (fun f ↦ liftTwoD fD₁ = f ⊚ j₁ ∧ liftTwoD fD₂ = f ⊚ j₂) y → y = fhf₁:liftTwoD fD₁ = f ⊚ j₁hf₂:liftTwoD fD₂ = f ⊚ j₂fD':S.carrierD ⟶ TwoD.carrierDhfD'₁:fD₁ = fD' ⊚ (↑j₁).2hfD'₂:fD₂ = fD' ⊚ (↑j₂).2⊢ liftTwoD fD' ⊚ j₂ = liftTwoD fD' ⊚ j₂] All goals completed! 🐙
⟩ h.right 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)fD₁:B₁.carrierD ⟶ TwoD.carrierDfD₂:B₂.carrierD ⟶ TwoD.carrierDf:S ⟶ TwoDhf_uniq:∀ (y : S ⟶ TwoD), (fun f ↦ liftTwoD fD₁ = f ⊚ j₁ ∧ liftTwoD fD₂ = f ⊚ j₂) y → y = fhf₁:liftTwoD fD₁ = f ⊚ j₁hf₂:liftTwoD fD₂ = f ⊚ j₂fD':S.carrierD ⟶ TwoD.carrierDhfD'₁:fD₁ = fD' ⊚ (↑j₁).2hfD'₂:fD₂ = fD' ⊚ (↑j₂).2this:liftTwoD fD' = f⊢ fD' = (↑f).2
exact congr_arg (·.val.2) this 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₂
let jD : B₁.carrierD ⊕ B₂.carrierD ⟶ S.carrierD :=
↾Sum.elim j₁.val.2 j₂.val.2 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
have hjD : ∀ kD : B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD,
∃! fD : S.carrierD ⟶ TwoD.carrierD, kD = fD ⊚ jD := by
intro kD 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)kD:B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierD⊢ ∃! fD, kD = fD ⊚ jD
obtain ⟨fD, ⟨hfD₁, hfD₂⟩, hfD_uniq⟩ :=
hSD (kD ⊚ ↾Sum.inl) (kD ⊚ ↾Sum.inr) 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)kD:B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierDfD:S.carrierD ⟶ TwoD.carrierDhfD_uniq:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2 ∧ kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2) y → y = fDhfD₁:kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2hfD₂:kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2⊢ ∃! fD, kD = fD ⊚ jD
use fD h 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)kD:B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierDfD:S.carrierD ⟶ TwoD.carrierDhfD_uniq:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2 ∧ kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2) y → y = fDhfD₁:kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2hfD₂:kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2⊢ (fun fD ↦ kD = fD ⊚ jD) fD ∧ ∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD = fD ⊚ jD) y → y = fD
constructor h.left 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)kD:B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierDfD:S.carrierD ⟶ TwoD.carrierDhfD_uniq:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2 ∧ kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2) y → y = fDhfD₁:kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2hfD₂:kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2⊢ (fun fD ↦ kD = fD ⊚ jD) fDh.right 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)kD:B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierDfD:S.carrierD ⟶ TwoD.carrierDhfD_uniq:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2 ∧ kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2) y → y = fDhfD₁:kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2hfD₂:kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2⊢ ∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD = fD ⊚ jD) y → y = fD
· h.left 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)kD:B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierDfD:S.carrierD ⟶ TwoD.carrierDhfD_uniq:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2 ∧ kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2) y → y = fDhfD₁:kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2hfD₂:kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2⊢ (fun fD ↦ kD = fD ⊚ jD) fD ext x h.left 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)kD:B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierDfD:S.carrierD ⟶ TwoD.carrierDhfD_uniq:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2 ∧ kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2) y → y = fDhfD₁:kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2hfD₂:kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2x:B₁.carrierD ⊕ B₂.carrierD⊢ (hom kD).toFun x = (hom (fD ⊚ jD)).toFun x
cases x with
| inl bD₁ => h.left.inl 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)kD:B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierDfD:S.carrierD ⟶ TwoD.carrierDhfD_uniq:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2 ∧ kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2) y → y = fDhfD₁:kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2hfD₂:kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2bD₁:B₁.carrierD⊢ (hom kD).toFun (Sum.inl bD₁) = (hom (fD ⊚ jD)).toFun (Sum.inl bD₁) exact congr_hom hfD₁ bD₁ All goals completed! 🐙
| inr hD₂ => h.left.inr 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)kD:B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierDfD:S.carrierD ⟶ TwoD.carrierDhfD_uniq:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2 ∧ kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2) y → y = fDhfD₁:kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2hfD₂:kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2hD₂:B₂.carrierD⊢ (hom kD).toFun (Sum.inr hD₂) = (hom (fD ⊚ jD)).toFun (Sum.inr hD₂) exact congr_hom hfD₂ hD₂ All goals completed! 🐙
· h.right 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)kD:B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierDfD:S.carrierD ⟶ TwoD.carrierDhfD_uniq:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2 ∧ kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2) y → y = fDhfD₁:kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2hfD₂:kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2⊢ ∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD = fD ⊚ jD) y → y = fD intro fD' hfD' h.right 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)kD:B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierDfD:S.carrierD ⟶ TwoD.carrierDhfD_uniq:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2 ∧ kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2) y → y = fDhfD₁:kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2hfD₂:kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2fD':S.carrierD ⟶ TwoD.carrierDhfD':kD = fD' ⊚ jD⊢ fD' = fD
apply hfD_uniq h.right 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)kD:B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierDfD:S.carrierD ⟶ TwoD.carrierDhfD_uniq:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2 ∧ kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2) y → y = fDhfD₁:kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2hfD₂:kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2fD':S.carrierD ⟶ TwoD.carrierDhfD':kD = fD' ⊚ jD⊢ kD ⊚ ↾Sum.inl = fD' ⊚ (↑j₁).2 ∧ kD ⊚ ↾Sum.inr = fD' ⊚ (↑j₂).2
constructor h.right.left 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)kD:B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierDfD:S.carrierD ⟶ TwoD.carrierDhfD_uniq:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2 ∧ kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2) y → y = fDhfD₁:kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2hfD₂:kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2fD':S.carrierD ⟶ TwoD.carrierDhfD':kD = fD' ⊚ jD⊢ kD ⊚ ↾Sum.inl = fD' ⊚ (↑j₁).2h.right.right 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)kD:B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierDfD:S.carrierD ⟶ TwoD.carrierDhfD_uniq:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2 ∧ kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2) y → y = fDhfD₁:kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2hfD₂:kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2fD':S.carrierD ⟶ TwoD.carrierDhfD':kD = fD' ⊚ jD⊢ kD ⊚ ↾Sum.inr = fD' ⊚ (↑j₂).2 <;> h.right.left 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)kD:B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierDfD:S.carrierD ⟶ TwoD.carrierDhfD_uniq:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2 ∧ kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2) y → y = fDhfD₁:kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2hfD₂:kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2fD':S.carrierD ⟶ TwoD.carrierDhfD':kD = fD' ⊚ jD⊢ kD ⊚ ↾Sum.inl = fD' ⊚ (↑j₁).2h.right.right 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)kD:B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierDfD:S.carrierD ⟶ TwoD.carrierDhfD_uniq:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2 ∧ kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2) y → y = fDhfD₁:kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2hfD₂:kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2fD':S.carrierD ⟶ TwoD.carrierDhfD':kD = fD' ⊚ jD⊢ kD ⊚ ↾Sum.inr = fD' ⊚ (↑j₂).2 (rw [hfD' h.right.left 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)kD:B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierDfD:S.carrierD ⟶ TwoD.carrierDhfD_uniq:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2 ∧ kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2) y → y = fDhfD₁:kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2hfD₂:kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2fD':S.carrierD ⟶ TwoD.carrierDhfD':kD = fD' ⊚ jD⊢ (fD' ⊚ jD) ⊚ ↾Sum.inl = fD' ⊚ (↑j₁).2] h.right.left 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)kD:B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierDfD:S.carrierD ⟶ TwoD.carrierDhfD_uniq:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2 ∧ kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2) y → y = fDhfD₁:kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2hfD₂:kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2fD':S.carrierD ⟶ TwoD.carrierDhfD':kD = fD' ⊚ jD⊢ (fD' ⊚ jD) ⊚ ↾Sum.inl = fD' ⊚ (↑j₁).2 h.right.right 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)kD:B₁.carrierD ⊕ B₂.carrierD ⟶ TwoD.carrierDfD:S.carrierD ⟶ TwoD.carrierDhfD_uniq:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2 ∧ kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2) y → y = fDhfD₁:kD ⊚ ↾Sum.inl = fD ⊚ (↑j₁).2hfD₂:kD ⊚ ↾Sum.inr = fD ⊚ (↑j₂).2fD':S.carrierD ⟶ TwoD.carrierDhfD':kD = fD' ⊚ jD⊢ (fD' ⊚ jD) ⊚ ↾Sum.inr = fD' ⊚ (↑j₂).2; rfl 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 ⊚ jD⊢ ∀ (Y : IrreflexiveGraph) (g₁ : B₁ ⟶ Y) (g₂ : B₂ ⟶ Y), ∃! g, g₁ = g ⊚ j₁ ∧ g₂ = g ⊚ j₂
-- Show that jD is injective
have hjD_inj : Function.Injective jD := by
intro x y hxy 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 ⊚ jDx:B₁.carrierD ⊕ B₂.carrierDy:B₁.carrierD ⊕ B₂.carrierDhxy:(hom jD) x = (hom jD) y⊢ x = y
obtain ⟨fD, hfD, _⟩ :=
hjD (↾fun b ↦ if x = b then (1 : Fin 2) else (0 : Fin 2)) 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 ⊚ jDx:B₁.carrierD ⊕ B₂.carrierDy:B₁.carrierD ⊕ B₂.carrierDhxy:(hom jD) x = (hom jD) yfD:S.carrierD ⟶ TwoD.carrierDhfD:(↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jDright✝:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ (↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jD) y → y = fD⊢ x = y
have h : (1 : Fin 2) = (if x = x then 1 else 0) :=
(if_pos rfl).symm 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 ⊚ jDx:B₁.carrierD ⊕ B₂.carrierDy:B₁.carrierD ⊕ B₂.carrierDhxy:(hom jD) x = (hom jD) yfD:S.carrierD ⟶ TwoD.carrierDhfD:(↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jDright✝:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ (↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jD) y → y = fDh:1 = if x = x then 1 else 0⊢ x = y
have hfD_x : (if x = x then (1 : Fin 2) else (0 : Fin 2)) =
(hom (fD ⊚ jD)) x := congr_hom hfD x 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 ⊚ jDx:B₁.carrierD ⊕ B₂.carrierDy:B₁.carrierD ⊕ B₂.carrierDhxy:(hom jD) x = (hom jD) yfD:S.carrierD ⟶ TwoD.carrierDhfD:(↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jDright✝:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ (↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jD) y → y = fDh:1 = if x = x then 1 else 0hfD_x:(if x = x then 1 else 0) = (hom (fD ⊚ jD)) x⊢ x = y
erw [hfD_x 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 ⊚ jDx:B₁.carrierD ⊕ B₂.carrierDy:B₁.carrierD ⊕ B₂.carrierDhxy:(hom jD) x = (hom jD) yfD:S.carrierD ⟶ TwoD.carrierDhfD:(↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jDright✝:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ (↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jD) y → y = fDh:1 = (hom (fD ⊚ jD)) xhfD_x:(if x = x then 1 else 0) = (hom (fD ⊚ jD)) x⊢ x = y] 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 ⊚ jDx:B₁.carrierD ⊕ B₂.carrierDy:B₁.carrierD ⊕ B₂.carrierDhxy:(hom jD) x = (hom jD) yfD:S.carrierD ⟶ TwoD.carrierDhfD:(↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jDright✝:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ (↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jD) y → y = fDh:1 = (hom (fD ⊚ jD)) xhfD_x:(if x = x then 1 else 0) = (hom (fD ⊚ jD)) x⊢ x = y at h
rw [types_comp_apply, 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 ⊚ jDx:B₁.carrierD ⊕ B₂.carrierDy:B₁.carrierD ⊕ B₂.carrierDhxy:(hom jD) x = (hom jD) yfD:S.carrierD ⟶ TwoD.carrierDhfD:(↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jDright✝:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ (↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jD) y → y = fDh:1 = (hom fD) ((hom jD) x)hfD_x:(if x = x then 1 else 0) = (hom (fD ⊚ jD)) x⊢ x = y hxy, 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 ⊚ jDx:B₁.carrierD ⊕ B₂.carrierDy:B₁.carrierD ⊕ B₂.carrierDhxy:(hom jD) x = (hom jD) yfD:S.carrierD ⟶ TwoD.carrierDhfD:(↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jDright✝:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ (↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jD) y → y = fDh:1 = (hom fD) ((hom jD) y)hfD_x:(if x = x then 1 else 0) = (hom (fD ⊚ jD)) x⊢ x = y ← types_comp_apply jD fD 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 ⊚ jDx:B₁.carrierD ⊕ B₂.carrierDy:B₁.carrierD ⊕ B₂.carrierDhxy:(hom jD) x = (hom jD) yfD:S.carrierD ⟶ TwoD.carrierDhfD:(↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jDright✝:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ (↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jD) y → y = fDh:1 = (hom (fD ⊚ jD)) yhfD_x:(if x = x then 1 else 0) = (hom (fD ⊚ jD)) x⊢ x = y] at h 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 ⊚ jDx:B₁.carrierD ⊕ B₂.carrierDy:B₁.carrierD ⊕ B₂.carrierDhxy:(hom jD) x = (hom jD) yfD:S.carrierD ⟶ TwoD.carrierDhfD:(↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jDright✝:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ (↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jD) y → y = fDh:1 = (hom (fD ⊚ jD)) yhfD_x:(if x = x then 1 else 0) = (hom (fD ⊚ jD)) x⊢ x = y
have hfD_y : (if x = y then (1 : Fin 2) else (0 : Fin 2)) =
(hom (fD ⊚ jD)) y := congr_hom hfD y 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 ⊚ jDx:B₁.carrierD ⊕ B₂.carrierDy:B₁.carrierD ⊕ B₂.carrierDhxy:(hom jD) x = (hom jD) yfD:S.carrierD ⟶ TwoD.carrierDhfD:(↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jDright✝:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ (↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jD) y → y = fDh:1 = (hom (fD ⊚ jD)) yhfD_x:(if x = x then 1 else 0) = (hom (fD ⊚ jD)) xhfD_y:(if x = y then 1 else 0) = (hom (fD ⊚ jD)) y⊢ x = y
erw [← hfD_y 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 ⊚ jDx:B₁.carrierD ⊕ B₂.carrierDy:B₁.carrierD ⊕ B₂.carrierDhxy:(hom jD) x = (hom jD) yfD:S.carrierD ⟶ TwoD.carrierDhfD:(↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jDright✝:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ (↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jD) y → y = fDh:1 = if x = y then 1 else 0hfD_x:(if x = x then 1 else 0) = (hom (fD ⊚ jD)) xhfD_y:(if x = y then 1 else 0) = (hom (fD ⊚ jD)) y⊢ x = y] 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 ⊚ jDx:B₁.carrierD ⊕ B₂.carrierDy:B₁.carrierD ⊕ B₂.carrierDhxy:(hom jD) x = (hom jD) yfD:S.carrierD ⟶ TwoD.carrierDhfD:(↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jDright✝:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ (↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jD) y → y = fDh:1 = if x = y then 1 else 0hfD_x:(if x = x then 1 else 0) = (hom (fD ⊚ jD)) xhfD_y:(if x = y then 1 else 0) = (hom (fD ⊚ jD)) y⊢ x = y at h
split_ifs at h with heq pos 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 ⊚ jDx:B₁.carrierD ⊕ B₂.carrierDy:B₁.carrierD ⊕ B₂.carrierDhxy:(hom jD) x = (hom jD) yfD:S.carrierD ⟶ TwoD.carrierDhfD:(↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jDright✝:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ (↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jD) y → y = fDhfD_x:(if x = x then 1 else 0) = (hom (fD ⊚ jD)) xhfD_y:(if x = y then 1 else 0) = (hom (fD ⊚ jD)) yheq:x = yh:1 = 1⊢ x = yneg 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 ⊚ jDx:B₁.carrierD ⊕ B₂.carrierDy:B₁.carrierD ⊕ B₂.carrierDhxy:(hom jD) x = (hom jD) yfD:S.carrierD ⟶ TwoD.carrierDhfD:(↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jDright✝:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ (↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jD) y → y = fDhfD_x:(if x = x then 1 else 0) = (hom (fD ⊚ jD)) xhfD_y:(if x = y then 1 else 0) = (hom (fD ⊚ jD)) yheq:¬x = yh:1 = 0⊢ x = y
· pos 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 ⊚ jDx:B₁.carrierD ⊕ B₂.carrierDy:B₁.carrierD ⊕ B₂.carrierDhxy:(hom jD) x = (hom jD) yfD:S.carrierD ⟶ TwoD.carrierDhfD:(↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jDright✝:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ (↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jD) y → y = fDhfD_x:(if x = x then 1 else 0) = (hom (fD ⊚ jD)) xhfD_y:(if x = y then 1 else 0) = (hom (fD ⊚ jD)) yheq:x = yh:1 = 1⊢ x = y exact heq All goals completed! 🐙
· neg 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 ⊚ jDx:B₁.carrierD ⊕ B₂.carrierDy:B₁.carrierD ⊕ B₂.carrierDhxy:(hom jD) x = (hom jD) yfD:S.carrierD ⟶ TwoD.carrierDhfD:(↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jDright✝:∀ (y : S.carrierD ⟶ TwoD.carrierD), (fun fD ↦ (↾fun b ↦ if x = b then 1 else 0) = fD ⊚ jD) y → y = fDhfD_x:(if x = x then 1 else 0) = (hom (fD ⊚ jD)) xhfD_y:(if x = y then 1 else 0) = (hom (fD ⊚ jD)) yheq:¬x = yh:1 = 0⊢ x = y contradiction 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
have hjD_surj : Function.Surjective jD := by
intro 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)sD:S.carrierD⊢ ∃ a, (hom jD) a = sD
by_contra h_not_mem 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)sD:S.carrierDh_not_mem:¬∃ a, (hom jD) a = sD⊢ False
let f₀ : S.carrierD ⟶ TwoD.carrierD := ↾fun _ ↦ (0 : Fin 2) 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)sD:S.carrierDh_not_mem:¬∃ a, (hom jD) a = sDf₀:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ 0⊢ False
let f₁ : S.carrierD ⟶ TwoD.carrierD :=
↾fun x ↦ if x = sD then (1 : Fin 2) else (0 : Fin 2) 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)sD:S.carrierDh_not_mem:¬∃ a, (hom jD) a = sDf₀:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ 0f₁:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ if x = sD then 1 else 0⊢ False
have h₀ : (↾fun _ ↦ (0 : Fin 2)) = f₀ ⊚ jD := rfl 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)sD:S.carrierDh_not_mem:¬∃ a, (hom jD) a = sDf₀:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ 0f₁:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ if x = sD then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jD⊢ False
have h₁ : (↾fun _ ↦ (0 : Fin 2)) = f₁ ⊚ jD := by 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₂
change ↾(fun _ ↦ (0 : Fin 2)) = ↾(fun x ↦
if (hom jD) x = sD then (1 : Fin 2) else (0 : Fin 2)) 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)sD:S.carrierDh_not_mem:¬∃ a, (hom jD) a = sDf₀:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ 0f₁:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ if x = sD then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jD⊢ (↾fun x ↦ 0) = ↾fun x ↦ if (hom jD) x = sD then 1 else 0
apply congrArg 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)sD:S.carrierDh_not_mem:¬∃ a, (hom jD) a = sDf₀:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ 0f₁:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ if x = sD then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jD⊢ (fun x ↦ 0) = fun x ↦ if (hom jD) x = sD then 1 else 0
funext x 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)sD:S.carrierDh_not_mem:¬∃ a, (hom jD) a = sDf₀:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ 0f₁:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ if x = sD then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jDx:B₁.carrierD ⊕ B₂.carrierD⊢ 0 = if (hom jD) x = sD then 1 else 0
have hnc : ¬(jD x = sD) := fun h ↦ h_not_mem ⟨x, h⟩ 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)sD:S.carrierDh_not_mem:¬∃ a, (hom jD) a = sDf₀:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ 0f₁:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ if x = sD then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jDx:B₁.carrierD ⊕ B₂.carrierDhnc:¬(hom jD) x = sD⊢ 0 = if (hom jD) x = sD then 1 else 0
exact (if_neg hnc).symm 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)sD:S.carrierDh_not_mem:¬∃ a, (hom jD) a = sDf₀:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ 0f₁:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ if x = sD then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jDh₁:(↾fun x ↦ 0) = f₁ ⊚ jD⊢ False
have heq : f₀ = f₁ := (hjD (↾fun _ ↦ (0 : Fin 2))).unique h₀ h₁ 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)sD:S.carrierDh_not_mem:¬∃ a, (hom jD) a = sDf₀:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ 0f₁:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ if x = sD then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jDh₁:(↾fun x ↦ 0) = f₁ ⊚ jDheq:f₀ = f₁⊢ False
have h_absurd : (0 : Fin 2) = f₀ sD := rfl 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)sD:S.carrierDh_not_mem:¬∃ a, (hom jD) a = sDf₀:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ 0f₁:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ if x = sD then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jDh₁:(↾fun x ↦ 0) = f₁ ⊚ jDheq:f₀ = f₁h_absurd:0 = (hom f₀) sD⊢ False
rw [heq 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)sD:S.carrierDh_not_mem:¬∃ a, (hom jD) a = sDf₀:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ 0f₁:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ if x = sD then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jDh₁:(↾fun x ↦ 0) = f₁ ⊚ jDheq:f₀ = f₁h_absurd:0 = (hom f₁) sD⊢ False] at h_absurd 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)sD:S.carrierDh_not_mem:¬∃ a, (hom jD) a = sDf₀:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ 0f₁:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ if x = sD then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jDh₁:(↾fun x ↦ 0) = f₁ ⊚ jDheq:f₀ = f₁h_absurd:0 = (hom f₁) sD⊢ False
change (0 : Fin 2) = (if sD = sD then 1 else (0 : Fin 2))
at h_absurd 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)sD:S.carrierDh_not_mem:¬∃ a, (hom jD) a = sDf₀:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ 0f₁:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ if x = sD then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jDh₁:(↾fun x ↦ 0) = f₁ ⊚ jDheq:f₀ = f₁h_absurd:0 = if sD = sD then 1 else 0⊢ False
rw [if_pos rfl 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)sD:S.carrierDh_not_mem:¬∃ a, (hom jD) a = sDf₀:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ 0f₁:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ if x = sD then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jDh₁:(↾fun x ↦ 0) = f₁ ⊚ jDheq:f₀ = f₁h_absurd:0 = 1⊢ False] at h_absurd 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)sD:S.carrierDh_not_mem:¬∃ a, (hom jD) a = sDf₀:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ 0f₁:S.carrierD ⟶ TwoD.carrierD := ↾fun x ↦ if x = sD then 1 else 0h₀:(↾fun x ↦ 0) = f₀ ⊚ jDh₁:(↾fun x ↦ 0) = f₁ ⊚ jDheq:f₀ = f₁h_absurd:0 = 1⊢ False
contradiction 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₂
intro Y g₁ g₂ 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
let eA : B₁.carrierA ⊕ B₂.carrierA ≃ S.carrierA :=
Equiv.ofBijective jA ⟨hjA_inj, hjA_surj⟩ 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
let eD : B₁.carrierD ⊕ B₂.carrierD ≃ S.carrierD :=
Equiv.ofBijective jD ⟨hjD_inj, hjD_surj⟩ 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)),
⟨by 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
ext 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) ⋯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
obtain ⟨bA, rfl⟩ := eA.surjective 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)
dsimp 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)))
rw [Equiv.symm_apply_apply 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)] 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
| inl bA₁ => inl 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₁))
change Sum.elim g₁.val.2 g₂.val.2
(eD.symm ((S.toSrc ⊚ j₁.val.1) bA₁)) = _ inl 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₁))
rw [← j₁.property.1 inl 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₁))] inl 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₁))
change Sum.elim g₁.val.2 g₂.val.2
(eD.symm (eD (Sum.inl (B₁.toSrc bA₁)))) = _ inl 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₁))
rw [Equiv.symm_apply_apply inl 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₁))] inl 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₁))
exact congr_hom g₁.property.1 bA₁ All goals completed! 🐙
| inr bA₂ => inr 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₂))
change Sum.elim g₁.val.2 g₂.val.2
(eD.symm ((S.toSrc ⊚ j₂.val.1) bA₂)) = _ inr 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₂))
rw [← j₂.property.1 inr 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₂))] inr 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₂))
change Sum.elim g₁.val.2 g₂.val.2
(eD.symm (eD (Sum.inr (B₂.toSrc bA₂)))) = _ inr 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₂))
rw [Equiv.symm_apply_apply inr 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₂))] inr 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₂))
exact congr_hom g₂.property.1 bA₂ All goals completed! 🐙,
by 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
ext 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) ⋯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
obtain ⟨bA, rfl⟩ := eA.surjective 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)
dsimp 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)))
rw [Equiv.symm_apply_apply 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)] 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
| inl bA₁ => inl 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₁))
change Sum.elim g₁.val.2 g₂.val.2
(eD.symm ((S.toTgt ⊚ j₁.val.1) bA₁)) = _ inl 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₁))
rw [← j₁.property.2 inl 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₁))] inl 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₁))
change Sum.elim g₁.val.2 g₂.val.2
(eD.symm (eD (Sum.inl (B₁.toTgt bA₁)))) = _ inl 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₁))
rw [Equiv.symm_apply_apply inl 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₁))] inl 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₁))
exact congr_hom g₁.property.2 bA₁ All goals completed! 🐙
| inr bA₂ => inr 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₂))
change Sum.elim g₁.val.2 g₂.val.2
(eD.symm ((S.toTgt ⊚ j₂.val.1) bA₂)) = _ inr 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₂))
rw [← j₂.property.2 inr 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₂))] inr 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₂))
change Sum.elim g₁.val.2 g₂.val.2
(eD.symm (eD (Sum.inr (B₂.toTgt bA₂)))) = _ inr 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₂))
rw [Equiv.symm_apply_apply inr 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₂))] inr 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₂))
exact congr_hom g₂.property.2 bA₂ All goals completed! 🐙⟩
⟩
constructor h.left 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)),
⋯⟩h.right 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)),
⋯⟩
· h.left 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
constructor h.left.left 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₁h.left.right 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₂ <;> h.left.left 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₁h.left.right 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₂ ext b h.left.right.hA 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
bh.left.right.hD 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
· h.left.left.hA 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 change _ = Sum.elim g₁.val.1 g₂.val.1
(eA.symm (eA (Sum.inl b))) h.left.left.hA 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)))
rw [Equiv.symm_apply_apply h.left.left.hA 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)] h.left.left.hA 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); rfl All goals completed! 🐙
· h.left.left.hD 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 change _ = Sum.elim g₁.val.2 g₂.val.2
(eD.symm (eD (Sum.inl b))) h.left.left.hD 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)))
rw [Equiv.symm_apply_apply h.left.left.hD 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)] h.left.left.hD 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); rfl All goals completed! 🐙
· h.left.right.hA 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 change _ = Sum.elim g₁.val.1 g₂.val.1
(eA.symm (eA (Sum.inr b))) h.left.right.hA 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)))
rw [Equiv.symm_apply_apply h.left.right.hA 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)] h.left.right.hA 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); rfl All goals completed! 🐙
· h.left.right.hD 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 change _ = Sum.elim g₁.val.2 g₂.val.2
(eD.symm (eD (Sum.inr b))) h.left.right.hD 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)))
rw [Equiv.symm_apply_apply h.left.right.hD 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)] h.left.right.hD 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); rfl All goals completed! 🐙
· h.right 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
intro f' ⟨h₁, h₂⟩ h.right 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)),
⋯⟩
ext s h.right.hA 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
sh.right.hD 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).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 <;> h.right.hA 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
sh.right.hD 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).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 dsimp h.right.hD 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)
· h.right.hA 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 [← Equiv.apply_symm_apply eA s h.right.hA 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)] h.right.hA 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
| inl bA₁ => h.right.hA.inl 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₁)
exact congr_fun (congr_arg (·.val.1) h₁.symm) bA₁ All goals completed! 🐙
| inr bA₂ => h.right.hA.inr 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₂)
exact congr_fun (congr_arg (·.val.1) h₂.symm) bA₂ All goals completed! 🐙
· h.right.hD 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 [← Equiv.apply_symm_apply eD s h.right.hD 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)] h.right.hD 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
| inl bD₁ => h.right.hD.inl 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₁)
exact congr_fun (congr_arg (·.val.2) h₁.symm) bD₁ All goals completed! 🐙
| inr bD₂ => h.right.hD.inr 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₂)
exact congr_fun (congr_arg (·.val.2) h₂.symm) bD₂ All goals completed! 🐙
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) := by Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:X.carrierD ⟶ Tricolourh:IsTricolouring X c⊢ IsTricolouring Y (inducedColouring f c)
intro a 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)
change c ((f.val.2 ⊚ Y.toSrc) a) ≠ c ((f.val.2 ⊚ 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)
rw [f.property.1, 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 ((↑f).2 ⊚ Y.toTgt)) a) f.property.2 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)] 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)
exact h (f.val.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),
⟨by 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 ext x 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; exact Empty.elim x All goals completed! 🐙,
by 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 ext x 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; exact Empty.elim x All goals completed! 🐙⟩
⟩
def tgtDot {X : IrreflexiveGraph} (a : X.carrierA) : Dot X := ⟨
(↾Empty.elim, ↾fun _ ↦ X.toTgt a),
⟨by 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 ext x 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; exact Empty.elim x All goals completed! 🐙,
by 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 ext x 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; exact Empty.elim 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) := by Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X c⊢ IsTricolouring' Y (inducedColouring' f c)
intro a 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)
change c (f ⊚ srcDot a) ≠ c (f ⊚ 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)
have h_src : f ⊚ srcDot a = srcDot (f.val.1 a) := by Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X c⊢ IsTricolouring' Y (inducedColouring' f c)
apply IrreflexiveGraph.hom_ext hA Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X ca:Y.carrierA⊢ (↑(f ⊚ srcDot a)).1 = (↑(srcDot ((hom (↑f).1) a))).1hD Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X ca:Y.carrierA⊢ (↑(f ⊚ srcDot a)).2 = (↑(srcDot ((hom (↑f).1) a))).2 <;> hA Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X ca:Y.carrierA⊢ (↑(f ⊚ srcDot a)).1 = (↑(srcDot ((hom (↑f).1) a))).1hD Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X ca:Y.carrierA⊢ (↑(f ⊚ srcDot a)).2 = (↑(srcDot ((hom (↑f).1) a))).2 ext x hD Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X ca:Y.carrierAx:IrreflexiveGraph.D.carrierD⊢ (hom (↑(f ⊚ srcDot a)).2).toFun x = (hom (↑(srcDot ((hom (↑f).1) a))).2).toFun x
· hA Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X ca:Y.carrierAx:IrreflexiveGraph.D.carrierA⊢ (hom (↑(f ⊚ srcDot a)).1).toFun x = (hom (↑(srcDot ((hom (↑f).1) a))).1).toFun x exact Empty.elim x All goals completed! 🐙
· hD Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X ca:Y.carrierAx:IrreflexiveGraph.D.carrierD⊢ (hom (↑(f ⊚ srcDot a)).2).toFun x = (hom (↑(srcDot ((hom (↑f).1) a))).2).toFun x exact congr_hom f.property.1 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)
have h_tgt : f ⊚ tgtDot a = tgtDot (f.val.1 a) := by Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X c⊢ IsTricolouring' Y (inducedColouring' f c)
apply IrreflexiveGraph.hom_ext hA Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X ca:Y.carrierAh_src:f ⊚ srcDot a = srcDot ((hom (↑f).1) a)⊢ (↑(f ⊚ tgtDot a)).1 = (↑(tgtDot ((hom (↑f).1) a))).1hD Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X ca:Y.carrierAh_src:f ⊚ srcDot a = srcDot ((hom (↑f).1) a)⊢ (↑(f ⊚ tgtDot a)).2 = (↑(tgtDot ((hom (↑f).1) a))).2 <;> hA Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X ca:Y.carrierAh_src:f ⊚ srcDot a = srcDot ((hom (↑f).1) a)⊢ (↑(f ⊚ tgtDot a)).1 = (↑(tgtDot ((hom (↑f).1) a))).1hD Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X ca:Y.carrierAh_src:f ⊚ srcDot a = srcDot ((hom (↑f).1) a)⊢ (↑(f ⊚ tgtDot a)).2 = (↑(tgtDot ((hom (↑f).1) a))).2 ext x hD Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X ca:Y.carrierAh_src:f ⊚ srcDot a = srcDot ((hom (↑f).1) a)x:IrreflexiveGraph.D.carrierD⊢ (hom (↑(f ⊚ tgtDot a)).2).toFun x = (hom (↑(tgtDot ((hom (↑f).1) a))).2).toFun x
· hA Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X ca:Y.carrierAh_src:f ⊚ srcDot a = srcDot ((hom (↑f).1) a)x:IrreflexiveGraph.D.carrierA⊢ (hom (↑(f ⊚ tgtDot a)).1).toFun x = (hom (↑(tgtDot ((hom (↑f).1) a))).1).toFun x exact Empty.elim x All goals completed! 🐙
· hD Y:IrreflexiveGraphX:IrreflexiveGraphf:Y ⟶ Xc:Dot X ⟶ Tricolourh:IsTricolouring' X ca:Y.carrierAh_src:f ⊚ srcDot a = srcDot ((hom (↑f).1) a)x:IrreflexiveGraph.D.carrierD⊢ (hom (↑(f ⊚ tgtDot a)).2).toFun x = (hom (↑(tgtDot ((hom (↑f).1) a))).2).toFun x exact congr_hom f.property.2 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)
rw [h_src, 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) (f ⊚ tgtDot a) h_tgt 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))] 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))
exact h (f.val.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 := by Y:IrreflexiveGraphc:Y.carrierD ⟶ Tricolourh:IsTricolouring Y c⊢ ∃! g, inducedColouring g (𝟙 F.carrierD) = c
refine ⟨
⟨(↾fun a ↦ ⟨(c (Y.toSrc a), c (Y.toTgt a)), h a⟩, c),
⟨rfl, rfl⟩⟩,
rfl,
?_
⟩ 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), ⋯⟩
rintro ⟨⟨_, gD⟩, h_src, h_tgt⟩ (rfl : gD = 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), ⋯⟩
apply IrreflexiveGraph.hom_ext hA 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), ⋯⟩).1hD 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
· hA 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 ext a hA 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
apply Subtype.ext hA 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)
apply Prod.ext hA.fst 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)).1hA.snd 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
· hA.fst 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 exact congr_hom h_src.symm a All goals completed! 🐙
· hA.snd 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 exact congr_hom h_tgt.symm a All goals completed! 🐙
· hD 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 rfl All goals completed! 🐙
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)) := by ⊢ ∀ (X : IrreflexiveGraph), Xor (Nonempty (X ⟶ IrreflexiveGraph.Zero)) (Nonempty (D ⟶ X))
intro X X:IrreflexiveGraph⊢ Xor (Nonempty (X ⟶ IrreflexiveGraph.Zero)) (Nonempty (D ⟶ X))
by_cases h : Nonempty X.carrierD pos X:IrreflexiveGraphh:Nonempty X.carrierD⊢ Xor (Nonempty (X ⟶ IrreflexiveGraph.Zero)) (Nonempty (D ⟶ X))neg X:IrreflexiveGraphh:¬Nonempty X.carrierD⊢ Xor (Nonempty (X ⟶ IrreflexiveGraph.Zero)) (Nonempty (D ⟶ X))
· pos X:IrreflexiveGraphh:Nonempty X.carrierD⊢ Xor (Nonempty (X ⟶ IrreflexiveGraph.Zero)) (Nonempty (D ⟶ X)) right pos X:IrreflexiveGraphh:Nonempty X.carrierD⊢ Nonempty (D ⟶ X) ∧ ¬Nonempty (X ⟶ IrreflexiveGraph.Zero)
constructor pos.left X:IrreflexiveGraphh:Nonempty X.carrierD⊢ Nonempty (D ⟶ X)pos.right X:IrreflexiveGraphh:Nonempty X.carrierD⊢ ¬Nonempty (X ⟶ IrreflexiveGraph.Zero) <;> pos.left X:IrreflexiveGraphh:Nonempty X.carrierD⊢ Nonempty (D ⟶ X)pos.right X:IrreflexiveGraphh:Nonempty X.carrierD⊢ ¬Nonempty (X ⟶ IrreflexiveGraph.Zero) obtain ⟨dX⟩ := h pos.right X:IrreflexiveGraphdX:X.carrierD⊢ ¬Nonempty (X ⟶ IrreflexiveGraph.Zero)
· pos.left X:IrreflexiveGraphdX:X.carrierD⊢ Nonempty (D ⟶ X) refine ⟨⟨(↾Empty.elim, ↾fun _ ↦ dX), ⟨?_, ?_⟩⟩⟩ pos.left.refine_1 X:IrreflexiveGraphdX:X.carrierD⊢ (↾Empty.elim, ↾fun x ↦ dX).2 ⊚ D.toSrc = X.toSrc ⊚ (↾Empty.elim, ↾fun x ↦ dX).1pos.left.refine_2 X:IrreflexiveGraphdX:X.carrierD⊢ (↾Empty.elim, ↾fun x ↦ dX).2 ⊚ D.toTgt = X.toTgt ⊚ (↾Empty.elim, ↾fun x ↦ dX).1
all_goals
ext aD pos.left.refine_2 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
nomatch aD All goals completed! 🐙
· pos.right X:IrreflexiveGraphdX:X.carrierD⊢ ¬Nonempty (X ⟶ IrreflexiveGraph.Zero) rintro ⟨f⟩ pos.right X:IrreflexiveGraphdX:X.carrierDf:X ⟶ IrreflexiveGraph.Zero⊢ False
nomatch (f.val.2 dX) All goals completed! 🐙
· neg X:IrreflexiveGraphh:¬Nonempty X.carrierD⊢ Xor (Nonempty (X ⟶ IrreflexiveGraph.Zero)) (Nonempty (D ⟶ X)) left neg X:IrreflexiveGraphh:¬Nonempty X.carrierD⊢ Nonempty (X ⟶ IrreflexiveGraph.Zero) ∧ ¬Nonempty (D ⟶ X)
constructor neg.left X:IrreflexiveGraphh:¬Nonempty X.carrierD⊢ Nonempty (X ⟶ IrreflexiveGraph.Zero)neg.right X:IrreflexiveGraphh:¬Nonempty X.carrierD⊢ ¬Nonempty (D ⟶ X)
· neg.left X:IrreflexiveGraphh:¬Nonempty X.carrierD⊢ Nonempty (X ⟶ IrreflexiveGraph.Zero) refine ⟨⟨(↾fun aX ↦ False.elim (h ⟨X.toSrc aX⟩),
↾fun dX ↦ False.elim (h ⟨dX⟩)), ⟨?_, ?_⟩⟩⟩ neg.left.refine_1 X:IrreflexiveGraphh:¬Nonempty X.carrierD⊢ (↾fun aX ↦ ⋯.elim, ↾fun dX ↦ ⋯.elim).2 ⊚ X.toSrc = IrreflexiveGraph.Zero.toSrc ⊚ (↾fun aX ↦ ⋯.elim, ↾fun dX ↦ ⋯.elim).1neg.left.refine_2 X: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
ext aX neg.left.refine_2 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
· neg.left.refine_1 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 exact False.elim (h ⟨X.toSrc aX⟩) All goals completed! 🐙
· neg.left.refine_2 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 exact False.elim (h ⟨X.toTgt aX⟩) All goals completed! 🐙
· neg.right X:IrreflexiveGraphh:¬Nonempty X.carrierD⊢ ¬Nonempty (D ⟶ X) rintro ⟨g⟩ neg.right X:IrreflexiveGraphh:¬Nonempty X.carrierDg:D ⟶ X⊢ False
exact h ⟨g.val.2 ()⟩ 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)) := by ⊢ ∀ (X : IrreflexiveGraph), Xor (Nonempty (X ⟶ D)) (Nonempty (A ⟶ X))
intro X X:IrreflexiveGraph⊢ Xor (Nonempty (X ⟶ D)) (Nonempty (A ⟶ X))
by_cases h : Nonempty X.carrierA pos X:IrreflexiveGraphh:Nonempty X.carrierA⊢ Xor (Nonempty (X ⟶ D)) (Nonempty (A ⟶ X))neg X:IrreflexiveGraphh:¬Nonempty X.carrierA⊢ Xor (Nonempty (X ⟶ D)) (Nonempty (A ⟶ X))
· pos X:IrreflexiveGraphh:Nonempty X.carrierA⊢ Xor (Nonempty (X ⟶ D)) (Nonempty (A ⟶ X)) right pos X:IrreflexiveGraphh:Nonempty X.carrierA⊢ Nonempty (A ⟶ X) ∧ ¬Nonempty (X ⟶ D)
constructor pos.left X:IrreflexiveGraphh:Nonempty X.carrierA⊢ Nonempty (A ⟶ X)pos.right X:IrreflexiveGraphh:Nonempty X.carrierA⊢ ¬Nonempty (X ⟶ D) <;> pos.left X:IrreflexiveGraphh:Nonempty X.carrierA⊢ Nonempty (A ⟶ X)pos.right X:IrreflexiveGraphh:Nonempty X.carrierA⊢ ¬Nonempty (X ⟶ D) obtain ⟨aX⟩ := h pos.right X:IrreflexiveGraphaX:X.carrierA⊢ ¬Nonempty (X ⟶ D)
· pos.left X:IrreflexiveGraphaX:X.carrierA⊢ Nonempty (A ⟶ X) refine ⟨⟨(↾fun _ ↦ aX,
↾fun | (0 : Fin 2) => X.toSrc aX
| (1 : Fin 2) => X.toTgt aX), ⟨?_, ?_⟩⟩⟩ pos.left.refine_1 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).1pos.left.refine_2 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.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
ext aA pos.left.refine_2 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
rfl All goals completed! 🐙
· pos.right X:IrreflexiveGraphaX:X.carrierA⊢ ¬Nonempty (X ⟶ D) rintro ⟨f⟩ pos.right X:IrreflexiveGraphaX:X.carrierAf:X ⟶ D⊢ False
nomatch (f.val.1 aX) All goals completed! 🐙
· neg X:IrreflexiveGraphh:¬Nonempty X.carrierA⊢ Xor (Nonempty (X ⟶ D)) (Nonempty (A ⟶ X)) left neg X:IrreflexiveGraphh:¬Nonempty X.carrierA⊢ Nonempty (X ⟶ D) ∧ ¬Nonempty (A ⟶ X)
rw [not_nonempty_iff neg X:IrreflexiveGraphh:IsEmpty X.carrierA⊢ Nonempty (X ⟶ D) ∧ ¬Nonempty (A ⟶ X)] at h neg X:IrreflexiveGraphh:IsEmpty X.carrierA⊢ Nonempty (X ⟶ D) ∧ ¬Nonempty (A ⟶ X)
constructor neg.left X:IrreflexiveGraphh:IsEmpty X.carrierA⊢ Nonempty (X ⟶ D)neg.right X:IrreflexiveGraphh:IsEmpty X.carrierA⊢ ¬Nonempty (A ⟶ X)
· neg.left X:IrreflexiveGraphh:IsEmpty X.carrierA⊢ Nonempty (X ⟶ D) refine ⟨⟨(↾fun aX ↦ IsEmpty.elim h aX, ↾fun _ ↦ ()),
⟨?_, ?_⟩⟩⟩ neg.left.refine_1 X:IrreflexiveGraphh:IsEmpty X.carrierA⊢ (↾fun aX ↦ h.elim aX, ↾fun x ↦ ()).2 ⊚ X.toSrc = D.toSrc ⊚ (↾fun aX ↦ h.elim aX, ↾fun x ↦ ()).1neg.left.refine_2 X: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
rfl All goals completed! 🐙
· neg.right X:IrreflexiveGraphh:IsEmpty X.carrierA⊢ ¬Nonempty (A ⟶ X) rintro ⟨g⟩ neg.right X:IrreflexiveGraphh:IsEmpty X.carrierAg:A ⟶ X⊢ False
exact IsEmpty.elim h (g.val.1 ()) 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)) := by ⊢ ∀ (X : IrreflexiveGraph), Xor (Nonempty (X ⟶ A)) (Nonempty (A₂ ⟶ X))
intro X X:IrreflexiveGraph⊢ Xor (Nonempty (X ⟶ A)) (Nonempty (A₂ ⟶ X))
by_cases h : ∃ a₁ a₂ : X.carrierA, X.toSrc a₂ = X.toTgt a₁ pos X:IrreflexiveGraphh:∃ a₁ a₂, (hom X.toSrc) a₂ = (hom X.toTgt) a₁⊢ Xor (Nonempty (X ⟶ A)) (Nonempty (A₂ ⟶ X))neg X:IrreflexiveGraphh:¬∃ a₁ a₂, (hom X.toSrc) a₂ = (hom X.toTgt) a₁⊢ Xor (Nonempty (X ⟶ A)) (Nonempty (A₂ ⟶ X))
· pos X:IrreflexiveGraphh:∃ a₁ a₂, (hom X.toSrc) a₂ = (hom X.toTgt) a₁⊢ Xor (Nonempty (X ⟶ A)) (Nonempty (A₂ ⟶ X)) right pos X:IrreflexiveGraphh:∃ a₁ a₂, (hom X.toSrc) a₂ = (hom X.toTgt) a₁⊢ Nonempty (A₂ ⟶ X) ∧ ¬Nonempty (X ⟶ A)
constructor pos.left X:IrreflexiveGraphh:∃ a₁ a₂, (hom X.toSrc) a₂ = (hom X.toTgt) a₁⊢ Nonempty (A₂ ⟶ X)pos.right X:IrreflexiveGraphh:∃ a₁ a₂, (hom X.toSrc) a₂ = (hom X.toTgt) a₁⊢ ¬Nonempty (X ⟶ A) <;> pos.left X:IrreflexiveGraphh:∃ a₁ a₂, (hom X.toSrc) a₂ = (hom X.toTgt) a₁⊢ Nonempty (A₂ ⟶ X)pos.right X:IrreflexiveGraphh:∃ a₁ a₂, (hom X.toSrc) a₂ = (hom X.toTgt) a₁⊢ ¬Nonempty (X ⟶ A) obtain ⟨aX₁, aX₂, haX⟩ := h pos.right X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁⊢ ¬Nonempty (X ⟶ A)
· pos.left X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁⊢ Nonempty (A₂ ⟶ X) refine ⟨⟨(↾fun | (0 : Fin 2) => aX₁ | (1 : Fin 2) => aX₂,
↾fun | (0 : Fin 3) => X.toSrc aX₁
| (1 : Fin 3) => X.toSrc aX₂
| (2 : Fin 3) => X.toTgt aX₂), ⟨?_, ?_⟩⟩⟩ pos.left.refine_1 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₂).1pos.left.refine_2 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₂.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
ext aA2 pos.left.refine_2 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
change Fin 2 at aA2 pos.left.refine_2 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
fin_cases aA2 pos.left.refine_2.«_@».ConceptualMathematics.Session25.2021293395._hygCtx._hyg.32.«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) ⟨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, ⋯⟩)pos.left.refine_2.«_@».ConceptualMathematics.Session25.2021293395._hygCtx._hyg.32.«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, ⋯⟩)
try (rw [haX pos.left.refine_1.«_@».ConceptualMathematics.Session25.2021293395._hygCtx._hyg.32.«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.toTgt) aX₁
| 2 => (hom X.toTgt) aX₂).2 ⊚
A₂.toSrc)).toFun
((fun i ↦ i) ⟨0, ⋯⟩) =
(hom
(X.toSrc ⊚
(↾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, ⋯⟩)pos.left.refine_1.«_@».ConceptualMathematics.Session25.2021293395._hygCtx._hyg.32.«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₂.toSrc)).toFun
((fun i ↦ i) ⟨1, ⋯⟩) =
(hom
(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₂).1)).toFun
((fun i ↦ i) ⟨1, ⋯⟩)] pos.left.refine_1.«_@».ConceptualMathematics.Session25.2021293395._hygCtx._hyg.32.«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.toTgt) aX₁
| 2 => (hom X.toTgt) aX₂).2 ⊚
A₂.toSrc)).toFun
((fun i ↦ i) ⟨0, ⋯⟩) =
(hom
(X.toSrc ⊚
(↾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, ⋯⟩)pos.left.refine_1.«_@».ConceptualMathematics.Session25.2021293395._hygCtx._hyg.32.«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₂.toSrc)).toFun
((fun i ↦ i) ⟨1, ⋯⟩) =
(hom
(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₂).1)).toFun
((fun i ↦ i) ⟨1, ⋯⟩) pos.left.refine_2.«_@».ConceptualMathematics.Session25.2021293395._hygCtx._hyg.32.«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.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, ⋯⟩)pos.left.refine_2.«_@».ConceptualMathematics.Session25.2021293395._hygCtx._hyg.32.«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, ⋯⟩); rfl pos.left.refine_2.«_@».ConceptualMathematics.Session25.2021293395._hygCtx._hyg.32.«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, ⋯⟩))
rfl All goals completed! 🐙
· pos.right X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁⊢ ¬Nonempty (X ⟶ A) rintro ⟨f⟩ pos.right X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁f:X ⟶ A⊢ False
have h_src : f.val.2 (X.toSrc aX₂) = A.toSrc (f.val.1 aX₂) :=
congr_hom f.property.1 aX₂ pos.right 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
have h_tgt : f.val.2 (X.toTgt aX₁) = A.toTgt (f.val.1 aX₁) :=
congr_hom f.property.2 aX₁ pos.right 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
rw [haX, pos.right X:IrreflexiveGraphaX₁:X.carrierAaX₂:X.carrierAhaX:(hom X.toSrc) aX₂ = (hom X.toTgt) aX₁f:X ⟶ Ah_src:(hom (↑f).2) ((hom X.toTgt) 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 h_tgt pos.right 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] at h_src pos.right 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
change (1 : Fin 2) = (0 : Fin 2) at h_src pos.right 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
contradiction All goals completed! 🐙
· neg X:IrreflexiveGraphh:¬∃ a₁ a₂, (hom X.toSrc) a₂ = (hom X.toTgt) a₁⊢ Xor (Nonempty (X ⟶ A)) (Nonempty (A₂ ⟶ X)) left neg X:IrreflexiveGraphh:¬∃ a₁ a₂, (hom X.toSrc) a₂ = (hom X.toTgt) a₁⊢ Nonempty (X ⟶ A) ∧ ¬Nonempty (A₂ ⟶ X)
push Not at h neg X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁⊢ Nonempty (X ⟶ A) ∧ ¬Nonempty (A₂ ⟶ X)
constructor neg.left X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁⊢ Nonempty (X ⟶ A)neg.right X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁⊢ ¬Nonempty (A₂ ⟶ X)
· neg.left X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁⊢ Nonempty (X ⟶ A) classical
refine ⟨⟨(↾fun _ ↦ (), ↾fun dX ↦ if ∃ aX : X.carrierA,
X.toTgt aX = dX then (1 : Fin 2) else (0 : Fin 2)),
⟨?_, ?_⟩⟩⟩ neg.left.refine_1 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).1neg.left.refine_2 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.toTgt =
A.toTgt ⊚ (↾fun x ↦ (), ↾fun dX ↦ if ∃ aX, (hom X.toTgt) aX = dX then 1 else 0).1
all_goals
ext aX neg.left.refine_2 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)
· neg.left.refine_1 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) dsimp neg.left.refine_1 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
split_ifs with hc pos 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 = 0neg 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
· pos 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 obtain ⟨a, ha⟩ := hc pos 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
exact False.elim (h a aX ha.symm) All goals completed! 🐙
· neg 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 rfl All goals completed! 🐙
· neg.left.refine_2 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) dsimp neg.left.refine_2 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
split_ifs with hc pos 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 = 1neg 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
· pos 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 rfl All goals completed! 🐙
· neg 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 exact False.elim (hc ⟨aX, rfl⟩) All goals completed! 🐙
· neg.right X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁⊢ ¬Nonempty (A₂ ⟶ X) rintro ⟨g⟩ neg.right X:IrreflexiveGraphh:∀ (a₁ a₂ : X.carrierA), (hom X.toSrc) a₂ ≠ (hom X.toTgt) a₁g:A₂ ⟶ X⊢ False
have h_src := congr_hom g.property.1 (1 : Fin 2) neg.right 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
have h_tgt := congr_hom g.property.2 (0 : Fin 2) neg.right 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
have := h_src.symm.trans h_tgt neg.right 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
exact h (g.val.1 (0 : Fin 2)) (g.val.1 (1 : Fin 2)) this All goals completed! 🐙
TODO Exercise 25.4 (d)
2. Calculating the graphs A ⨯ Y
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) := by ⊢ IsEmpty (B ≅ C)
constructor ⊢ ∀ (a : B ≅ C), False
intro ⟨_, g, _, _⟩ hom✝:B ⟶ Cg:C ⟶ Bhom_inv_id✝:g ⊚ hom✝ = 𝟙 Binv_hom_id✝:hom✝ ⊚ g = 𝟙 C⊢ False
have h_false : ∀ (gA : Fin 2 → Fin 2) (gD : Fin 3 → Fin 3),
(∀ a : Fin 2, gD ((fun | 0 => (0 : Fin 3) | 1 => 1) a) =
(fun | 0 => (0 : Fin 3) | 1 => 1) (gA a)) →
(∀ a : Fin 2, gD ((fun | 0 => (1 : Fin 3) | 1 => 0) a) =
(fun | 0 => (1 : Fin 3) | 1 => 2) (gA a)) → False := by ⊢ IsEmpty (B ≅ C)
decide 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
exact h_false g.val.1 g.val.2
(congr_hom g.property.1) (congr_hom g.property.2) 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)),
by 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
constructor left 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)).1right 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.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 <;> left 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)).1right 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.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 (ext a right 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; apply Prod.ext right.fst 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).1right.snd 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)
· left.fst 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 exact congr_hom s.fst.property.1 a All goals completed! 🐙
· left.snd 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 exact congr_hom s.snd.property.1 a All goals completed! 🐙
· right.fst 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 exact congr_hom s.fst.property.2 a All goals completed! 🐙
· right.snd 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 exact congr_hom s.snd.property.2 a All goals completed! 🐙⟩)
(fun _ ↦ by 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 apply hom_ext hA 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).1hD 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)),
⋯⟩)).2 =
(↑x✝.fst).2 <;> hA 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).1hD 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)),
⋯⟩)).2 =
(↑x✝.fst).2 rfl All goals completed! 🐙)
(fun _ ↦ by 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 apply hom_ext hA 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).1hD 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)),
⋯⟩)).2 =
(↑x✝.snd).2 <;> hA 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).1hD 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)),
⋯⟩)).2 =
(↑x✝.snd).2 rfl All goals completed! 🐙)
(fun _ _ hm₁ hm₂ ↦ by 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)), ⋯⟩
apply hom_ext hA 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)),
⋯⟩).1hD X: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 <;> hA 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)),
⋯⟩).1hD X: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 (ext x hD 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; apply Prod.ext hD.fst 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).1hD.snd 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)
· hA.fst 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 exact congr_fun (congr_arg (fun k ↦ k.val.1) hm₁) x All goals completed! 🐙
· hA.snd 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 exact congr_fun (congr_arg (fun k ↦ k.val.1) hm₂) x All goals completed! 🐙
· hD.fst 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 exact congr_fun (congr_arg (fun k ↦ k.val.2) hm₁) x All goals completed! 🐙
· hD.snd 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 exact congr_fun (congr_arg (fun k ↦ k.val.2) hm₂) x 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 := by ⊢ A ⨯ B ≅ A ⨯ C
have h_iso : prodObj A B ≅ prodObj A C := {
hom := ⟨(↾id, ↾swapD),
by ⊢ (↾id, ↾swapD).2 ⊚ (A.prodObj B).toSrc = (A.prodObj C).toSrc ⊚ (↾id, ↾swapD).1 ∧
(↾id, ↾swapD).2 ⊚ (A.prodObj B).toTgt = (A.prodObj C).toTgt ⊚ (↾id, ↾swapD).1
constructor left ⊢ (↾id, ↾swapD).2 ⊚ (A.prodObj B).toSrc = (A.prodObj C).toSrc ⊚ (↾id, ↾swapD).1right ⊢ (↾id, ↾swapD).2 ⊚ (A.prodObj B).toTgt = (A.prodObj C).toTgt ⊚ (↾id, ↾swapD).1
all_goals
ext ⟨_, aB⟩ right fst✝:A.carrierAaB:B.carrierA⊢ (ConcreteCategory.hom ((↾id, ↾swapD).2 ⊚ (A.prodObj B).toTgt)).toFun (fst✝, aB) =
(ConcreteCategory.hom ((A.prodObj C).toTgt ⊚ (↾id, ↾swapD).1)).toFun (fst✝, aB)
change Fin 2 at aB right fst✝:A.carrierAaB:Fin 2⊢ (ConcreteCategory.hom ((↾id, ↾swapD).2 ⊚ (A.prodObj B).toTgt)).toFun (fst✝, aB) =
(ConcreteCategory.hom ((A.prodObj C).toTgt ⊚ (↾id, ↾swapD).1)).toFun (fst✝, aB)
fin_cases aB right.«0» fst✝:A.carrierA⊢ (ConcreteCategory.hom ((↾id, ↾swapD).2 ⊚ (A.prodObj B).toTgt)).toFun (fst✝, (fun i ↦ i) ⟨0, ⋯⟩) =
(ConcreteCategory.hom ((A.prodObj C).toTgt ⊚ (↾id, ↾swapD).1)).toFun (fst✝, (fun i ↦ i) ⟨0, ⋯⟩)right.«1» fst✝:A.carrierA⊢ (ConcreteCategory.hom ((↾id, ↾swapD).2 ⊚ (A.prodObj B).toTgt)).toFun (fst✝, (fun i ↦ i) ⟨1, ⋯⟩) =
(ConcreteCategory.hom ((A.prodObj C).toTgt ⊚ (↾id, ↾swapD).1)).toFun (fst✝, (fun i ↦ i) ⟨1, ⋯⟩) <;> right.«0» fst✝:A.carrierA⊢ (ConcreteCategory.hom ((↾id, ↾swapD).2 ⊚ (A.prodObj B).toTgt)).toFun (fst✝, (fun i ↦ i) ⟨0, ⋯⟩) =
(ConcreteCategory.hom ((A.prodObj C).toTgt ⊚ (↾id, ↾swapD).1)).toFun (fst✝, (fun i ↦ i) ⟨0, ⋯⟩)right.«1» fst✝:A.carrierA⊢ (ConcreteCategory.hom ((↾id, ↾swapD).2 ⊚ (A.prodObj B).toTgt)).toFun (fst✝, (fun i ↦ i) ⟨1, ⋯⟩) =
(ConcreteCategory.hom ((A.prodObj C).toTgt ⊚ (↾id, ↾swapD).1)).toFun (fst✝, (fun i ↦ i) ⟨1, ⋯⟩) rfl All goals completed! 🐙⟩
inv := ⟨(↾id, ↾swapD),
by ⊢ (↾id, ↾swapD).2 ⊚ (A.prodObj C).toSrc = (A.prodObj B).toSrc ⊚ (↾id, ↾swapD).1 ∧
(↾id, ↾swapD).2 ⊚ (A.prodObj C).toTgt = (A.prodObj B).toTgt ⊚ (↾id, ↾swapD).1
constructor left ⊢ (↾id, ↾swapD).2 ⊚ (A.prodObj C).toSrc = (A.prodObj B).toSrc ⊚ (↾id, ↾swapD).1right ⊢ (↾id, ↾swapD).2 ⊚ (A.prodObj C).toTgt = (A.prodObj B).toTgt ⊚ (↾id, ↾swapD).1
all_goals
ext ⟨_, aB⟩ right fst✝:A.carrierAaB:C.carrierA⊢ (ConcreteCategory.hom ((↾id, ↾swapD).2 ⊚ (A.prodObj C).toTgt)).toFun (fst✝, aB) =
(ConcreteCategory.hom ((A.prodObj B).toTgt ⊚ (↾id, ↾swapD).1)).toFun (fst✝, aB)
change Fin 2 at aB right fst✝:A.carrierAaB:Fin 2⊢ (ConcreteCategory.hom ((↾id, ↾swapD).2 ⊚ (A.prodObj C).toTgt)).toFun (fst✝, aB) =
(ConcreteCategory.hom ((A.prodObj B).toTgt ⊚ (↾id, ↾swapD).1)).toFun (fst✝, aB)
fin_cases aB right.«0» fst✝:A.carrierA⊢ (ConcreteCategory.hom ((↾id, ↾swapD).2 ⊚ (A.prodObj C).toTgt)).toFun (fst✝, (fun i ↦ i) ⟨0, ⋯⟩) =
(ConcreteCategory.hom ((A.prodObj B).toTgt ⊚ (↾id, ↾swapD).1)).toFun (fst✝, (fun i ↦ i) ⟨0, ⋯⟩)right.«1» fst✝:A.carrierA⊢ (ConcreteCategory.hom ((↾id, ↾swapD).2 ⊚ (A.prodObj C).toTgt)).toFun (fst✝, (fun i ↦ i) ⟨1, ⋯⟩) =
(ConcreteCategory.hom ((A.prodObj B).toTgt ⊚ (↾id, ↾swapD).1)).toFun (fst✝, (fun i ↦ i) ⟨1, ⋯⟩) <;> right.«0» fst✝:A.carrierA⊢ (ConcreteCategory.hom ((↾id, ↾swapD).2 ⊚ (A.prodObj C).toTgt)).toFun (fst✝, (fun i ↦ i) ⟨0, ⋯⟩) =
(ConcreteCategory.hom ((A.prodObj B).toTgt ⊚ (↾id, ↾swapD).1)).toFun (fst✝, (fun i ↦ i) ⟨0, ⋯⟩)right.«1» fst✝:A.carrierA⊢ (ConcreteCategory.hom ((↾id, ↾swapD).2 ⊚ (A.prodObj C).toTgt)).toFun (fst✝, (fun i ↦ i) ⟨1, ⋯⟩) =
(ConcreteCategory.hom ((A.prodObj B).toTgt ⊚ (↾id, ↾swapD).1)).toFun (fst✝, (fun i ↦ i) ⟨1, ⋯⟩) rfl All goals completed! 🐙⟩
hom_inv_id := by ⊢ ⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩ = 𝟙 (A.prodObj B)
apply hom_ext hA ⊢ (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).1 = (↑(𝟙 (A.prodObj B))).1hD ⊢ (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2 = (↑(𝟙 (A.prodObj B))).2
· hA ⊢ (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).1 = (↑(𝟙 (A.prodObj B))).1 rfl All goals completed! 🐙
· hD ⊢ (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2 = (↑(𝟙 (A.prodObj B))).2 ext ⟨dA, dB⟩ hD dA:A.carrierDdB:B.carrierD⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun (dA, dB) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj B))).2).toFun (dA, dB)
change Fin 2 at dA hD dB:B.carrierDdA:Fin 2⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun (dA, dB) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj B))).2).toFun (dA, dB)
change Fin 3 at dB hD dA:Fin 2dB:Fin 3⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun (dA, dB) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj B))).2).toFun (dA, dB)
fin_cases dA hD.«0» dB:Fin 3⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩, dB) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj B))).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩, dB)hD.«1» dB:Fin 3⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, dB) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj B))).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, dB) <;> hD.«0» dB:Fin 3⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩, dB) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj B))).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩, dB)hD.«1» dB:Fin 3⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, dB) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj B))).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, dB) fin_cases dB hD.«1».«0» ⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj B))).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩)hD.«1».«1» ⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj B))).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩)hD.«1».«2» ⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj B))).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) <;> hD.«0».«0» ⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj B))).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩)hD.«0».«1» ⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj B))).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩)hD.«0».«2» ⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj B))).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩)hD.«1».«0» ⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj B))).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩)hD.«1».«1» ⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj B))).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩)hD.«1».«2» ⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj B))).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) rfl All goals completed! 🐙
inv_hom_id := by ⊢ ⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩ = 𝟙 (A.prodObj C)
apply hom_ext hA ⊢ (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).1 = (↑(𝟙 (A.prodObj C))).1hD ⊢ (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2 = (↑(𝟙 (A.prodObj C))).2
· hA ⊢ (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).1 = (↑(𝟙 (A.prodObj C))).1 rfl All goals completed! 🐙
· hD ⊢ (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2 = (↑(𝟙 (A.prodObj C))).2 ext ⟨dA, dB⟩ hD dA:A.carrierDdB:C.carrierD⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun (dA, dB) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj C))).2).toFun (dA, dB)
change Fin 2 at dA hD dB:C.carrierDdA:Fin 2⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun (dA, dB) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj C))).2).toFun (dA, dB)
change Fin 3 at dB hD dA:Fin 2dB:Fin 3⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun (dA, dB) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj C))).2).toFun (dA, dB)
fin_cases dA hD.«0» dB:Fin 3⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩, dB) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj C))).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩, dB)hD.«1» dB:Fin 3⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, dB) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj C))).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, dB) <;> hD.«0» dB:Fin 3⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩, dB) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj C))).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩, dB)hD.«1» dB:Fin 3⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, dB) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj C))).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, dB) fin_cases dB hD.«1».«0» ⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj C))).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩)hD.«1».«1» ⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj C))).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩)hD.«1».«2» ⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj C))).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) <;> hD.«0».«0» ⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj C))).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩)hD.«0».«1» ⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj C))).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩)hD.«0».«2» ⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj C))).2).toFun ((fun i ↦ i) ⟨0, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩)hD.«1».«0» ⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj C))).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨0, ⋯⟩)hD.«1».«1» ⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj C))).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨1, ⋯⟩)hD.«1».«2» ⊢ (ConcreteCategory.hom (↑(⟨(↾id, ↾swapD), ⋯⟩ ⊚ ⟨(↾id, ↾swapD), ⋯⟩)).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) =
(ConcreteCategory.hom (↑(𝟙 (A.prodObj C))).2).toFun ((fun i ↦ i) ⟨1, ⋯⟩, (fun i ↦ i) ⟨2, ⋯⟩) rfl All goals completed! 🐙
} 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
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))