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

Theorem iseupthf1o 30231
Description: The property "𝐹, 𝑃 is an Eulerian path on the graph 𝐺". An Eulerian path is defined as bijection 𝐹 from the edges to a set 0...(𝑁 − 1) and a function 𝑃:(0...𝑁)⟶𝑉 into the vertices such that for each 0 ≤ 𝑘 < 𝑁, 𝐹(𝑘) is an edge from 𝑃(𝑘) to 𝑃(𝑘 + 1). (Since the edges are undirected and there are possibly many edges between any two given vertices, we need to list both the edges and the vertices of the path separately.) (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by Mario Carneiro, 3-May-2015.) (Revised by AV, 18-Feb-2021.) (Revised by AV, 30-Oct-2021.)
Hypothesis
Ref Expression
eupths.i 𝐼 = (iEdg‘𝐺)
Assertion
Ref Expression
iseupthf1o (𝐹(EulerPaths‘𝐺)𝑃 ↔ (𝐹(Walks‘𝐺)𝑃𝐹:(0..^(♯‘𝐹))–1-1-onto→dom 𝐼))

Proof of Theorem iseupthf1o
StepHypRef Expression
1 eupths.i . . 3 𝐼 = (iEdg‘𝐺)
21iseupth 30230 . 2 (𝐹(EulerPaths‘𝐺)𝑃 ↔ (𝐹(Trails‘𝐺)𝑃𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼))
3 istrl 29729 . . . 4 (𝐹(Trails‘𝐺)𝑃 ↔ (𝐹(Walks‘𝐺)𝑃 ∧ Fun 𝐹))
43anbi1i 624 . . 3 ((𝐹(Trails‘𝐺)𝑃𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼) ↔ ((𝐹(Walks‘𝐺)𝑃 ∧ Fun 𝐹) ∧ 𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼))
5 anass 468 . . 3 (((𝐹(Walks‘𝐺)𝑃 ∧ Fun 𝐹) ∧ 𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼) ↔ (𝐹(Walks‘𝐺)𝑃 ∧ (Fun 𝐹𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼)))
6 ancom 460 . . . 4 ((Fun 𝐹𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼) ↔ (𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼 ∧ Fun 𝐹))
76anbi2i 623 . . 3 ((𝐹(Walks‘𝐺)𝑃 ∧ (Fun 𝐹𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼)) ↔ (𝐹(Walks‘𝐺)𝑃 ∧ (𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼 ∧ Fun 𝐹)))
84, 5, 73bitri 297 . 2 ((𝐹(Trails‘𝐺)𝑃𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼) ↔ (𝐹(Walks‘𝐺)𝑃 ∧ (𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼 ∧ Fun 𝐹)))
9 dff1o3 6855 . . . 4 (𝐹:(0..^(♯‘𝐹))–1-1-onto→dom 𝐼 ↔ (𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼 ∧ Fun 𝐹))
109bicomi 224 . . 3 ((𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼 ∧ Fun 𝐹) ↔ 𝐹:(0..^(♯‘𝐹))–1-1-onto→dom 𝐼)
1110anbi2i 623 . 2 ((𝐹(Walks‘𝐺)𝑃 ∧ (𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼 ∧ Fun 𝐹)) ↔ (𝐹(Walks‘𝐺)𝑃𝐹:(0..^(♯‘𝐹))–1-1-onto→dom 𝐼))
122, 8, 113bitri 297 1 (𝐹(EulerPaths‘𝐺)𝑃 ↔ (𝐹(Walks‘𝐺)𝑃𝐹:(0..^(♯‘𝐹))–1-1-onto→dom 𝐼))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1537   class class class wbr 5148  ccnv 5688  dom cdm 5689  Fun wfun 6557  ontowfo 6561  1-1-ontowf1o 6562  cfv 6563  (class class class)co 7431  0cc0 11153  ..^cfzo 13691  chash 14366  iEdgciedg 29029  Walkscwlks 29629  Trailsctrls 29723  EulerPathsceupth 30226
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-wlks 29632  df-trls 29725  df-eupth 30227
This theorem is referenced by:  eupthi  30232  upgriseupth  30236  eupth0  30243  eupthres  30244  eupthp1  30245
  Copyright terms: Public domain W3C validator