Theorem cycls

Description: The set of cycles (in an undirected graph). (Contributed by Alexander van der Vekens, 30-Oct-2017) (Revised by AV, 31-Jan-2021)

	Ref	Expression
Assertion	cycls	$$⊢\mathrm{Cycles}\left(G\right)=\left\{⟨f,p⟩|\left(f\mathrm{Paths}\left(G\right)p\wedge p\left(0\right)=p\left(\left|f\right|\right)\right)\right\}$$

Proof

Step	Hyp	Ref	Expression
1		biidd	$$⊢g=G\to \left(p\left(0\right)=p\left(\left|f\right|\right)\leftrightarrow p\left(0\right)=p\left(\left|f\right|\right)\right)$$
2		df-cycls	$$⊢\mathrm{Cycles}=\left(g\in \mathrm{V}⟼\left\{⟨f,p⟩|\left(f\mathrm{Paths}\left(g\right)p\wedge p\left(0\right)=p\left(\left|f\right|\right)\right)\right\}\right)$$
3	1 2	fvmptopab	$$⊢\mathrm{Cycles}\left(G\right)=\left\{⟨f,p⟩|\left(f\mathrm{Paths}\left(G\right)p\wedge p\left(0\right)=p\left(\left|f\right|\right)\right)\right\}$$