Theorem: CompHaus.toFiniteCoproductCompFromFiniteCoproduct (CompHaus/ExplicitLimits.lean)

State before:
α : Type
inst✝ : Fintype α
Z : α → CompHaus
⊢ toFiniteCoproduct Z ≫ fromFiniteCoproduct Z = 𝟙 (∐ Z)
Tactic:
ext
State after:
case h.w
α : Type
inst✝ : Fintype α
Z : α → CompHaus
b✝ : α
x✝ : (forget CompHaus).obj (Z b✝)
⊢ ↑(Sigma.ι Z b✝ ≫ toFiniteCoproduct Z ≫ fromFiniteCoproduct Z) x✝ = ↑(Sigma.ι Z b✝ ≫ 𝟙 (∐ Z)) x✝

State before:
case h.w
α : Type
inst✝ : Fintype α
Z : α → CompHaus
b✝ : α
x✝ : (forget CompHaus).obj (Z b✝)
⊢ ↑(Sigma.ι Z b✝ ≫ toFiniteCoproduct Z ≫ fromFiniteCoproduct Z) x✝ = ↑(Sigma.ι Z b✝ ≫ 𝟙 (∐ Z)) x✝
Tactic:
simp [toFiniteCoproduct, fromFiniteCoproduct]
State after:
no goals