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

Theorem eupths 30288
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 6827 . . . . 5 (𝑔 = 𝐺 → (iEdg‘𝑔) = (iEdg‘𝐺))
2 eupths.i . . . . 5 𝐼 = (iEdg‘𝐺)
31, 2eqtr4di 2792 . . . 4 (𝑔 = 𝐺 → (iEdg‘𝑔) = 𝐼)
43dmeqd 5847 . . 3 (𝑔 = 𝐺 → dom (iEdg‘𝑔) = dom 𝐼)
5 foeq3 6737 . . 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 30286 . 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 207  wa 396   = wceq 1547   class class class wbr 5072  {copab 5134  dom cdm 5618  ontowfo 6483  cfv 6485  (class class class)co 7356  0cc0 11029  ..^cfzo 13599  chash 14283  iEdgciedg 29084  Trailsctrls 29775  EulerPathsceupth 30285
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pr 5362
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-iota 6441  df-fun 6487  df-fo 6491  df-fv 6493  df-eupth 30286
This theorem is referenced by:  iseupth  30289
  Copyright terms: Public domain W3C validator