Session 23: More on universal mapping properties
1. A category of pairs of maps
Formulate and prove in two ways the theorem of uniqueness of the product of two objects B_1 and B_2 of the category π. (One way is the direct proof and the other way is to define the category π_{B_{1}B_{2}}, to prove that it is a category, to prove that its terminal object is the same as a product of B_1 and B_2 in π, and to appeal to the theorem on uniqueness of terminal objects.)
Solution: Exercise 1
The direct proof was already given in Article IV. In Exercise 12 of Article IV, we proved uniqueness of the product in the case of two objects, and on p. 221 we proved uniqueness in the case of an arbitrary family of objects.
We now give the second proof, starting with the definition of the category π_{B_{1}B_{2}}.
variable {π : Type u} [Category.{v, u} π]
structure PairOfMaps (Bβ Bβ : π) where
carrier : π
pβ : carrier βΆ Bβ
pβ : carrier βΆ Bβ
We show that π_{B_{1}B_{2}} is a valid category.
instance {Bβ Bβ : π} : Category (PairOfMaps Bβ Bβ) where
Hom X Y := {
f : X.carrier βΆ Y.carrier //
Y.pβ β f = X.pβ β§ Y.pβ β f = X.pβ
}
id X := β¨π X.carrier,
π:Type uinstβ:Category.{v, u} πBβ:πBβ:πX:PairOfMaps Bβ Bββ’ X.pβ β π X.carrier = X.pβ β§ X.pβ β π X.carrier = X.pβ π:Type uinstβ:Category.{v, u} πBβ:πBβ:πX:PairOfMaps Bβ Bββ’ X.pβ β π X.carrier = X.pβπ:Type uinstβ:Category.{v, u} πBβ:πBβ:πX:PairOfMaps Bβ Bββ’ X.pβ β π X.carrier = X.pβ π:Type uinstβ:Category.{v, u} πBβ:πBβ:πX:PairOfMaps Bβ Bββ’ X.pβ β π X.carrier = X.pβπ:Type uinstβ:Category.{v, u} πBβ:πBβ:πX:PairOfMaps Bβ Bββ’ X.pβ β π X.carrier = X.pβ All goals completed! πβ©
comp f g := β¨g.val β f.val, by π:Type uinstβ:Category.{v, u} πBβ:πBβ:πXβ:PairOfMaps Bβ BβYβ:PairOfMaps Bβ BβZβ:PairOfMaps Bβ Bβf:{ f // Yβ.pβ β f = Xβ.pβ β§ Yβ.pβ β f = Xβ.pβ }g:{ f // Zβ.pβ β f = Yβ.pβ β§ Zβ.pβ β f = Yβ.pβ }β’ Zβ.pβ β βg β βf = Xβ.pβ β§ Zβ.pβ β βg β βf = Xβ.pβ
constructor left π:Type uinstβ:Category.{v, u} πBβ:πBβ:πXβ:PairOfMaps Bβ BβYβ:PairOfMaps Bβ BβZβ:PairOfMaps Bβ Bβf:{ f // Yβ.pβ β f = Xβ.pβ β§ Yβ.pβ β f = Xβ.pβ }g:{ f // Zβ.pβ β f = Yβ.pβ β§ Zβ.pβ β f = Yβ.pβ }β’ Zβ.pβ β βg β βf = Xβ.pβright π:Type uinstβ:Category.{v, u} πBβ:πBβ:πXβ:PairOfMaps Bβ BβYβ:PairOfMaps Bβ BβZβ:PairOfMaps Bβ Bβf:{ f // Yβ.pβ β f = Xβ.pβ β§ Yβ.pβ β f = Xβ.pβ }g:{ f // Zβ.pβ β f = Yβ.pβ β§ Zβ.pβ β f = Yβ.pβ }β’ Zβ.pβ β βg β βf = Xβ.pβ
Β· left π:Type uinstβ:Category.{v, u} πBβ:πBβ:πXβ:PairOfMaps Bβ BβYβ:PairOfMaps Bβ BβZβ:PairOfMaps Bβ Bβf:{ f // Yβ.pβ β f = Xβ.pβ β§ Yβ.pβ β f = Xβ.pβ }g:{ f // Zβ.pβ β f = Yβ.pβ β§ Zβ.pβ β f = Yβ.pβ }β’ Zβ.pβ β βg β βf = Xβ.pβ rw [Category.assoc, left π:Type uinstβ:Category.{v, u} πBβ:πBβ:πXβ:PairOfMaps Bβ BβYβ:PairOfMaps Bβ BβZβ:PairOfMaps Bβ Bβf:{ f // Yβ.pβ β f = Xβ.pβ β§ Yβ.pβ β f = Xβ.pβ }g:{ f // Zβ.pβ β f = Yβ.pβ β§ Zβ.pβ β f = Yβ.pβ }β’ (Zβ.pβ β βg) β βf = Xβ.pβ g.property.1, left π:Type uinstβ:Category.{v, u} πBβ:πBβ:πXβ:PairOfMaps Bβ BβYβ:PairOfMaps Bβ BβZβ:PairOfMaps Bβ Bβf:{ f // Yβ.pβ β f = Xβ.pβ β§ Yβ.pβ β f = Xβ.pβ }g:{ f // Zβ.pβ β f = Yβ.pβ β§ Zβ.pβ β f = Yβ.pβ }β’ Yβ.pβ β βf = Xβ.pβ f.property.1 left π:Type uinstβ:Category.{v, u} πBβ:πBβ:πXβ:PairOfMaps Bβ BβYβ:PairOfMaps Bβ BβZβ:PairOfMaps Bβ Bβf:{ f // Yβ.pβ β f = Xβ.pβ β§ Yβ.pβ β f = Xβ.pβ }g:{ f // Zβ.pβ β f = Yβ.pβ β§ Zβ.pβ β f = Yβ.pβ }β’ Xβ.pβ = Xβ.pβ] All goals completed! π
Β· right π:Type uinstβ:Category.{v, u} πBβ:πBβ:πXβ:PairOfMaps Bβ BβYβ:PairOfMaps Bβ BβZβ:PairOfMaps Bβ Bβf:{ f // Yβ.pβ β f = Xβ.pβ β§ Yβ.pβ β f = Xβ.pβ }g:{ f // Zβ.pβ β f = Yβ.pβ β§ Zβ.pβ β f = Yβ.pβ }β’ Zβ.pβ β βg β βf = Xβ.pβ rw [Category.assoc, right π:Type uinstβ:Category.{v, u} πBβ:πBβ:πXβ:PairOfMaps Bβ BβYβ:PairOfMaps Bβ BβZβ:PairOfMaps Bβ Bβf:{ f // Yβ.pβ β f = Xβ.pβ β§ Yβ.pβ β f = Xβ.pβ }g:{ f // Zβ.pβ β f = Yβ.pβ β§ Zβ.pβ β f = Yβ.pβ }β’ (Zβ.pβ β βg) β βf = Xβ.pβ g.property.2, right π:Type uinstβ:Category.{v, u} πBβ:πBβ:πXβ:PairOfMaps Bβ BβYβ:PairOfMaps Bβ BβZβ:PairOfMaps Bβ Bβf:{ f // Yβ.pβ β f = Xβ.pβ β§ Yβ.pβ β f = Xβ.pβ }g:{ f // Zβ.pβ β f = Yβ.pβ β§ Zβ.pβ β f = Yβ.pβ }β’ Yβ.pβ β βf = Xβ.pβ f.property.2 right π:Type uinstβ:Category.{v, u} πBβ:πBβ:πXβ:PairOfMaps Bβ BβYβ:PairOfMaps Bβ BβZβ:PairOfMaps Bβ Bβf:{ f // Yβ.pβ β f = Xβ.pβ β§ Yβ.pβ β f = Xβ.pβ }g:{ f // Zβ.pβ β f = Yβ.pβ β§ Zβ.pβ β f = Yβ.pβ }β’ Xβ.pβ = Xβ.pβ] All goals completed! πβ©
Next we show that the terminal object of π_{B_{1}B_{2}} is the same as a product of B_1 and B_2 in π.
example {Bβ Bβ : π} {T : PairOfMaps Bβ Bβ} (hT : IsTerminal T) :
β (X : π) (fβ : X βΆ Bβ) (fβ : X βΆ Bβ),
β! f : X βΆ T.carrier, T.pβ β f = fβ β§ T.pβ β f = fβ := by π:Type uinstβ:Category.{v, u} πBβ:πBβ:πT:PairOfMaps Bβ BβhT:IsTerminal Tβ’ β (X : π) (fβ : X βΆ Bβ) (fβ : X βΆ Bβ), β! f, T.pβ β f = fβ β§ T.pβ β f = fβ
intro X fβ fβ π:Type uinstβ:Category.{v, u} πBβ:πBβ:πT:PairOfMaps Bβ BβhT:IsTerminal TX:πfβ:X βΆ Bβfβ:X βΆ Bββ’ β! f, T.pβ β f = fβ β§ T.pβ β f = fβ
let XP : PairOfMaps Bβ Bβ := {
carrier := X
pβ := fβ
pβ := fβ
} π:Type uinstβ:Category.{v, u} πBβ:πBβ:πT:PairOfMaps Bβ BβhT:IsTerminal TX:πfβ:X βΆ Bβfβ:X βΆ BβXP:PairOfMaps Bβ Bβ := { carrier := X, pβ := fβ, pβ := fβ }β’ β! f, T.pβ β f = fβ β§ T.pβ β f = fβ
let fP := hT.from XP π:Type uinstβ:Category.{v, u} πBβ:πBβ:πT:PairOfMaps Bβ BβhT:IsTerminal TX:πfβ:X βΆ Bβfβ:X βΆ BβXP:PairOfMaps Bβ Bβ := { carrier := X, pβ := fβ, pβ := fβ }fP:XP βΆ T := hT.from XPβ’ β! f, T.pβ β f = fβ β§ T.pβ β f = fβ
use fP.val h π:Type uinstβ:Category.{v, u} πBβ:πBβ:πT:PairOfMaps Bβ BβhT:IsTerminal TX:πfβ:X βΆ Bβfβ:X βΆ BβXP:PairOfMaps Bβ Bβ := { carrier := X, pβ := fβ, pβ := fβ }fP:XP βΆ T := hT.from XPβ’ (fun f β¦ T.pβ β f = fβ β§ T.pβ β f = fβ) βfP β§ β (y : X βΆ T.carrier), (fun f β¦ T.pβ β f = fβ β§ T.pβ β f = fβ) y β y = βfP
constructor h.left π:Type uinstβ:Category.{v, u} πBβ:πBβ:πT:PairOfMaps Bβ BβhT:IsTerminal TX:πfβ:X βΆ Bβfβ:X βΆ BβXP:PairOfMaps Bβ Bβ := { carrier := X, pβ := fβ, pβ := fβ }fP:XP βΆ T := hT.from XPβ’ (fun f β¦ T.pβ β f = fβ β§ T.pβ β f = fβ) βfPh.right π:Type uinstβ:Category.{v, u} πBβ:πBβ:πT:PairOfMaps Bβ BβhT:IsTerminal TX:πfβ:X βΆ Bβfβ:X βΆ BβXP:PairOfMaps Bβ Bβ := { carrier := X, pβ := fβ, pβ := fβ }fP:XP βΆ T := hT.from XPβ’ β (y : X βΆ T.carrier), (fun f β¦ T.pβ β f = fβ β§ T.pβ β f = fβ) y β y = βfP
Β· h.left π:Type uinstβ:Category.{v, u} πBβ:πBβ:πT:PairOfMaps Bβ BβhT:IsTerminal TX:πfβ:X βΆ Bβfβ:X βΆ BβXP:PairOfMaps Bβ Bβ := { carrier := X, pβ := fβ, pβ := fβ }fP:XP βΆ T := hT.from XPβ’ (fun f β¦ T.pβ β f = fβ β§ T.pβ β f = fβ) βfP exact fP.property All goals completed! π
Β· h.right π:Type uinstβ:Category.{v, u} πBβ:πBβ:πT:PairOfMaps Bβ BβhT:IsTerminal TX:πfβ:X βΆ Bβfβ:X βΆ BβXP:PairOfMaps Bβ Bβ := { carrier := X, pβ := fβ, pβ := fβ }fP:XP βΆ T := hT.from XPβ’ β (y : X βΆ T.carrier), (fun f β¦ T.pβ β f = fβ β§ T.pβ β f = fβ) y β y = βfP intro f hf h.right π:Type uinstβ:Category.{v, u} πBβ:πBβ:πT:PairOfMaps Bβ BβhT:IsTerminal TX:πfβ:X βΆ Bβfβ:X βΆ BβXP:PairOfMaps Bβ Bβ := { carrier := X, pβ := fβ, pβ := fβ }fP:XP βΆ T := hT.from XPf:X βΆ T.carrierhf:T.pβ β f = fβ β§ T.pβ β f = fββ’ f = βfP
let fP' : XP βΆ T := β¨f, hfβ© h.right π:Type uinstβ:Category.{v, u} πBβ:πBβ:πT:PairOfMaps Bβ BβhT:IsTerminal TX:πfβ:X βΆ Bβfβ:X βΆ BβXP:PairOfMaps Bβ Bβ := { carrier := X, pβ := fβ, pβ := fβ }fP:XP βΆ T := hT.from XPf:X βΆ T.carrierhf:T.pβ β f = fβ β§ T.pβ β f = fβfP':XP βΆ T := β¨f, hfβ©β’ f = βfP
exact congr_arg Subtype.val (hT.hom_ext fP' fP) All goals completed! π
Finally we appeal to the theorem on uniqueness of terminal objects.
example {Bβ Bβ : π} {Tβ Tβ : PairOfMaps Bβ Bβ}
(hTβ : IsTerminal Tβ) (hTβ : IsTerminal Tβ) :
Nonempty (Tβ.carrier β
Tβ.carrier) := by π:Type uinstβ:Category.{v, u} πBβ:πBβ:πTβ:PairOfMaps Bβ BβTβ:PairOfMaps Bβ BβhTβ:IsTerminal TβhTβ:IsTerminal Tββ’ Nonempty (Tβ.carrier β
Tβ.carrier)
obtain β¨t, β¨ht_iso, _β©β© := uniqueness_of_terminal_objects hTβ hTβ π:Type uinstβ:Category.{v, u} πBβ:πBβ:πTβ:PairOfMaps Bβ BβTβ:PairOfMaps Bβ BβhTβ:IsTerminal TβhTβ:IsTerminal Tβt:Tβ βΆ Tβht_iso:IsIso trightβ:β (y : Tβ βΆ Tβ), (fun s β¦ IsIso s) y β y = tβ’ Nonempty (Tβ.carrier β
Tβ.carrier)
apply Nonempty.intro π:Type uinstβ:Category.{v, u} πBβ:πBβ:πTβ:PairOfMaps Bβ BβTβ:PairOfMaps Bβ BβhTβ:IsTerminal TβhTβ:IsTerminal Tβt:Tβ βΆ Tβht_iso:IsIso trightβ:β (y : Tβ βΆ Tβ), (fun s β¦ IsIso s) y β y = tβ’ Tβ.carrier β
Tβ.carrier
exact {
hom := t.val
inv := (inv t).val
hom_inv_id := congr_arg Subtype.val (IsIso.hom_inv_id t)
inv_hom_id := congr_arg Subtype.val (IsIso.inv_hom_id t)
} All goals completed! π
2. How to calculate products
For any pair of maps {A \xrightarrow{f_1} B_1}, {A \xrightarrow{f_2} B_2}, {\langle f_1, f_2 \rangle} is the unique map {A \rightarrow B_1 \times B_2} that satisfies the equations {p_1 \langle f_1, f_2 \rangle = f_1} and {p_2 \langle f_1, f_2 \rangle = f_2}.
The relevant mathlib definition here is prod.lift, which we print below for reference.
#print prod.lift
Try to create the definition of 'sum' of two objects, in terms of a universal mapping property 'dual' to that of product, by reversing all maps in the definition of product. Then verify that in the category of sets and in the category of graphs, this property actually is satisfied by the intuitive idea of sum: 'Put together with no overlap and no interaction'.
Solution: Exercise 2
We start by defining a CategorySum structure to represent the sum of two objects in an arbitrary category as the dual of the product.
variable {π : Type u} [Category.{v, u} π]
structure CategorySum (Bβ Bβ : π) where
carrier : π
jβ : Bβ βΆ carrier
jβ : Bβ βΆ carrier
h_univ : β (Y : π) (gβ : Bβ βΆ Y) (gβ : Bβ βΆ Y),
β! g : carrier βΆ Y, g β jβ = gβ β§ g β jβ = gβ
In the category of sets (types), the intuitive idea of sum as the disjoint union of two sets (types) is given by the Sum type, so we show that Sum satisfies the universal mapping property of our CategorySum structure.
open ConcreteCategory in
example {Bβ Bβ : Type} : CategorySum Bβ Bβ := {
carrier := Sum Bβ Bβ
jβ := βΎSum.inl
jβ := βΎSum.inr
h_univ Y gβ gβ:= by π:Type uinstβ:Category.{v, u} πBβ:TypeBβ:TypeY:Typegβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ β! g, g β βΎSum.inl = gβ β§ g β βΎSum.inr = gβ
use βΎfun
| Sum.inl bβ => gβ bβ
| Sum.inr bβ => gβ bβ h π:Type uinstβ:Category.{v, u} πBβ:TypeBβ:TypeY:Typegβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ (fun g β¦ g β βΎSum.inl = gβ β§ g β βΎSum.inr = gβ)
(βΎfun x β¦
match x with
| Sum.inl bβ => (hom gβ) bβ
| Sum.inr bβ => (hom gβ) bβ) β§
β (y : Bβ β Bβ βΆ Y),
(fun g β¦ g β βΎSum.inl = gβ β§ g β βΎSum.inr = gβ) y β
y =
βΎfun x β¦
match x with
| Sum.inl bβ => (hom gβ) bβ
| Sum.inr bβ => (hom gβ) bβ
constructor h.left π:Type uinstβ:Category.{v, u} πBβ:TypeBβ:TypeY:Typegβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ (fun g β¦ g β βΎSum.inl = gβ β§ g β βΎSum.inr = gβ)
(βΎfun x β¦
match x with
| Sum.inl bβ => (hom gβ) bβ
| Sum.inr bβ => (hom gβ) bβ)h.right π:Type uinstβ:Category.{v, u} πBβ:TypeBβ:TypeY:Typegβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ β (y : Bβ β Bβ βΆ Y),
(fun g β¦ g β βΎSum.inl = gβ β§ g β βΎSum.inr = gβ) y β
y =
βΎfun x β¦
match x with
| Sum.inl bβ => (hom gβ) bβ
| Sum.inr bβ => (hom gβ) bβ
Β· h.left π:Type uinstβ:Category.{v, u} πBβ:TypeBβ:TypeY:Typegβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ (fun g β¦ g β βΎSum.inl = gβ β§ g β βΎSum.inr = gβ)
(βΎfun x β¦
match x with
| Sum.inl bβ => (hom gβ) bβ
| Sum.inr bβ => (hom gβ) bβ) constructor h.left.left π:Type uinstβ:Category.{v, u} πBβ:TypeBβ:TypeY:Typegβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ (βΎfun x β¦
match x with
| Sum.inl bβ => (hom gβ) bβ
| Sum.inr bβ => (hom gβ) bβ) β
βΎSum.inl =
gβh.left.right π:Type uinstβ:Category.{v, u} πBβ:TypeBβ:TypeY:Typegβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ (βΎfun x β¦
match x with
| Sum.inl bβ => (hom gβ) bβ
| Sum.inr bβ => (hom gβ) bβ) β
βΎSum.inr =
gβ <;> h.left.left π:Type uinstβ:Category.{v, u} πBβ:TypeBβ:TypeY:Typegβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ (βΎfun x β¦
match x with
| Sum.inl bβ => (hom gβ) bβ
| Sum.inr bβ => (hom gβ) bβ) β
βΎSum.inl =
gβh.left.right π:Type uinstβ:Category.{v, u} πBβ:TypeBβ:TypeY:Typegβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ (βΎfun x β¦
match x with
| Sum.inl bβ => (hom gβ) bβ
| Sum.inr bβ => (hom gβ) bβ) β
βΎSum.inr =
gβ rfl All goals completed! π
Β· h.right π:Type uinstβ:Category.{v, u} πBβ:TypeBβ:TypeY:Typegβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ β (y : Bβ β Bβ βΆ Y),
(fun g β¦ g β βΎSum.inl = gβ β§ g β βΎSum.inr = gβ) y β
y =
βΎfun x β¦
match x with
| Sum.inl bβ => (hom gβ) bβ
| Sum.inr bβ => (hom gβ) bβ intro g β¨hgβ, hgββ© h.right π:Type uinstβ:Category.{v, u} πBβ:TypeBβ:TypeY:Typegβ:Bβ βΆ Ygβ:Bβ βΆ Yg:Bβ β Bβ βΆ Yhgβ:g β βΎSum.inl = gβhgβ:g β βΎSum.inr = gββ’ g =
βΎfun x β¦
match x with
| Sum.inl bβ => (hom gβ) bβ
| Sum.inr bβ => (hom gβ) bβ
ext x h.right π:Type uinstβ:Category.{v, u} πBβ:TypeBβ:TypeY:Typegβ:Bβ βΆ Ygβ:Bβ βΆ Yg:Bβ β Bβ βΆ Yhgβ:g β βΎSum.inl = gβhgβ:g β βΎSum.inr = gβx:Bβ β Bββ’ (hom g).toFun x =
(hom
(βΎfun x β¦
match x with
| Sum.inl bβ => (hom gβ) bβ
| Sum.inr bβ => (hom gβ) bβ)).toFun
x
cases x with
| inl bβ => h.right.inl π:Type uinstβ:Category.{v, u} πBβ:TypeBβ:TypeY:Typegβ:Bβ βΆ Ygβ:Bβ βΆ Yg:Bβ β Bβ βΆ Yhgβ:g β βΎSum.inl = gβhgβ:g β βΎSum.inr = gβbβ:Bββ’ (hom g).toFun (Sum.inl bβ) =
(hom
(βΎfun x β¦
match x with
| Sum.inl bβ => (hom gβ) bβ
| Sum.inr bβ => (hom gβ) bβ)).toFun
(Sum.inl bβ) exact congr_hom hgβ bβ All goals completed! π
| inr bβ => h.right.inr π:Type uinstβ:Category.{v, u} πBβ:TypeBβ:TypeY:Typegβ:Bβ βΆ Ygβ:Bβ βΆ Yg:Bβ β Bβ βΆ Yhgβ:g β βΎSum.inl = gβhgβ:g β βΎSum.inr = gβbβ:Bββ’ (hom g).toFun (Sum.inr bβ) =
(hom
(βΎfun x β¦
match x with
| Sum.inl bβ => (hom gβ) bβ
| Sum.inr bβ => (hom gβ) bβ)).toFun
(Sum.inr bβ) exact congr_hom hgβ bβ All goals completed! π
}
In the category of graphs, the intuitive idea of sum can be formalised as follows:
def IGSum (Bβ Bβ : IrreflexiveGraph) : IrreflexiveGraph := {
carrierA := Sum Bβ.carrierA Bβ.carrierA
carrierD := Sum Bβ.carrierD Bβ.carrierD
toSrc := βΎfun
| Sum.inl aβ => Sum.inl (Bβ.toSrc aβ)
| Sum.inr aβ => Sum.inr (Bβ.toSrc aβ)
toTgt := βΎfun
| Sum.inl aβ => Sum.inl (Bβ.toTgt aβ)
| Sum.inr aβ => Sum.inr (Bβ.toTgt aβ)
}
def IGSum.inl {Bβ Bβ : IrreflexiveGraph} : Bβ βΆ IGSum Bβ Bβ := β¨
(βΎSum.inl, βΎSum.inl), by π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphβ’ (βΎSum.inl, βΎSum.inl).2 β Bβ.toSrc = (IGSum Bβ Bβ).toSrc β (βΎSum.inl, βΎSum.inl).1 β§
(βΎSum.inl, βΎSum.inl).2 β Bβ.toTgt = (IGSum Bβ Bβ).toTgt β (βΎSum.inl, βΎSum.inl).1 constructor left π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphβ’ (βΎSum.inl, βΎSum.inl).2 β Bβ.toSrc = (IGSum Bβ Bβ).toSrc β (βΎSum.inl, βΎSum.inl).1right π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphβ’ (βΎSum.inl, βΎSum.inl).2 β Bβ.toTgt = (IGSum Bβ Bβ).toTgt β (βΎSum.inl, βΎSum.inl).1 <;> left π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphβ’ (βΎSum.inl, βΎSum.inl).2 β Bβ.toSrc = (IGSum Bβ Bβ).toSrc β (βΎSum.inl, βΎSum.inl).1right π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphβ’ (βΎSum.inl, βΎSum.inl).2 β Bβ.toTgt = (IGSum Bβ Bβ).toTgt β (βΎSum.inl, βΎSum.inl).1 rfl All goals completed! π
β©
def IGSum.inr {Bβ Bβ : IrreflexiveGraph} : Bβ βΆ IGSum Bβ Bβ := β¨
(βΎSum.inr, βΎSum.inr), by π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphβ’ (βΎSum.inr, βΎSum.inr).2 β Bβ.toSrc = (IGSum Bβ Bβ).toSrc β (βΎSum.inr, βΎSum.inr).1 β§
(βΎSum.inr, βΎSum.inr).2 β Bβ.toTgt = (IGSum Bβ Bβ).toTgt β (βΎSum.inr, βΎSum.inr).1 constructor left π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphβ’ (βΎSum.inr, βΎSum.inr).2 β Bβ.toSrc = (IGSum Bβ Bβ).toSrc β (βΎSum.inr, βΎSum.inr).1right π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphβ’ (βΎSum.inr, βΎSum.inr).2 β Bβ.toTgt = (IGSum Bβ Bβ).toTgt β (βΎSum.inr, βΎSum.inr).1 <;> left π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphβ’ (βΎSum.inr, βΎSum.inr).2 β Bβ.toSrc = (IGSum Bβ Bβ).toSrc β (βΎSum.inr, βΎSum.inr).1right π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphβ’ (βΎSum.inr, βΎSum.inr).2 β Bβ.toTgt = (IGSum Bβ Bβ).toTgt β (βΎSum.inr, βΎSum.inr).1 rfl All goals completed! π
β©
We then show that IGSum satisfies the universal mapping property of our CategorySum structure.
open ConcreteCategory in
example {Bβ Bβ : IrreflexiveGraph} : CategorySum Bβ Bβ := {
carrier := IGSum Bβ Bβ
jβ := IGSum.inl
jβ := IGSum.inr
h_univ Y gβ gβ:= by π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ β! g, g β IGSum.inl = gβ β§ g β IGSum.inr = gβ
use β¨
(βΎfun
| Sum.inl aβ => gβ.val.1 aβ
| Sum.inr aβ => gβ.val.1 aβ,
βΎfun
| Sum.inl dβ => gβ.val.2 dβ
| Sum.inr dβ => gβ.val.2 dβ),
by π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ (βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).2 β
(IGSum Bβ Bβ).toSrc =
Y.toSrc β
(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).1 β§
(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).2 β
(IGSum Bβ Bβ).toTgt =
Y.toTgt β
(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).1
constructor left π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ (βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).2 β
(IGSum Bβ Bβ).toSrc =
Y.toSrc β
(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).1right π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ (βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).2 β
(IGSum Bβ Bβ).toTgt =
Y.toTgt β
(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).1 <;> left π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ (βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).2 β
(IGSum Bβ Bβ).toSrc =
Y.toSrc β
(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).1right π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ (βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).2 β
(IGSum Bβ Bβ).toTgt =
Y.toTgt β
(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).1 ext x right π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yx:(IGSum Bβ Bβ).carrierAβ’ (hom
((βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).2 β
(IGSum Bβ Bβ).toTgt)).toFun
x =
(hom
(Y.toTgt β
(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).1)).toFun
x
Β· left π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yx:(IGSum Bβ Bβ).carrierAβ’ (hom
((βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).2 β
(IGSum Bβ Bβ).toSrc)).toFun
x =
(hom
(Y.toSrc β
(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).1)).toFun
x cases x with
| inl aβ => left.inl π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yaβ:Bβ.carrierAβ’ (hom
((βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).2 β
(IGSum Bβ Bβ).toSrc)).toFun
(Sum.inl aβ) =
(hom
(Y.toSrc β
(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).1)).toFun
(Sum.inl aβ) exact congr_hom gβ.property.1 aβ All goals completed! π
| inr aβ => left.inr π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yaβ:Bβ.carrierAβ’ (hom
((βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).2 β
(IGSum Bβ Bβ).toSrc)).toFun
(Sum.inr aβ) =
(hom
(Y.toSrc β
(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).1)).toFun
(Sum.inr aβ) exact congr_hom gβ.property.1 aβ All goals completed! π
Β· right π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yx:(IGSum Bβ Bβ).carrierAβ’ (hom
((βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).2 β
(IGSum Bβ Bβ).toTgt)).toFun
x =
(hom
(Y.toTgt β
(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).1)).toFun
x cases x with
| inl aβ => right.inl π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yaβ:Bβ.carrierAβ’ (hom
((βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).2 β
(IGSum Bβ Bβ).toTgt)).toFun
(Sum.inl aβ) =
(hom
(Y.toTgt β
(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).1)).toFun
(Sum.inl aβ) exact congr_hom gβ.property.2 aβ All goals completed! π
| inr aβ => right.inr π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yaβ:Bβ.carrierAβ’ (hom
((βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).2 β
(IGSum Bβ Bβ).toTgt)).toFun
(Sum.inr aβ) =
(hom
(Y.toTgt β
(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ).1)).toFun
(Sum.inr aβ) exact congr_hom gβ.property.2 aβ All goals completed! π
β©
constructor h.left π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ (fun g β¦ g β IGSum.inl = gβ β§ g β IGSum.inr = gβ)
β¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β©h.right π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ β (y : IGSum Bβ Bβ βΆ Y),
(fun g β¦ g β IGSum.inl = gβ β§ g β IGSum.inr = gβ) y β
y =
β¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β©
Β· h.left π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ (fun g β¦ g β IGSum.inl = gβ β§ g β IGSum.inr = gβ)
β¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β© constructor h.left.left π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ β¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β© β
IGSum.inl =
gβh.left.right π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ β¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β© β
IGSum.inr =
gβ <;> h.left.left π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ β¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β© β
IGSum.inl =
gβh.left.right π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ β¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β© β
IGSum.inr =
gβ rfl All goals completed! π
Β· h.right π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yβ’ β (y : IGSum Bβ Bβ βΆ Y),
(fun g β¦ g β IGSum.inl = gβ β§ g β IGSum.inr = gβ) y β
y =
β¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β© intro g β¨hgβ, hgββ© h.right π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yg:IGSum Bβ Bβ βΆ Yhgβ:g β IGSum.inl = gβhgβ:g β IGSum.inr = gββ’ g =
β¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β©
obtain β¨hgβ1, hgβ2β© := IrreflexiveGraph.hom_ext_iff.mp hgβ h.right π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yg:IGSum Bβ Bβ βΆ Yhgβ:g β IGSum.inl = gβhgβ:g β IGSum.inr = gβhgβ1:(β(g β IGSum.inl)).1 = (βgβ).1hgβ2:(β(g β IGSum.inl)).2 = (βgβ).2β’ g =
β¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β©
obtain β¨hgβ1, hgβ2β© := IrreflexiveGraph.hom_ext_iff.mp hgβ h.right π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yg:IGSum Bβ Bβ βΆ Yhgβ:g β IGSum.inl = gβhgβ:g β IGSum.inr = gβhgβ1:(β(g β IGSum.inl)).1 = (βgβ).1hgβ2:(β(g β IGSum.inl)).2 = (βgβ).2hgβ1:(β(g β IGSum.inr)).1 = (βgβ).1hgβ2:(β(g β IGSum.inr)).2 = (βgβ).2β’ g =
β¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β©
apply IrreflexiveGraph.hom_ext h.right.hA π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yg:IGSum Bβ Bβ βΆ Yhgβ:g β IGSum.inl = gβhgβ:g β IGSum.inr = gβhgβ1:(β(g β IGSum.inl)).1 = (βgβ).1hgβ2:(β(g β IGSum.inl)).2 = (βgβ).2hgβ1:(β(g β IGSum.inr)).1 = (βgβ).1hgβ2:(β(g β IGSum.inr)).2 = (βgβ).2β’ (βg).1 =
(ββ¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β©).1h.right.hD π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yg:IGSum Bβ Bβ βΆ Yhgβ:g β IGSum.inl = gβhgβ:g β IGSum.inr = gβhgβ1:(β(g β IGSum.inl)).1 = (βgβ).1hgβ2:(β(g β IGSum.inl)).2 = (βgβ).2hgβ1:(β(g β IGSum.inr)).1 = (βgβ).1hgβ2:(β(g β IGSum.inr)).2 = (βgβ).2β’ (βg).2 =
(ββ¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β©).2 <;> h.right.hA π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yg:IGSum Bβ Bβ βΆ Yhgβ:g β IGSum.inl = gβhgβ:g β IGSum.inr = gβhgβ1:(β(g β IGSum.inl)).1 = (βgβ).1hgβ2:(β(g β IGSum.inl)).2 = (βgβ).2hgβ1:(β(g β IGSum.inr)).1 = (βgβ).1hgβ2:(β(g β IGSum.inr)).2 = (βgβ).2β’ (βg).1 =
(ββ¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β©).1h.right.hD π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yg:IGSum Bβ Bβ βΆ Yhgβ:g β IGSum.inl = gβhgβ:g β IGSum.inr = gβhgβ1:(β(g β IGSum.inl)).1 = (βgβ).1hgβ2:(β(g β IGSum.inl)).2 = (βgβ).2hgβ1:(β(g β IGSum.inr)).1 = (βgβ).1hgβ2:(β(g β IGSum.inr)).2 = (βgβ).2β’ (βg).2 =
(ββ¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β©).2 ext x h.right.hD π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yg:IGSum Bβ Bβ βΆ Yhgβ:g β IGSum.inl = gβhgβ:g β IGSum.inr = gβhgβ1:(β(g β IGSum.inl)).1 = (βgβ).1hgβ2:(β(g β IGSum.inl)).2 = (βgβ).2hgβ1:(β(g β IGSum.inr)).1 = (βgβ).1hgβ2:(β(g β IGSum.inr)).2 = (βgβ).2x:(IGSum Bβ Bβ).carrierDβ’ (hom (βg).2).toFun x =
(hom
(ββ¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β©).2).toFun
x
Β· h.right.hA π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yg:IGSum Bβ Bβ βΆ Yhgβ:g β IGSum.inl = gβhgβ:g β IGSum.inr = gβhgβ1:(β(g β IGSum.inl)).1 = (βgβ).1hgβ2:(β(g β IGSum.inl)).2 = (βgβ).2hgβ1:(β(g β IGSum.inr)).1 = (βgβ).1hgβ2:(β(g β IGSum.inr)).2 = (βgβ).2x:(IGSum Bβ Bβ).carrierAβ’ (hom (βg).1).toFun x =
(hom
(ββ¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β©).1).toFun
x cases x with
| inl aβ => h.right.hA.inl π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yg:IGSum Bβ Bβ βΆ Yhgβ:g β IGSum.inl = gβhgβ:g β IGSum.inr = gβhgβ1:(β(g β IGSum.inl)).1 = (βgβ).1hgβ2:(β(g β IGSum.inl)).2 = (βgβ).2hgβ1:(β(g β IGSum.inr)).1 = (βgβ).1hgβ2:(β(g β IGSum.inr)).2 = (βgβ).2aβ:Bβ.carrierAβ’ (hom (βg).1).toFun (Sum.inl aβ) =
(hom
(ββ¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β©).1).toFun
(Sum.inl aβ) exact congr_hom hgβ1 aβ All goals completed! π
| inr aβ => h.right.hA.inr π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yg:IGSum Bβ Bβ βΆ Yhgβ:g β IGSum.inl = gβhgβ:g β IGSum.inr = gβhgβ1:(β(g β IGSum.inl)).1 = (βgβ).1hgβ2:(β(g β IGSum.inl)).2 = (βgβ).2hgβ1:(β(g β IGSum.inr)).1 = (βgβ).1hgβ2:(β(g β IGSum.inr)).2 = (βgβ).2aβ:Bβ.carrierAβ’ (hom (βg).1).toFun (Sum.inr aβ) =
(hom
(ββ¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β©).1).toFun
(Sum.inr aβ) exact congr_hom hgβ1 aβ All goals completed! π
Β· h.right.hD π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yg:IGSum Bβ Bβ βΆ Yhgβ:g β IGSum.inl = gβhgβ:g β IGSum.inr = gβhgβ1:(β(g β IGSum.inl)).1 = (βgβ).1hgβ2:(β(g β IGSum.inl)).2 = (βgβ).2hgβ1:(β(g β IGSum.inr)).1 = (βgβ).1hgβ2:(β(g β IGSum.inr)).2 = (βgβ).2x:(IGSum Bβ Bβ).carrierDβ’ (hom (βg).2).toFun x =
(hom
(ββ¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β©).2).toFun
x cases x with
| inl dβ => h.right.hD.inl π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yg:IGSum Bβ Bβ βΆ Yhgβ:g β IGSum.inl = gβhgβ:g β IGSum.inr = gβhgβ1:(β(g β IGSum.inl)).1 = (βgβ).1hgβ2:(β(g β IGSum.inl)).2 = (βgβ).2hgβ1:(β(g β IGSum.inr)).1 = (βgβ).1hgβ2:(β(g β IGSum.inr)).2 = (βgβ).2dβ:Bβ.carrierDβ’ (hom (βg).2).toFun (Sum.inl dβ) =
(hom
(ββ¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β©).2).toFun
(Sum.inl dβ) exact congr_hom hgβ2 dβ All goals completed! π
| inr dβ => h.right.hD.inr π:Type uinstβ:Category.{v, u} πBβ:IrreflexiveGraphBβ:IrreflexiveGraphY:IrreflexiveGraphgβ:Bβ βΆ Ygβ:Bβ βΆ Yg:IGSum Bβ Bβ βΆ Yhgβ:g β IGSum.inl = gβhgβ:g β IGSum.inr = gβhgβ1:(β(g β IGSum.inl)).1 = (βgβ).1hgβ2:(β(g β IGSum.inl)).2 = (βgβ).2hgβ1:(β(g β IGSum.inr)).1 = (βgβ).1hgβ2:(β(g β IGSum.inr)).2 = (βgβ).2dβ:Bβ.carrierDβ’ (hom (βg).2).toFun (Sum.inr dβ) =
(hom
(ββ¨(βΎfun x β¦
match x with
| Sum.inl aβ => (hom (βgβ).1) aβ
| Sum.inr aβ => (hom (βgβ).1) aβ,
βΎfun x β¦
match x with
| Sum.inl dβ => (hom (βgβ).2) dβ
| Sum.inr dβ => (hom (βgβ).2) dβ),
β―β©).2).toFun
(Sum.inr dβ) exact congr_hom hgβ2 dβ All goals completed! π
}