For every path c=(c1,c2) in X×YX, we have β([c1])=β([c2]).
Let c be such a path.
Let x∈X, and let Kx be its stabilizer in G. By TG, III, p. 32, prop. 8, there exists an open neighbourhood Ux of x in X such that Kx⋅Ux= Ux,g⋅Ux∩Ux = ∅ for every g∈ G - Kx, and such that the mapping f induces a homeomorphism of Ux/Kx onto an open neighbourhood Vx of f(x) in Y. As X is unlaceable and the restriction of the mapping f to Ux is open and closed, we may further suppose that Ux is connected and that the image of the canonical homomorphism π1(Ux,x)→π1(X,x) is reduced to the identity element. The open sets (Vx)x∈X thus constructed form an open covering of Y. By lemma 4 of III, p. 272, applied to the compact space I and to the open sets (f∘c1)−1(Vx) for x∈X, there exists an integer n⩾1 such that for every i∈{1,...,n}, there exists a point xi in X such that c1([ni−1,ni])
is contained in f−1(Vxi). As f∘c1=f∘c2,c2([ni−1,ni]) is also
contained in f−1(Vxi).
For j=1 or 2 and for i∈{1,...,n}, let cj,i denote the path in X defined by t↦cj(ni+t−1); we have cj=cj,1∗⋯∗cj,n(III, p. 291, remark 1). Hence, to prove that β([c1])=β([c2]), it is enough to prove that β([c1,i])=β([c2,i]) for every integer i∈{1,...,n}. Replacing the pair of paths (c1,c2) by the pair (c1,i,c2,i) if necessary, we thus suppose that there exists x∈X such that (f∘c1)([0,1])⊂Vx.
The inverse image of Vx by f is the disjoint union of the connected components g⋅Ux, where g runs through a system of representatives in G of G/Kx. For i=1 or 2, let gi be an element of G such that the point xi= gi⋅ci(0) belongs to Ux. The image of the path gi⋅ci is then contained in Ux. By definition of the groupoid ϖ(X)/G, we have β([gi⋅ci])=β([ci]), which makes it possible to suppose that the images of the paths c1 and c2 are contained in Ux and that g1=g2=e.
For s=0 or 1, let ds be a path in Ux joining x to c1(s) and let gs be an element of Kx such that gs⋅c2(s)=c1(s). The paths d0∗c1∗d1 and d0∗(g0⋅c2)∗(g0g1−1⋅d1) are loops at x in Ux. They are therefore strictly homotopic in X to the constant loop at x, because the image of the canonical homomorphism π1(Ux,x)→π1(X,x) reduces to the identity element. Their classes have in particular the same image under the groupoid morphism β, whence
β([d0])β([c1])β([d1])−1=β([d0])β([g0⋅c2])β([g0g1−1⋅d1])−1
Since β([g⋅c])=β([c]) for every element g∈G and every path c in X, it follows that β([c1])=β([c2]), as was to be proved.
By the lemma, the two groupoid morphisms β∘ϖ(pr1) and β∘ϖ(pr2) of ϖ(X×YX) into Coeg(f) are equal. By the universal property of the coequaliser, there therefore exists a unique groupoid morphism α′: Coeg(f)→ϖ(X)/G such that β=α′∘γ. The morphism α′∘α is the unique groupoid morphism φ of ϖ(X)/G into itself such that φ∘β=β; hence α′∘α = Idϖ(X)/G. Analogously, α∘α′= IdCoeg(f). Consequently, α is an isomorphism.
Bourbaki sets the proof directly after the statement, and the corpus does not separate them, so what is above is the statement and its proof together.
Nothing.
Nothing.