MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cycls Structured version   Visualization version   GIF version

Theorem cycls 30433
Description: The set of cycles (in an undirected graph). (Contributed by Alexander van der Vekens, 30-Oct-2017.) (Revised by AV, 31-Jan-2021.)
Assertion
Ref Expression
cycls (Cycles‘𝐺) = {⟨𝑓, 𝑝⟩ ∣ (𝑓(Paths‘𝐺)𝑝 ∧ (𝑝‘0) = (𝑝‘(♯‘𝑓)))}
Distinct variable group:   𝑓,𝐺,𝑝

Proof of Theorem cycls
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 biidd 265 . 2 (𝑔 = 𝐺 → ((𝑝‘0) = (𝑝‘(♯‘𝑓)) ↔ (𝑝‘0) = (𝑝‘(♯‘𝑓))))
2 df-cycls 30431 . 2 Cycles = (𝑔 ∈ V ↦ {⟨𝑓, 𝑝⟩ ∣ (𝑓(Paths‘𝑔)𝑝 ∧ (𝑝‘0) = (𝑝‘(♯‘𝑓)))})
31, 2fvmptopab 7506 1 (Cycles‘𝐺) = {⟨𝑓, 𝑝⟩ ∣ (𝑓(Paths‘𝐺)𝑝 ∧ (𝑝‘0) = (𝑝‘(♯‘𝑓)))}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570   class class class wbr 5108  {copab 5173  ‘cfv 6566  0cc0 11239  ♯chash 14515  Pathscpths 30352  Cyclesccycls 30429
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-cycls 30431
This theorem is used by:  iscycl  30435
  Copyright terms: Public domain W3C validator