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

Theorem eupths 30224
Description: The Eulerian paths on the graph 𝐺. (Contributed by AV, 18-Feb-2021.) (Revised by AV, 29-Oct-2021.)
Hypothesis
Ref Expression
eupths.i 𝐼 = (iEdg‘𝐺)
Assertion
Ref Expression
eupths (EulerPaths‘𝐺) = {⟨𝑓, 𝑝⟩ ∣ (𝑓(Trails‘𝐺)𝑝𝑓:(0..^(♯‘𝑓))–onto→dom 𝐼)}
Distinct variable group:   𝑓,𝐺,𝑝
Allowed substitution hints:   𝐼(𝑓,𝑝)

Proof of Theorem eupths
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6832 . . . . 5 (𝑔 = 𝐺 → (iEdg‘𝑔) = (iEdg‘𝐺))
2 eupths.i . . . . 5 𝐼 = (iEdg‘𝐺)
31, 2eqtr4di 2787 . . . 4 (𝑔 = 𝐺 → (iEdg‘𝑔) = 𝐼)
43dmeqd 5852 . . 3 (𝑔 = 𝐺 → dom (iEdg‘𝑔) = dom 𝐼)
5 foeq3 6742 . . 3 (dom (iEdg‘𝑔) = dom 𝐼 → (𝑓:(0..^(♯‘𝑓))–onto→dom (iEdg‘𝑔) ↔ 𝑓:(0..^(♯‘𝑓))–onto→dom 𝐼))
64, 5syl 17 . 2 (𝑔 = 𝐺 → (𝑓:(0..^(♯‘𝑓))–onto→dom (iEdg‘𝑔) ↔ 𝑓:(0..^(♯‘𝑓))–onto→dom 𝐼))
7 df-eupth 30222 . 2 EulerPaths = (𝑔 ∈ V ↦ {⟨𝑓, 𝑝⟩ ∣ (𝑓(Trails‘𝑔)𝑝𝑓:(0..^(♯‘𝑓))–onto→dom (iEdg‘𝑔))})
86, 7fvmptopab 7411 1 (EulerPaths‘𝐺) = {⟨𝑓, 𝑝⟩ ∣ (𝑓(Trails‘𝐺)𝑝𝑓:(0..^(♯‘𝑓))–onto→dom 𝐼)}
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1541   class class class wbr 5096  {copab 5158  dom cdm 5622  ontowfo 6488  cfv 6490  (class class class)co 7356  0cc0 11024  ..^cfzo 13568  chash 14251  iEdgciedg 29019  Trailsctrls 29711  EulerPathsceupth 30221
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-fo 6496  df-fv 6498  df-eupth 30222
This theorem is referenced by:  iseupth  30225
  Copyright terms: Public domain W3C validator