Theorem eupths 30551

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.

Step	Hyp	Ref	Expression
1		fveq2 6881	. . . . 5 ⊢ (𝑔 = 𝐺 → (iEdg‘𝑔) = (iEdg‘𝐺))
2		eupths.i	. . . . 5 ⊢ 𝐼 = (iEdg‘𝐺)
3	1, 2	eqtr4di 2816	. . . 4 ⊢ (𝑔 = 𝐺 → (iEdg‘𝑔) = 𝐼)
4	3	dmeqd 5895	. . 3 ⊢ (𝑔 = 𝐺 → dom (iEdg‘𝑔) = dom 𝐼)
5		foeq3 6790	. . 3 ⊢ (dom (iEdg‘𝑔) = dom 𝐼 → (𝑓:(0..^(♯‘𝑓))–onto→dom (iEdg‘𝑔) ↔ 𝑓:(0..^(♯‘𝑓))–onto→dom 𝐼))
6	4, 5	syl 18	. 2 ⊢ (𝑔 = 𝐺 → (𝑓:(0..^(♯‘𝑓))–onto→dom (iEdg‘𝑔) ↔ 𝑓:(0..^(♯‘𝑓))–onto→dom 𝐼))
7		df-eupth 30549	. 2 ⊢ EulerPaths = (𝑔 ∈ V ↦ {⟨𝑓, 𝑝⟩ ∣ (𝑓(Trails‘𝑔)𝑝 ∧ 𝑓:(0..^(♯‘𝑓))–onto→dom (iEdg‘𝑔))})
8	6, 7	fvmptopab 7465	1 ⊢ (EulerPaths‘𝐺) = {⟨𝑓, 𝑝⟩ ∣ (𝑓(Trails‘𝐺)𝑝 ∧ 𝑓:(0..^(♯‘𝑓))–onto→dom 𝐼)}

Syntax hints:   ↔ wb 209   ∧ wa 400   = wceq 1570   class class class wbr 5109  {copab 5173  dom cdm 5661  –onto→wfo 6534  ‘cfv 6536  (class class class)co 7410  0cc0 11095  ..^cfzo 13678  ♯chash 14362  iEdgciedg 29347  Trailsctrls 30038  EulerPathsceupth 30548

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-iota 6492  df-fun 6538  df-fo 6542  df-fv 6544  df-eupth 30549

This theorem is referenced by:  iseupth  30552