6
import Logic.ChainReasoning.Poly as CR
15
module Chain = CR _==_ (\x -> refl{x = x}) (\x y z -> trans{x = x}{y}{z})
18
chain-rule : (F G : U)(X : Set) -> ⟦ ∂ (F [ G ]) ⟧ X ≅ ⟦ ∂ F [ G ] × ∂ G ⟧ X
19
chain-rule F G X = iso (i F) (j F) (ji F) (ij F)
21
i : (F : U) -> ⟦ ∂ (F [ G ]) ⟧ X -> ⟦ ∂ F [ G ] × ∂ G ⟧ X
24
i (F₁ + F₂) (inl c) = (inl <×> id) (i F₁ c)
25
i (F₁ + F₂) (inr c) = (inr <×> id) (i F₂ c)
26
i (F₁ × F₂) (inl < c , f₂ >) = (inl ∘ <∙, f₂ > <×> id) (i F₁ c)
27
i (F₁ × F₂) (inr < f₁ , c >) = (inr ∘ < f₁ ,∙> <×> id) (i F₂ c)
29
j : (F : U) -> ⟦ ∂ F [ G ] × ∂ G ⟧ X -> ⟦ ∂ (F [ G ]) ⟧ X
32
j (F₁ + F₂) < inl x , y > = inl (j F₁ < x , y >)
33
j (F₁ + F₂) < inr x , y > = inr (j F₂ < x , y >)
34
j (F₁ × F₂) < inl < x , y > , z > = inl < j F₁ < x , z > , y >
35
j (F₁ × F₂) < inr < x , y > , z > = inr < x , j F₂ < y , z > >
37
ij : (F : U)(x : _) -> i F (j F x) == x
39
ij Id < <> , x > = refl
40
ij (F₁ + F₂) < lx@(inl x) , y > =
41
subst (\ ∙ -> (inl <×> id) ∙ == < lx , y >)
42
(ij F₁ < x , y >) refl
43
ij (F₁ + F₂) < rx@(inr x) , y > =
44
subst (\ ∙ -> (inr <×> id) ∙ == < rx , y >)
45
(ij F₂ < x , y >) refl
46
ij (F₁ × F₂) < xy@(inl < x , y >) , z > =
47
subst (\ ∙ -> (inl ∘ <∙, y > <×> id) ∙ == < xy , z >)
48
(ij F₁ < x , z >) refl
49
ij (F₁ × F₂) < xy@(inr < x , y >) , z > =
50
subst (\ ∙ -> (inr ∘ < x ,∙> <×> id) ∙ == < xy , z >)
51
(ij F₂ < y , z >) refl
53
ji : (F : U)(y : _) -> j F (i F y) == y
56
ji (F₁ + F₂) (inl c) =
57
chain> j (F₁ + F₂) ((inl <×> id) (i F₁ c))
58
=== inl (j F₁ _) by cong (j (F₁ + F₂) ∘ (inl <×> id)) (η-[×] (i F₁ c))
59
=== inl (j F₁ (i F₁ c)) by cong (inl ∘ j F₁) (sym $ η-[×] (i F₁ c))
60
=== inl c by cong inl (ji F₁ c)
61
ji (F₁ + F₂) rc @ (inr c) =
62
subst (\ ∙ -> j (F₁ + F₂) ((inr <×> id) ∙) == rc) (η-[×] (i F₂ c))
63
$ subst (\ ∙ -> inr (j F₂ ∙) == rc) (sym $ η-[×] (i F₂ c))
64
$ subst (\ ∙ -> inr ∙ == rc) (ji F₂ c) refl
65
ji (F₁ × F₂) l @ (inl < c , f₂ >) =
66
subst (\ ∙ -> j (F₁ × F₂) ((inl ∘ <∙, f₂ > <×> id) ∙) == l) (η-[×] (i F₁ c))
67
$ subst (\ ∙ -> inl < j F₁ ∙ , f₂ > == l) (sym $ η-[×] (i F₁ c))
68
$ subst (\ ∙ -> inl < ∙ , f₂ > == l) (ji F₁ c) refl
69
ji (F₁ × F₂) r @ (inr < f₁ , c >) =
70
subst (\ ∙ -> j (F₁ × F₂) ((inr ∘ < f₁ ,∙> <×> id) ∙) == r) (η-[×] (i F₂ c))
71
$ subst (\ ∙ -> inr < f₁ , j F₂ ∙ > == r) (sym $ η-[×] (i F₂ c))
72
$ subst (\ ∙ -> inr < f₁ , ∙ > == r) (ji F₂ c) refl