Definition df-eupth 30184

Description: Define the set of all Eulerian paths on an arbitrary graph. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 18-Feb-2021.)

Assertion

Ref	Expression
df-eupth	⊢ EulerPaths = (𝑔 ∈ V ↦ {⟨𝑓, 𝑝⟩ ∣ (𝑓(Trails‘𝑔)𝑝 ∧ 𝑓:(0..^(♯‘𝑓))–onto→dom (iEdg‘𝑔))})

Distinct variable group:   𝑓,𝑔,𝑝

Detailed syntax breakdown of Definition df-eupth

Step	Hyp	Ref	Expression
1		ceupth 30183	. 2 class EulerPaths
2		vg	. . 3 setvar 𝑔
3		cvv 3464	. . 3 class V
4		vf	. . . . . . 7 setvar 𝑓
5	4	cv 1539	. . . . . 6 class 𝑓
6		vp	. . . . . . 7 setvar 𝑝
7	6	cv 1539	. . . . . 6 class 𝑝
8	2	cv 1539	. . . . . . 7 class 𝑔
9		ctrls 29675	. . . . . . 7 class Trails
10	8, 9	cfv 6536	. . . . . 6 class (Trails‘𝑔)
11	5, 7, 10	wbr 5124	. . . . 5 wff 𝑓(Trails‘𝑔)𝑝
12		cc0 11134	. . . . . . 7 class 0
13		chash 14353	. . . . . . . 8 class ♯
14	5, 13	cfv 6536	. . . . . . 7 class (♯‘𝑓)
15		cfzo 13676	. . . . . . 7 class ..^
16	12, 14, 15	co 7410	. . . . . 6 class (0..^(♯‘𝑓))
17		ciedg 28981	. . . . . . . 8 class iEdg
18	8, 17	cfv 6536	. . . . . . 7 class (iEdg‘𝑔)
19	18	cdm 5659	. . . . . 6 class dom (iEdg‘𝑔)
20	16, 19, 5	wfo 6534	. . . . 5 wff 𝑓:(0..^(♯‘𝑓))–onto→dom (iEdg‘𝑔)
21	11, 20	wa 395	. . . 4 wff (𝑓(Trails‘𝑔)𝑝 ∧ 𝑓:(0..^(♯‘𝑓))–onto→dom (iEdg‘𝑔))
22	21, 4, 6	copab 5186	. . 3 class {⟨𝑓, 𝑝⟩ ∣ (𝑓(Trails‘𝑔)𝑝 ∧ 𝑓:(0..^(♯‘𝑓))–onto→dom (iEdg‘𝑔))}
23	2, 3, 22	cmpt 5206	. 2 class (𝑔 ∈ V ↦ {⟨𝑓, 𝑝⟩ ∣ (𝑓(Trails‘𝑔)𝑝 ∧ 𝑓:(0..^(♯‘𝑓))–onto→dom (iEdg‘𝑔))})
24	1, 23	wceq 1540	1 wff EulerPaths = (𝑔 ∈ V ↦ {⟨𝑓, 𝑝⟩ ∣ (𝑓(Trails‘𝑔)𝑝 ∧ 𝑓:(0..^(♯‘𝑓))–onto→dom (iEdg‘𝑔))})

This definition is referenced by:  releupth  30185  eupths  30186