Test 4
Show that if {B \times C = \mathbf{1}}, then {B = \mathbf{1}}.
Your demonstration should work in any category.
Hint: First explain what '{B \times C = \mathbf{1}}' means!
Solution: Problem 1
Since {B \times C} is both a product and a terminal object, we have
noncomputable
example {π : Type u} [Category.{v, u} π] [HasTerminal π] {B C : π}
[HasBinaryProduct B C] (h : B β¨― C β
β€_ π) : B β
β€_ π := π:Type uinstβΒ²:Category.{v, u} πinstβΒΉ:HasTerminal πB:πC:πinstβ:HasBinaryProduct B Ch:B β¨― C β
β€_ πβ’ B β
β€_ π
π:Type uinstβΒ²:Category.{v, u} πinstβΒΉ:HasTerminal πB:πC:πinstβ:HasBinaryProduct B Ch:B β¨― C β
β€_ πtBxC:IsTerminal (B β¨― C) := terminalIsTerminal.ofIso h.symmβ’ B β
β€_ π
π:Type uinstβΒ²:Category.{v, u} πinstβΒΉ:HasTerminal πB:πC:πinstβ:HasBinaryProduct B Ch:B β¨― C β
β€_ πtBxC:IsTerminal (B β¨― C) := terminalIsTerminal.ofIso h.symmiso:B β
B β¨― C := { hom := prod.lift (π B) (prod.snd β tBxC.from B), inv := prod.fst, hom_inv_id := β―, inv_hom_id := β― }β’ B β
β€_ π
All goals completed! π
All parts of this problem are in πΊβ, the category of irreflexive graphs.
abbrev IrreflexiveGraph.D : IrreflexiveGraph := {
carrierA := Empty
carrierD := Unit
toSrc := βΎEmpty.elim
toTgt := βΎEmpty.elim
}
abbrev IrreflexiveGraph.A : IrreflexiveGraph := {
carrierA := Unit
carrierD := Fin 2
toSrc := βΎfun _ β¦ 0
toTgt := βΎfun _ β¦ 1
}
def B : IrreflexiveGraph := {
carrierA := Fin 2
carrierD := Fin 2
toSrc := βΎfun
| 0 => 0
| 1 => 0
toTgt := βΎfun
| 0 => 0
| 1 => 1
}
def C : IrreflexiveGraph := {
carrierA := Fin 2
carrierD := Fin 3
toSrc := βΎfun
| 0 => 1
| 1 => 1
toTgt := βΎfun
| 0 => 0
| 1 => 2
}
(a) Find the number of maps {\mathbf{1} \rightarrow B + D} and the number of maps {\mathbf{1} \rightarrow C}.
(b) 'Calculate' {A \times B}, {A \times D}, and {A \times C}. (Draw picturesβinternal diagramsβof them.)
(c) Use the distributive law, and results from (b), to calculate
A \times (B + D)
(d) Show that {A \times (B + D)} is isomorphic to {A \times C}.
Note: Comparing (a) and (d) illustrates the failure of 'cancellation':
From '{A \times (B + D) = A \times C}' we cannot cancel A and conclude that '{B + D = C}'.
Solution: Problem 2
(a) Since {B + D} has a single loop, there is exactly one map {\mathbf{1} \rightarrow B + D}.
open IrreflexiveGraph
def BuD : IrreflexiveGraph := {
carrierA := Sum B.carrierA D.carrierA
carrierD := Sum B.carrierD D.carrierD
toSrc := βΎfun
| Sum.inl a => Sum.inl (B.toSrc a)
| Sum.inr a => Sum.inr (D.toSrc a)
toTgt := βΎfun
| Sum.inl a => Sum.inl (B.toTgt a)
| Sum.inr a => Sum.inr (D.toTgt a)
}
open ConcreteCategory in
example : Unique (termIG βΆ BuD) := {
default := β¨
(βΎfun _ β¦ Sum.inl (0 : Fin 2), βΎfun _ β¦ Sum.inl (0 : Fin 2)),
β’ (βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0).2 β termIG.toSrc = BuD.toSrc β (βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0).1 β§
(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0).2 β termIG.toTgt = BuD.toTgt β (βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0).1 β’ (βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0).2 β termIG.toSrc = BuD.toSrc β (βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0).1β’ (βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0).2 β termIG.toTgt = BuD.toTgt β (βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0).1 β’ (βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0).2 β termIG.toSrc = BuD.toSrc β (βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0).1β’ (βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0).2 β termIG.toTgt = BuD.toTgt β (βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0).1 All goals completed! π
β©
uniq f := f:termIG βΆ BuDβ’ f = β¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©
f:termIG βΆ BuDhSrc:(hom (βf).2) () = (hom BuD.toSrc) ((hom (βf).1) ())β’ f = β¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©
f:termIG βΆ BuDhSrc:(hom (βf).2) () = (hom BuD.toSrc) ((hom (βf).1) ())hTgt:(hom (βf).2) () = (hom BuD.toTgt) ((hom (βf).1) ())β’ f = β¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©
f:termIG βΆ BuDhSrc:(hom (βf).2) () = (hom BuD.toSrc) ((hom (βf).1) ())hTgt:(hom (βf).2) () = (hom BuD.toTgt) ((hom (βf).1) ())h_eq:(hom BuD.toSrc) ((hom (βf).1) ()) = (hom BuD.toTgt) ((hom (βf).1) ())β’ f = β¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©
f:termIG βΆ BuDhSrc:(hom (βf).2) () = (hom BuD.toSrc) ((hom (βf).1) ())hTgt:(hom (βf).2) () = (hom BuD.toTgt) ((hom (βf).1) ())h_eq:(hom BuD.toSrc) ((hom (βf).1) ()) = (hom BuD.toTgt) ((hom (βf).1) ())β’ (βf).1 = (ββ¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©).1f:termIG βΆ BuDhSrc:(hom (βf).2) () = (hom BuD.toSrc) ((hom (βf).1) ())hTgt:(hom (βf).2) () = (hom BuD.toTgt) ((hom (βf).1) ())h_eq:(hom BuD.toSrc) ((hom (βf).1) ()) = (hom BuD.toTgt) ((hom (βf).1) ())β’ (βf).2 = (ββ¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©).2
all_goals
f:termIG βΆ BuDhSrc:(hom (βf).2) () = (hom BuD.toSrc) ((hom (βf).1) ())hTgt:(hom (βf).2) () = (hom BuD.toTgt) ((hom (βf).1) ())h_eq:(hom BuD.toSrc) ((hom (βf).1) ()) = (hom BuD.toTgt) ((hom (βf).1) ())x:termIG.carrierDβ’ (hom (βf).2).toFun x = (hom (ββ¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©).2).toFun x
f:termIG βΆ BuDhSrc:(hom (βf).2) () = (hom BuD.toSrc) ((hom (βf).1) ())hTgt:(hom (βf).2) () = (hom BuD.toTgt) ((hom (βf).1) ())h_eq:(hom BuD.toSrc) ((hom (βf).1) ()) = (hom BuD.toTgt) ((hom (βf).1) ())β’ (hom (βf).2).toFun PUnit.unit = (hom (ββ¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©).2).toFun PUnit.unit
f:termIG βΆ BuDa:BuD.carrierAha:(hom (βf).1) () = ahSrc:(hom (βf).2) () = (hom BuD.toSrc) ahTgt:(hom (βf).2) () = (hom BuD.toTgt) ah_eq:(hom BuD.toSrc) a = (hom BuD.toTgt) aβ’ (hom (βf).2).toFun PUnit.unit = (hom (ββ¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©).2).toFun PUnit.unit
f:termIG βΆ BuDa:BuD.carrierAha:(hom (βf).1) () = ahSrc:(hom (βf).2) () = (hom BuD.toSrc) ahTgt:(hom (βf).2) () = (hom BuD.toTgt) ah_eq:(hom BuD.toSrc) a = (hom BuD.toTgt) aβ’ (hom (βf).2).toFun PUnit.unit = (hom (ββ¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©).2).toFun PUnit.unit cases a with
f:termIG βΆ BuDb:B.carrierAha:(hom (βf).1) () = Sum.inl bhSrc:(hom (βf).2) () = (hom BuD.toSrc) (Sum.inl b)hTgt:(hom (βf).2) () = (hom BuD.toTgt) (Sum.inl b)h_eq:(hom BuD.toSrc) (Sum.inl b) = (hom BuD.toTgt) (Sum.inl b)β’ (hom (βf).2).toFun PUnit.unit = (hom (ββ¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©).2).toFun PUnit.unitf:termIG βΆ BuDb:B.carrierAha:(hom (βf).1) () = Sum.inl bhSrc:(hom (βf).2) () = (hom BuD.toSrc) (Sum.inl b)hTgt:(hom (βf).2) () = (hom BuD.toTgt) (Sum.inl b)h_eq:(hom BuD.toSrc) (Sum.inl b) = (hom BuD.toTgt) (Sum.inl b)β’ (hom (βf).1).toFun PUnit.unit = (hom (ββ¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©).1).toFun PUnit.unit
f:termIG βΆ BuDb:Fin 2ha:(hom (βf).1) () = Sum.inl bhSrc:(hom (βf).2) () = (hom BuD.toSrc) (Sum.inl b)hTgt:(hom (βf).2) () = (hom BuD.toTgt) (Sum.inl b)h_eq:(hom BuD.toSrc) (Sum.inl b) = (hom BuD.toTgt) (Sum.inl b)β’ (hom (βf).2).toFun PUnit.unit = (hom (ββ¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©).2).toFun PUnit.unit
f:termIG βΆ BuDha:(hom (βf).1) () = Sum.inl ((fun i β¦ i) β¨0, β―β©)hSrc:(hom (βf).2) () = (hom BuD.toSrc) (Sum.inl ((fun i β¦ i) β¨0, β―β©))hTgt:(hom (βf).2) () = (hom BuD.toTgt) (Sum.inl ((fun i β¦ i) β¨0, β―β©))h_eq:(hom BuD.toSrc) (Sum.inl ((fun i β¦ i) β¨0, β―β©)) = (hom BuD.toTgt) (Sum.inl ((fun i β¦ i) β¨0, β―β©))β’ (hom (βf).2).toFun PUnit.unit = (hom (ββ¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©).2).toFun PUnit.unitf:termIG βΆ BuDha:(hom (βf).1) () = Sum.inl ((fun i β¦ i) β¨1, β―β©)hSrc:(hom (βf).2) () = (hom BuD.toSrc) (Sum.inl ((fun i β¦ i) β¨1, β―β©))hTgt:(hom (βf).2) () = (hom BuD.toTgt) (Sum.inl ((fun i β¦ i) β¨1, β―β©))h_eq:(hom BuD.toSrc) (Sum.inl ((fun i β¦ i) β¨1, β―β©)) = (hom BuD.toTgt) (Sum.inl ((fun i β¦ i) β¨1, β―β©))β’ (hom (βf).2).toFun PUnit.unit = (hom (ββ¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©).2).toFun PUnit.unit
f:termIG βΆ BuDha:(hom (βf).1) () = Sum.inl ((fun i β¦ i) β¨0, β―β©)hSrc:(hom (βf).2) () = (hom BuD.toSrc) (Sum.inl ((fun i β¦ i) β¨0, β―β©))hTgt:(hom (βf).2) () = (hom BuD.toTgt) (Sum.inl ((fun i β¦ i) β¨0, β―β©))h_eq:(hom BuD.toSrc) (Sum.inl ((fun i β¦ i) β¨0, β―β©)) = (hom BuD.toTgt) (Sum.inl ((fun i β¦ i) β¨0, β―β©))β’ (hom (βf).2).toFun PUnit.unit = (hom (ββ¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©).2).toFun PUnit.unit first | f:termIG βΆ BuDha:(hom (βf).1) () = Sum.inl ((fun i β¦ i) β¨0, β―β©)hSrc:(hom (βf).2) () = (hom BuD.toSrc) (Sum.inl ((fun i β¦ i) β¨0, β―β©))hTgt:(hom (βf).2) () = (hom BuD.toTgt) (Sum.inl ((fun i β¦ i) β¨0, β―β©))h_eq:(hom BuD.toSrc) (Sum.inl ((fun i β¦ i) β¨0, β―β©)) = (hom BuD.toTgt) (Sum.inl ((fun i β¦ i) β¨0, β―β©))β’ (hom (βf).2).toFun PUnit.unit = (hom (ββ¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©).2).toFun PUnit.unit | All goals completed! π
f:termIG βΆ BuDha:(hom (βf).1) () = Sum.inl ((fun i β¦ i) β¨1, β―β©)hSrc:(hom (βf).2) () = (hom BuD.toSrc) (Sum.inl ((fun i β¦ i) β¨1, β―β©))hTgt:(hom (βf).2) () = (hom BuD.toTgt) (Sum.inl ((fun i β¦ i) β¨1, β―β©))h_eq:(hom BuD.toSrc) (Sum.inl ((fun i β¦ i) β¨1, β―β©)) = (hom BuD.toTgt) (Sum.inl ((fun i β¦ i) β¨1, β―β©))β’ (hom (βf).2).toFun PUnit.unit = (hom (ββ¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©).2).toFun PUnit.unit f:termIG βΆ BuDha:(hom (βf).1) () = Sum.inl ((fun i β¦ i) β¨1, β―β©)hSrc:(hom (βf).2) () = (hom BuD.toSrc) (Sum.inl ((fun i β¦ i) β¨1, β―β©))hTgt:(hom (βf).2) () = (hom BuD.toTgt) (Sum.inl ((fun i β¦ i) β¨1, β―β©))h_eq:Sum.inl 0 = Sum.inl 1β’ (hom (βf).2).toFun PUnit.unit = (hom (ββ¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©).2).toFun PUnit.unit
All goals completed! π
try All goals completed! π
f:termIG βΆ BuDd:D.carrierAha:(hom (βf).1) () = Sum.inr dhSrc:(hom (βf).2) () = (hom BuD.toSrc) (Sum.inr d)hTgt:(hom (βf).2) () = (hom BuD.toTgt) (Sum.inr d)h_eq:(hom BuD.toSrc) (Sum.inr d) = (hom BuD.toTgt) (Sum.inr d)β’ (hom (βf).2).toFun PUnit.unit = (hom (ββ¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©).2).toFun PUnit.unitf:termIG βΆ BuDd:D.carrierAha:(hom (βf).1) () = Sum.inr dhSrc:(hom (βf).2) () = (hom BuD.toSrc) (Sum.inr d)hTgt:(hom (βf).2) () = (hom BuD.toTgt) (Sum.inr d)h_eq:(hom BuD.toSrc) (Sum.inr d) = (hom BuD.toTgt) (Sum.inr d)β’ (hom (βf).1).toFun PUnit.unit = (hom (ββ¨(βΎfun x β¦ Sum.inl 0, βΎfun x β¦ Sum.inl 0), β―β©).1).toFun PUnit.unit
All goals completed! π
}
Since C has no loops, there are no maps {\mathbf{1} \rightarrow C}.
open ConcreteCategory in
example : IsEmpty (termIG βΆ C) := {
false f := f:termIG βΆ Cβ’ False
f:termIG βΆ ChSrc:(hom (βf).2) () = (hom C.toSrc) ((hom (βf).1) ())β’ False
f:termIG βΆ ChSrc:(hom (βf).2) () = (hom C.toSrc) ((hom (βf).1) ())hTgt:(hom (βf).2) () = (hom C.toTgt) ((hom (βf).1) ())β’ False
f:termIG βΆ ChSrc:(hom (βf).2) () = (hom C.toSrc) ((hom (βf).1) ())hTgt:(hom (βf).2) () = (hom C.toTgt) ((hom (βf).1) ())h_eq:(hom C.toSrc) ((hom (βf).1) ()) = (hom C.toTgt) ((hom (βf).1) ())β’ False
f:termIG βΆ ChSrc:(hom (βf).2) () = (hom C.toSrc) ((hom (βf).1) ())hTgt:(hom (βf).2) () = (hom C.toTgt) ((hom (βf).1) ())a:C.carrierAh_eq:(hom C.toSrc) a = (hom C.toTgt) aβ’ False
f:termIG βΆ ChSrc:(hom (βf).2) () = (hom C.toSrc) ((hom (βf).1) ())hTgt:(hom (βf).2) () = (hom C.toTgt) ((hom (βf).1) ())a:Fin 2h_eq:(hom C.toSrc) a = (hom C.toTgt) aβ’ False
f:termIG βΆ ChSrc:(hom (βf).2) () = (hom C.toSrc) ((hom (βf).1) ())hTgt:(hom (βf).2) () = (hom C.toTgt) ((hom (βf).1) ())h_eq:(hom C.toSrc) ((fun i β¦ i) β¨0, β―β©) = (hom C.toTgt) ((fun i β¦ i) β¨0, β―β©)β’ Falsef:termIG βΆ ChSrc:(hom (βf).2) () = (hom C.toSrc) ((hom (βf).1) ())hTgt:(hom (βf).2) () = (hom C.toTgt) ((hom (βf).1) ())h_eq:(hom C.toSrc) ((fun i β¦ i) β¨1, β―β©) = (hom C.toTgt) ((fun i β¦ i) β¨1, β―β©)β’ False
f:termIG βΆ ChSrc:(hom (βf).2) () = (hom C.toSrc) ((hom (βf).1) ())hTgt:(hom (βf).2) () = (hom C.toTgt) ((hom (βf).1) ())h_eq:(hom C.toSrc) ((fun i β¦ i) β¨0, β―β©) = (hom C.toTgt) ((fun i β¦ i) β¨0, β―β©)β’ False f:termIG βΆ ChSrc:(hom (βf).2) () = (hom C.toSrc) ((hom (βf).1) ())hTgt:(hom (βf).2) () = (hom C.toTgt) ((hom (βf).1) ())h_eq:1 = 0β’ False
All goals completed! π
f:termIG βΆ ChSrc:(hom (βf).2) () = (hom C.toSrc) ((hom (βf).1) ())hTgt:(hom (βf).2) () = (hom C.toTgt) ((hom (βf).1) ())h_eq:(hom C.toSrc) ((fun i β¦ i) β¨1, β―β©) = (hom C.toTgt) ((fun i β¦ i) β¨1, β―β©)β’ False f:termIG βΆ ChSrc:(hom (βf).2) () = (hom C.toSrc) ((hom (βf).1) ())hTgt:(hom (βf).2) () = (hom C.toTgt) ((hom (βf).1) ())h_eq:1 = 2β’ False
All goals completed! π
}
(b) We can formalise the products {A \times B}, {A \times D}, and {A \times C} as follows:
def AxB : IrreflexiveGraph := {
carrierA := Fin 2
carrierD := Fin 2 Γ Fin 2
toSrc := βΎfun _ β¦ (0, 0)
toTgt := βΎfun
| 0 => (1, 0)
| 1 => (1, 1)
}
def AxD : IrreflexiveGraph := {
carrierA := Empty
carrierD := Fin 2
toSrc := βΎEmpty.elim
toTgt := βΎEmpty.elim
}
def AxC : IrreflexiveGraph := {
carrierA := Fin 2
carrierD := Fin 2 Γ Fin 3
toSrc := βΎfun _ β¦ (0, 1)
toTgt := βΎfun
| 0 => (1, 0)
| 1 => (1, 2)
}
(c) In the same manner as part (b), we can formalise {A \times (B + D)} as follows:
def AxBuD : IrreflexiveGraph := {
carrierA := Fin 2
carrierD := Fin 2 Γ Fin 3
toSrc := βΎfun _ β¦ (0, 0)
toTgt := βΎfun
| 0 => (1, 0)
| 1 => (1, 1)
}
(d) We can then use our definitions from parts (b) and (c) to show that {A \times (B + D)} is isomorphic to {A \times C}.
example : AxBuD β
AxC := β’ AxBuD β
AxC
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ AxBuD β
AxC
exact {
hom := β¨(βΎfun a β¦ a, fD),
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (βΎfun a β¦ a, fD).2 β AxBuD.toSrc = AxC.toSrc β (βΎfun a β¦ a, fD).1 β§
(βΎfun a β¦ a, fD).2 β AxBuD.toTgt = AxC.toTgt β (βΎfun a β¦ a, fD).1
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (βΎfun a β¦ a, fD).2 β AxBuD.toSrc = AxC.toSrc β (βΎfun a β¦ a, fD).1fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (βΎfun a β¦ a, fD).2 β AxBuD.toTgt = AxC.toTgt β (βΎfun a β¦ a, fD).1
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (βΎfun a β¦ a, fD).2 β AxBuD.toSrc = AxC.toSrc β (βΎfun a β¦ a, fD).1 All goals completed! π
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (βΎfun a β¦ a, fD).2 β AxBuD.toTgt = AxC.toTgt β (βΎfun a β¦ a, fD).1 fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)d:AxBuD.carrierAβ’ (ConcreteCategory.hom ((βΎfun a β¦ a, fD).2 β AxBuD.toTgt)).toFun d =
(ConcreteCategory.hom (AxC.toTgt β (βΎfun a β¦ a, fD).1)).toFun d
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)d:Fin 2β’ (ConcreteCategory.hom ((βΎfun a β¦ a, fD).2 β AxBuD.toTgt)).toFun d =
(ConcreteCategory.hom (AxC.toTgt β (βΎfun a β¦ a, fD).1)).toFun d
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom ((βΎfun a β¦ a, fD).2 β AxBuD.toTgt)).toFun ((fun i β¦ i) β¨0, β―β©) =
(ConcreteCategory.hom (AxC.toTgt β (βΎfun a β¦ a, fD).1)).toFun ((fun i β¦ i) β¨0, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom ((βΎfun a β¦ a, fD).2 β AxBuD.toTgt)).toFun ((fun i β¦ i) β¨1, β―β©) =
(ConcreteCategory.hom (AxC.toTgt β (βΎfun a β¦ a, fD).1)).toFun ((fun i β¦ i) β¨1, β―β©) fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom ((βΎfun a β¦ a, fD).2 β AxBuD.toTgt)).toFun ((fun i β¦ i) β¨0, β―β©) =
(ConcreteCategory.hom (AxC.toTgt β (βΎfun a β¦ a, fD).1)).toFun ((fun i β¦ i) β¨0, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom ((βΎfun a β¦ a, fD).2 β AxBuD.toTgt)).toFun ((fun i β¦ i) β¨1, β―β©) =
(ConcreteCategory.hom (AxC.toTgt β (βΎfun a β¦ a, fD).1)).toFun ((fun i β¦ i) β¨1, β―β©) All goals completed! πβ©
inv := β¨(βΎfun a β¦ a, fD),
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (βΎfun a β¦ a, fD).2 β AxC.toSrc = AxBuD.toSrc β (βΎfun a β¦ a, fD).1 β§
(βΎfun a β¦ a, fD).2 β AxC.toTgt = AxBuD.toTgt β (βΎfun a β¦ a, fD).1
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (βΎfun a β¦ a, fD).2 β AxC.toSrc = AxBuD.toSrc β (βΎfun a β¦ a, fD).1fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (βΎfun a β¦ a, fD).2 β AxC.toTgt = AxBuD.toTgt β (βΎfun a β¦ a, fD).1
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (βΎfun a β¦ a, fD).2 β AxC.toSrc = AxBuD.toSrc β (βΎfun a β¦ a, fD).1 All goals completed! π
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (βΎfun a β¦ a, fD).2 β AxC.toTgt = AxBuD.toTgt β (βΎfun a β¦ a, fD).1 fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)d:AxC.carrierAβ’ (ConcreteCategory.hom ((βΎfun a β¦ a, fD).2 β AxC.toTgt)).toFun d =
(ConcreteCategory.hom (AxBuD.toTgt β (βΎfun a β¦ a, fD).1)).toFun d
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)d:Fin 2β’ (ConcreteCategory.hom ((βΎfun a β¦ a, fD).2 β AxC.toTgt)).toFun d =
(ConcreteCategory.hom (AxBuD.toTgt β (βΎfun a β¦ a, fD).1)).toFun d
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom ((βΎfun a β¦ a, fD).2 β AxC.toTgt)).toFun ((fun i β¦ i) β¨0, β―β©) =
(ConcreteCategory.hom (AxBuD.toTgt β (βΎfun a β¦ a, fD).1)).toFun ((fun i β¦ i) β¨0, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom ((βΎfun a β¦ a, fD).2 β AxC.toTgt)).toFun ((fun i β¦ i) β¨1, β―β©) =
(ConcreteCategory.hom (AxBuD.toTgt β (βΎfun a β¦ a, fD).1)).toFun ((fun i β¦ i) β¨1, β―β©) fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom ((βΎfun a β¦ a, fD).2 β AxC.toTgt)).toFun ((fun i β¦ i) β¨0, β―β©) =
(ConcreteCategory.hom (AxBuD.toTgt β (βΎfun a β¦ a, fD).1)).toFun ((fun i β¦ i) β¨0, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom ((βΎfun a β¦ a, fD).2 β AxC.toTgt)).toFun ((fun i β¦ i) β¨1, β―β©) =
(ConcreteCategory.hom (AxBuD.toTgt β (βΎfun a β¦ a, fD).1)).toFun ((fun i β¦ i) β¨1, β―β©) All goals completed! πβ©
hom_inv_id := fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β© = π AxBuD
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).1 = (β(π AxBuD)).1fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2 = (β(π AxBuD)).2
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).1 = (β(π AxBuD)).1 All goals completed! π
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2 = (β(π AxBuD)).2 fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)d:AxBuD.carrierDβ’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun d =
(ConcreteCategory.hom (β(π AxBuD)).2).toFun d
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)d:Fin 2 Γ Fin 3β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun d =
(ConcreteCategory.hom (β(π AxBuD)).2).toFun d
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨0, β―β©) =
(ConcreteCategory.hom (β(π AxBuD)).2).toFun ((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨0, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨1, β―β©) =
(ConcreteCategory.hom (β(π AxBuD)).2).toFun ((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨1, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨2, β―β©) =
(ConcreteCategory.hom (β(π AxBuD)).2).toFun ((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨2, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨0, β―β©) =
(ConcreteCategory.hom (β(π AxBuD)).2).toFun ((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨0, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨1, β―β©) =
(ConcreteCategory.hom (β(π AxBuD)).2).toFun ((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨1, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨2, β―β©) =
(ConcreteCategory.hom (β(π AxBuD)).2).toFun ((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨2, β―β©) fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨0, β―β©) =
(ConcreteCategory.hom (β(π AxBuD)).2).toFun ((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨0, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨1, β―β©) =
(ConcreteCategory.hom (β(π AxBuD)).2).toFun ((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨1, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨2, β―β©) =
(ConcreteCategory.hom (β(π AxBuD)).2).toFun ((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨2, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨0, β―β©) =
(ConcreteCategory.hom (β(π AxBuD)).2).toFun ((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨0, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨1, β―β©) =
(ConcreteCategory.hom (β(π AxBuD)).2).toFun ((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨1, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨2, β―β©) =
(ConcreteCategory.hom (β(π AxBuD)).2).toFun ((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨2, β―β©) All goals completed! π
inv_hom_id := fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β© = π AxC
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).1 = (β(π AxC)).1fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2 = (β(π AxC)).2
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).1 = (β(π AxC)).1 All goals completed! π
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2 = (β(π AxC)).2 fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)d:AxC.carrierDβ’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun d =
(ConcreteCategory.hom (β(π AxC)).2).toFun d
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)d:Fin 2 Γ Fin 3β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun d =
(ConcreteCategory.hom (β(π AxC)).2).toFun d
fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨0, β―β©) =
(ConcreteCategory.hom (β(π AxC)).2).toFun ((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨0, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨1, β―β©) =
(ConcreteCategory.hom (β(π AxC)).2).toFun ((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨1, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨2, β―β©) =
(ConcreteCategory.hom (β(π AxC)).2).toFun ((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨2, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨0, β―β©) =
(ConcreteCategory.hom (β(π AxC)).2).toFun ((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨0, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨1, β―β©) =
(ConcreteCategory.hom (β(π AxC)).2).toFun ((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨1, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨2, β―β©) =
(ConcreteCategory.hom (β(π AxC)).2).toFun ((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨2, β―β©) fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨0, β―β©) =
(ConcreteCategory.hom (β(π AxC)).2).toFun ((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨0, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨1, β―β©) =
(ConcreteCategory.hom (β(π AxC)).2).toFun ((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨1, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨2, β―β©) =
(ConcreteCategory.hom (β(π AxC)).2).toFun ((fun i β¦ i) β¨0, β―β©, (fun i β¦ i) β¨2, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨0, β―β©) =
(ConcreteCategory.hom (β(π AxC)).2).toFun ((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨0, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨1, β―β©) =
(ConcreteCategory.hom (β(π AxC)).2).toFun ((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨1, β―β©)fD:Fin 2 Γ Fin 3 βΆ Fin 2 Γ Fin 3 :=
βΎfun x β¦
match x with
| (0, 0) => (0, 1)
| (0, 1) => (0, 0)
| (1, 1) => (1, 2)
| (1, 2) => (1, 1)
| (dβ, dβ) => (dβ, dβ)β’ (ConcreteCategory.hom (β(β¨(βΎfun a β¦ a, fD), β―β© β β¨(βΎfun a β¦ a, fD), β―β©)).2).toFun
((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨2, β―β©) =
(ConcreteCategory.hom (β(π AxC)).2).toFun ((fun i β¦ i) β¨1, β―β©, (fun i β¦ i) β¨2, β―β©) All goals completed! π
}