Theorem releupth 30128

Description: The set (EulerPaths‘𝐺) of all Eulerian paths on 𝐺 is a set of pairs by our definition of an Eulerian path, and so is a relation. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by AV, 18-Feb-2021.)

Assertion

Ref	Expression
releupth	⊢ Rel (EulerPaths‘𝐺)

Proof of Theorem releupth

Dummy variables 𝑓 𝑔 𝑝 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-eupth 30127	. 2 ⊢ EulerPaths = (𝑔 ∈ V ↦ {⟨𝑓, 𝑝⟩ ∣ (𝑓(Trails‘𝑔)𝑝 ∧ 𝑓:(0..^(♯‘𝑓))–onto→dom (iEdg‘𝑔))})
2	1	relmptopab 7639	1 ⊢ Rel (EulerPaths‘𝐺)

Syntax hints:   ∧ wa 395  Vcvv 3447   class class class wbr 5107  dom cdm 5638  Rel wrel 5643  –onto→wfo 6509  ‘cfv 6511  (class class class)co 7387  0cc0 11068  ..^cfzo 13615  ♯chash 14295  iEdgciedg 28924  Trailsctrls 29618  EulerPathsceupth 30126

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fv 6519  df-eupth 30127

This theorem is referenced by:  eulerpath  30170