| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eupthvdres | Structured version Visualization version GIF version | ||
| Description: Formerly part of proof of eupth2 30443: The vertex degree remains the same for all vertices if the edges are restricted to the edges of an Eulerian path. (Contributed by Mario Carneiro, 8-Apr-2015.) (Revised by AV, 26-Feb-2021.) |
| Ref | Expression |
|---|---|
| eupthvdres.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| eupthvdres.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| eupthvdres.g | ⊢ (𝜑 → 𝐺 ∈ 𝑊) |
| eupthvdres.f | ⊢ (𝜑 → Fun 𝐼) |
| eupthvdres.p | ⊢ (𝜑 → 𝐹(EulerPaths‘𝐺)𝑃) |
| eupthvdres.h | ⊢ 𝐻 = 〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉 |
| Ref | Expression |
|---|---|
| eupthvdres | ⊢ (𝜑 → (VtxDeg‘𝐻) = (VtxDeg‘𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eupthvdres.g | . 2 ⊢ (𝜑 → 𝐺 ∈ 𝑊) | |
| 2 | eupthvdres.h | . . . 4 ⊢ 𝐻 = 〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉 | |
| 3 | opex 5433 | . . . 4 ⊢ 〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉 ∈ V | |
| 4 | 2, 3 | eqeltri 2860 | . . 3 ⊢ 𝐻 ∈ V |
| 5 | 4 | a1i 11 | . 2 ⊢ (𝜑 → 𝐻 ∈ V) |
| 6 | 2 | fveq2i 6872 | . . . 4 ⊢ (Vtx‘𝐻) = (Vtx‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) |
| 7 | eupthvdres.v | . . . . . . . 8 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 8 | 7 | fvexi 6883 | . . . . . . 7 ⊢ 𝑉 ∈ V |
| 9 | eupthvdres.i | . . . . . . . . 9 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 10 | 9 | fvexi 6883 | . . . . . . . 8 ⊢ 𝐼 ∈ V |
| 11 | 10 | resex 6017 | . . . . . . 7 ⊢ (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V |
| 12 | 8, 11 | pm3.2i 474 | . . . . . 6 ⊢ (𝑉 ∈ V ∧ (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) |
| 13 | 12 | a1i 11 | . . . . 5 ⊢ (𝜑 → (𝑉 ∈ V ∧ (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V)) |
| 14 | opvtxfv 29207 | . . . . 5 ⊢ ((𝑉 ∈ V ∧ (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) → (Vtx‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) = 𝑉) | |
| 15 | 13, 14 | syl 17 | . . . 4 ⊢ (𝜑 → (Vtx‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) = 𝑉) |
| 16 | 6, 15 | eqtrid 2811 | . . 3 ⊢ (𝜑 → (Vtx‘𝐻) = 𝑉) |
| 17 | 16, 7 | eqtrdi 2815 | . 2 ⊢ (𝜑 → (Vtx‘𝐻) = (Vtx‘𝐺)) |
| 18 | 2 | fveq2i 6872 | . . . . 5 ⊢ (iEdg‘𝐻) = (iEdg‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) |
| 19 | opiedgfv 29210 | . . . . . 6 ⊢ ((𝑉 ∈ V ∧ (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) → (iEdg‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) = (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))) | |
| 20 | 13, 19 | syl 17 | . . . . 5 ⊢ (𝜑 → (iEdg‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) = (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))) |
| 21 | 18, 20 | eqtrid 2811 | . . . 4 ⊢ (𝜑 → (iEdg‘𝐻) = (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))) |
| 22 | eupthvdres.p | . . . . . 6 ⊢ (𝜑 → 𝐹(EulerPaths‘𝐺)𝑃) | |
| 23 | 9 | eupthf1o 30408 | . . . . . 6 ⊢ (𝐹(EulerPaths‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))–1-1-onto→dom 𝐼) |
| 24 | f1ofo 6816 | . . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))–1-1-onto→dom 𝐼 → 𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼) | |
| 25 | foima 6785 | . . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼 → (𝐹 “ (0..^(♯‘𝐹))) = dom 𝐼) | |
| 26 | 22, 23, 24, 25 | 4syl 19 | . . . . 5 ⊢ (𝜑 → (𝐹 “ (0..^(♯‘𝐹))) = dom 𝐼) |
| 27 | 26 | reseq2d 5967 | . . . 4 ⊢ (𝜑 → (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) = (𝐼 ↾ dom 𝐼)) |
| 28 | eupthvdres.f | . . . . . 6 ⊢ (𝜑 → Fun 𝐼) | |
| 29 | 28 | funfnd 6554 | . . . . 5 ⊢ (𝜑 → 𝐼 Fn dom 𝐼) |
| 30 | fnresdm 6642 | . . . . 5 ⊢ (𝐼 Fn dom 𝐼 → (𝐼 ↾ dom 𝐼) = 𝐼) | |
| 31 | 29, 30 | syl 17 | . . . 4 ⊢ (𝜑 → (𝐼 ↾ dom 𝐼) = 𝐼) |
| 32 | 21, 27, 31 | 3eqtrd 2803 | . . 3 ⊢ (𝜑 → (iEdg‘𝐻) = 𝐼) |
| 33 | 32, 9 | eqtrdi 2815 | . 2 ⊢ (𝜑 → (iEdg‘𝐻) = (iEdg‘𝐺)) |
| 34 | 1, 5, 17, 33 | vtxdeqd 29680 | 1 ⊢ (𝜑 → (VtxDeg‘𝐻) = (VtxDeg‘𝐺)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1562 ∈ wcel 2144 Vcvv 3456 〈cop 4590 class class class wbr 5102 dom cdm 5649 ↾ cres 5651 “ cima 5652 Fun wfun 6517 Fn wfn 6518 –onto→wfo 6521 –1-1-onto→wf1o 6522 ‘cfv 6523 (class class class)co 7398 0cc0 11075 ..^cfzo 13661 ♯chash 14345 Vtxcvtx 29199 iEdgciedg 29200 VtxDegcvtxdg 29668 EulerPathsceupth 30401 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-rep 5229 ax-sep 5248 ax-nul 5258 ax-pr 5392 ax-un 7720 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3079 df-rex 3089 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5544 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-ov 7401 df-1st 7972 df-2nd 7973 df-vtx 29201 df-iedg 29202 df-vtxdg 29669 df-wlks 29802 df-trls 29893 df-eupth 30402 |
| This theorem is referenced by: eupth2 30443 |
| Copyright terms: Public domain | W3C validator |