+<pre>
+ γ = (ρ G)
+ = ((ρ <=< unit) G)
+ = (((join R') -v- (M ρ) -v- unit) G)
+ = (((join R') G) -v- ((M ρ) G) -v- (unit G))
+ = ((join (R'G)) -v- (M (ρ G)) -v- (unit G))
+ since γ = (ρ G) is a natural transformation to MR'G,
+ this satisfies the definition <=<:
+ = γ <=< (unit G)
+</pre>
+
+where as we said <code>γ</code> is a natural transformation from `G` to some `MR'G`.
+
+Summarizing then, the monad laws can be expressed as:
+
+<pre>
+ For all ρ, γ, φ in T for which ρ <=< γ and γ <=< φ are defined:
+
+ (i) γ <=< φ etc are also in T
+
+ (ii) (ρ <=< γ) <=< φ = ρ <=< (γ <=< φ)
+
+ (iii.1) (unit G') <=< γ = γ
+ when γ is a natural transformation from some FG' to MG'
+
+ (iii.2) γ = γ <=< (unit G)
+ when γ is a natural transformation from G to some MR'G
+</pre>
+
+
+
+Getting to the standard category-theory presentation of the monad laws
+----------------------------------------------------------------------
+In category theory, the monad laws are usually stated in terms of `unit` and `join` instead of `unit` and `<=<`.
+
+<!--
+ P2. every element C1 of a category <b>C</b> has an identity morphism 1<sub>C1</sub> such that for every morphism f:C1→C2 in <b>C</b>: 1<sub>C2</sub> ∘ f = f = f ∘ 1<sub>C1</sub>.
+ P3. functors "preserve identity", that is for every element C1 in F's source category: F(1<sub>C1</sub>) = 1<sub>F(C1)</sub>.
+-->