We know that the fundamental theorem of equivalence relations can be stated without reference to sets by using congruence as a conjunction of two propositions as following:
If $R$ together with projections $p_0,p_1:R\rightarrow A$ is a congruence on an object $A$, then it is the kernel pair of the coequalizer of $p_0$ with $p_1$.
If $p:A\rightarrow X$ is any partition (any epimorphism) of object $A$, then $p$ is the coequalizer of its cokernel pair.
It is straightforward to prove 2. by assuming just the axiom of choice (that every epimorphism has a section), while for the 1. I could only prove it using specific properties of abstract sets as following: If $R'$ together with projections $p_0',p_1':R'\rightarrow A$ is the kernel of $p_R$ and $R\not\equiv_{X\times X} R'$, then we can construct an equivalence class whose characteristic map cannot be factored through the coequalizer $p_R$ of $R$.
I'm wondering if there is a more general (than the one sketched above) proof of the 1st statement because the author (F.W. Lawvere and R. Rosebrugh) of the book did not mention if one would need to use any specific properties of $Set$ preceding the question as follows:
Now if we start with an equivalence relation $R$ on $X$, we may form the coequalizer of $p_0,p_1:R\rightarrow X$, which we denote by $p_R:X\rightarrow P_R$. This is a partition of $X$. (We obtain a partition of X by form the coequalizer of any two mappings with codomain $X$ - it is the special properties of equivalence relations that allow the next result.) Taking the equivalence relation of a partition of $X$ and taking the partition from an equivalence relation on $X$ are inverse processes:
Proposition: If $p$ is a partition of $X$, then $p=p_{R_p}$. If $R$ is an equivalence relation on $X$ then $R=R_{p_R}$.
I was wondering if I don't need to use all of the constructions I've used. Perhaps, there is a cleaner proof.
Thanks!