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

Theorem eupths 30858
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..^(♯‘𝑓))⟶ontodom 𝐼)}
Distinct variable group:   𝑓,𝐺,𝑝
Allowed substitution hints:   𝐼(𝑓, 𝑝)

Proof of Theorem eupths
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6916 . . . . 5 (𝑔 = 𝐺 → (iEdg‘𝑔) = (iEdg‘𝐺))
2 eupths.i . . . . 5 𝐼 = (iEdg‘𝐺)
31, 2eqtr4di 2816 . . . 4 (𝑔 = 𝐺 → (iEdg‘𝑔) = 𝐼)
43dmeqd 5899 . . 3 (𝑔 = 𝐺 → dom (iEdg‘𝑔) = dom 𝐼)
5 foeq3 6824 . . 3 (dom (iEdg‘𝑔) = dom 𝐼 → (𝑓:(0..^(♯‘𝑓))⟶ontodom (iEdg‘𝑔) ↔ 𝑓:(0..^(♯‘𝑓))⟶ontodom 𝐼))
64, 5syl 18 . 2 (𝑔 = 𝐺 → (𝑓:(0..^(♯‘𝑓))⟶ontodom (iEdg‘𝑔) ↔ 𝑓:(0..^(♯‘𝑓))⟶ontodom 𝐼))
7 df-eupth 30856 . 2 EulerPaths = (𝑔 ∈ V ↦ {⟨𝑓, 𝑝⟩ ∣ (𝑓(Trails‘𝑔)𝑝 ∧ 𝑓:(0..^(♯‘𝑓))⟶ontodom (iEdg‘𝑔))})
86, 7fvmptopab 7506 1 (EulerPaths‘𝐺) = {⟨𝑓, 𝑝⟩ ∣ (𝑓(Trails‘𝐺)𝑝 ∧ 𝑓:(0..^(♯‘𝑓))⟶ontodom 𝐼)}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   class class class wbr 5108  {copab 5173  dom cdm 5658  ⟶ontowfo 6564  ‘cfv 6566  (class class class)co 7451  0cc0 11239  ..^cfzo 13828  ♯chash 14515  iEdgciedg 29632  Trailsctrls 30330  EulerPathsceupth 30855
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-fo 6572  df-fv 6574  df-eupth 30856
This theorem is used by:  iseupth  30859
  Copyright terms: Public domain W3C validator