The 3-by-3 lemma for regular Goursat categories (Q1770286)

A suitable version of the well-known 3-by-3 lemma for abelian categories can be stated, in more general contexts, by replacing short exact sequences with exact forks (defined in terms of kernel pairs and coequalizers). This note is devoted to give a short proof of that lemma in the setting of a regular Goursat category; see [\textit{A. Carboni}, \textit{G. M. Kelly} and \textit{M. C. Pedicchio}, Appl. Categ. Struct. 1, No. 4, 385--421 (1993; Zbl 0799.18002)].