Metamath Proof Explorer


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 CyclesG=fp|fPathsGpp0=pf

Proof

Step Hyp Ref Expression
1 biidd g=Gp0=pfp0=pf
2 wksv fp|fWalksGpV
3 pthiswlk fPathsGpfWalksGp
4 3 ssopab2i fp|fPathsGpfp|fWalksGp
5 2 4 ssexi fp|fPathsGpV
6 5 a1i fp|fPathsGpV
7 df-cycls Cycles=gVfp|fPathsgpp0=pf
8 1 6 7 fvmptopab CyclesG=fp|fPathsGpp0=pf
9 8 mptru CyclesG=fp|fPathsGpp0=pf