Theorem crcts 29810

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

Assertion

Ref	Expression
crcts	⊢ (Circuits‘𝐺) = {⟨𝑓, 𝑝⟩ ∣ (𝑓(Trails‘𝐺)𝑝 ∧ (𝑝‘0) = (𝑝‘(♯‘𝑓)))}

Distinct variable group:   𝑓,𝐺,𝑝

Proof of Theorem crcts

Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		biidd 262	. 2 ⊢ (𝑔 = 𝐺 → ((𝑝‘0) = (𝑝‘(♯‘𝑓)) ↔ (𝑝‘0) = (𝑝‘(♯‘𝑓))))
2		df-crcts 29808	. 2 ⊢ Circuits = (𝑔 ∈ V ↦ {⟨𝑓, 𝑝⟩ ∣ (𝑓(Trails‘𝑔)𝑝 ∧ (𝑝‘0) = (𝑝‘(♯‘𝑓)))})
3	1, 2	fvmptopab 7411	1 ⊢ (Circuits‘𝐺) = {⟨𝑓, 𝑝⟩ ∣ (𝑓(Trails‘𝐺)𝑝 ∧ (𝑝‘0) = (𝑝‘(♯‘𝑓)))}

Syntax hints:   ∧ wa 395   = wceq 1541   class class class wbr 5096  {copab 5158  ‘cfv 6490  0cc0 11024  ♯chash 14251  Trailsctrls 29711  Circuitsccrcts 29806

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-iota 6446  df-fun 6492  df-fv 6498  df-crcts 29808

This theorem is referenced by:  iscrct  29812