| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eupths | Structured version Visualization version GIF version | ||
| Description: The Eulerian paths on the graph 𝐺. (Contributed by AV, 18-Feb-2021.) (Revised by AV, 29-Oct-2021.) |
| Ref | Expression |
|---|---|
| eupths.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| Ref | Expression |
|---|---|
| eupths | ⊢ (EulerPaths‘𝐺) = {〈𝑓, 𝑝〉 ∣ (𝑓(Trails‘𝐺)𝑝 ∧ 𝑓:(0..^(♯‘𝑓))–onto→dom 𝐼)} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 6842 | . . . . 5 ⊢ (𝑔 = 𝐺 → (iEdg‘𝑔) = (iEdg‘𝐺)) | |
| 2 | eupths.i | . . . . 5 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 3 | 1, 2 | eqtr4di 2790 | . . . 4 ⊢ (𝑔 = 𝐺 → (iEdg‘𝑔) = 𝐼) |
| 4 | 3 | dmeqd 5862 | . . 3 ⊢ (𝑔 = 𝐺 → dom (iEdg‘𝑔) = dom 𝐼) |
| 5 | foeq3 6752 | . . 3 ⊢ (dom (iEdg‘𝑔) = dom 𝐼 → (𝑓:(0..^(♯‘𝑓))–onto→dom (iEdg‘𝑔) ↔ 𝑓:(0..^(♯‘𝑓))–onto→dom 𝐼)) | |
| 6 | 4, 5 | syl 17 | . 2 ⊢ (𝑔 = 𝐺 → (𝑓:(0..^(♯‘𝑓))–onto→dom (iEdg‘𝑔) ↔ 𝑓:(0..^(♯‘𝑓))–onto→dom 𝐼)) |
| 7 | df-eupth 30285 | . 2 ⊢ EulerPaths = (𝑔 ∈ V ↦ {〈𝑓, 𝑝〉 ∣ (𝑓(Trails‘𝑔)𝑝 ∧ 𝑓:(0..^(♯‘𝑓))–onto→dom (iEdg‘𝑔))}) | |
| 8 | 6, 7 | fvmptopab 7423 | 1 ⊢ (EulerPaths‘𝐺) = {〈𝑓, 𝑝〉 ∣ (𝑓(Trails‘𝐺)𝑝 ∧ 𝑓:(0..^(♯‘𝑓))–onto→dom 𝐼)} |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1542 class class class wbr 5100 {copab 5162 dom cdm 5632 –onto→wfo 6498 ‘cfv 6500 (class class class)co 7368 0cc0 11038 ..^cfzo 13582 ♯chash 14265 iEdgciedg 29082 Trailsctrls 29774 EulerPathsceupth 30284 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pr 5379 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-iota 6456 df-fun 6502 df-fo 6506 df-fv 6508 df-eupth 30285 |
| This theorem is referenced by: iseupth 30288 |
| Copyright terms: Public domain | W3C validator |