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

Theorem eupths 30622
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 6885 . . . . 5 (𝑔 = 𝐺 → (iEdg‘𝑔) = (iEdg‘𝐺))
2 eupths.i . . . . 5 𝐼 = (iEdg‘𝐺)
31, 2eqtr4di 2818 . . . 4 (𝑔 = 𝐺 → (iEdg‘𝑔) = 𝐼)
43dmeqd 5897 . . 3 (𝑔 = 𝐺 → dom (iEdg‘𝑔) = dom 𝐼)
5 foeq3 6794 . . 3 (dom (iEdg‘𝑔) = dom 𝐼 → (𝑓:(0..^(♯‘𝑓))–onto→dom (iEdg‘𝑔) ↔ 𝑓:(0..^(♯‘𝑓))–onto→dom 𝐼))
64, 5syl 18 . 2 (𝑔 = 𝐺 → (𝑓:(0..^(♯‘𝑓))–onto→dom (iEdg‘𝑔) ↔ 𝑓:(0..^(♯‘𝑓))–onto→dom 𝐼))
7 df-eupth 30620 . 2 EulerPaths = (𝑔 ∈ V ↦ {⟨𝑓, 𝑝⟩ ∣ (𝑓(Trails‘𝑔)𝑝𝑓:(0..^(♯‘𝑓))–onto→dom (iEdg‘𝑔))})
86, 7fvmptopab 7474 1 (EulerPaths‘𝐺) = {⟨𝑓, 𝑝⟩ ∣ (𝑓(Trails‘𝐺)𝑝𝑓:(0..^(♯‘𝑓))–onto→dom 𝐼)}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209  wa 401   = wceq 1570   class class class wbr 5111  {copab 5175  dom cdm 5663  ontowfo 6538  cfv 6540  (class class class)co 7419  0cc0 11115  ..^cfzo 13699  chash 14384  iEdgciedg 29402  Trailsctrls 30100  EulerPathsceupth 30619
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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406
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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-iota 6496  df-fun 6542  df-fo 6546  df-fv 6548  df-eupth 30620
This theorem is used by:  iseupth  30623
  Copyright terms: Public domain W3C validator