| 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 30263: 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 5410 | . . . 4 ⊢ 〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉 ∈ V | |
| 4 | 2, 3 | eqeltri 2830 | . . 3 ⊢ 𝐻 ∈ V |
| 5 | 4 | a1i 11 | . 2 ⊢ (𝜑 → 𝐻 ∈ V) |
| 6 | 2 | fveq2i 6835 | . . . 4 ⊢ (Vtx‘𝐻) = (Vtx‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) |
| 7 | eupthvdres.v | . . . . . . . 8 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 8 | 7 | fvexi 6846 | . . . . . . 7 ⊢ 𝑉 ∈ V |
| 9 | eupthvdres.i | . . . . . . . . 9 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 10 | 9 | fvexi 6846 | . . . . . . . 8 ⊢ 𝐼 ∈ V |
| 11 | 10 | resex 5986 | . . . . . . 7 ⊢ (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V |
| 12 | 8, 11 | pm3.2i 470 | . . . . . 6 ⊢ (𝑉 ∈ V ∧ (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) |
| 13 | 12 | a1i 11 | . . . . 5 ⊢ (𝜑 → (𝑉 ∈ V ∧ (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V)) |
| 14 | opvtxfv 29026 | . . . . 5 ⊢ ((𝑉 ∈ V ∧ (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) → (Vtx‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) = 𝑉) | |
| 15 | 13, 14 | syl 17 | . . . 4 ⊢ (𝜑 → (Vtx‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) = 𝑉) |
| 16 | 6, 15 | eqtrid 2781 | . . 3 ⊢ (𝜑 → (Vtx‘𝐻) = 𝑉) |
| 17 | 16, 7 | eqtrdi 2785 | . 2 ⊢ (𝜑 → (Vtx‘𝐻) = (Vtx‘𝐺)) |
| 18 | 2 | fveq2i 6835 | . . . . 5 ⊢ (iEdg‘𝐻) = (iEdg‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) |
| 19 | opiedgfv 29029 | . . . . . 6 ⊢ ((𝑉 ∈ V ∧ (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) → (iEdg‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) = (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))) | |
| 20 | 13, 19 | syl 17 | . . . . 5 ⊢ (𝜑 → (iEdg‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) = (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))) |
| 21 | 18, 20 | eqtrid 2781 | . . . 4 ⊢ (𝜑 → (iEdg‘𝐻) = (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))) |
| 22 | eupthvdres.p | . . . . . 6 ⊢ (𝜑 → 𝐹(EulerPaths‘𝐺)𝑃) | |
| 23 | 9 | eupthf1o 30228 | . . . . . 6 ⊢ (𝐹(EulerPaths‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))–1-1-onto→dom 𝐼) |
| 24 | f1ofo 6779 | . . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))–1-1-onto→dom 𝐼 → 𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼) | |
| 25 | foima 6749 | . . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼 → (𝐹 “ (0..^(♯‘𝐹))) = dom 𝐼) | |
| 26 | 22, 23, 24, 25 | 4syl 19 | . . . . 5 ⊢ (𝜑 → (𝐹 “ (0..^(♯‘𝐹))) = dom 𝐼) |
| 27 | 26 | reseq2d 5936 | . . . 4 ⊢ (𝜑 → (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) = (𝐼 ↾ dom 𝐼)) |
| 28 | eupthvdres.f | . . . . . 6 ⊢ (𝜑 → Fun 𝐼) | |
| 29 | 28 | funfnd 6521 | . . . . 5 ⊢ (𝜑 → 𝐼 Fn dom 𝐼) |
| 30 | fnresdm 6609 | . . . . 5 ⊢ (𝐼 Fn dom 𝐼 → (𝐼 ↾ dom 𝐼) = 𝐼) | |
| 31 | 29, 30 | syl 17 | . . . 4 ⊢ (𝜑 → (𝐼 ↾ dom 𝐼) = 𝐼) |
| 32 | 21, 27, 31 | 3eqtrd 2773 | . . 3 ⊢ (𝜑 → (iEdg‘𝐻) = 𝐼) |
| 33 | 32, 9 | eqtrdi 2785 | . 2 ⊢ (𝜑 → (iEdg‘𝐻) = (iEdg‘𝐺)) |
| 34 | 1, 5, 17, 33 | vtxdeqd 29500 | 1 ⊢ (𝜑 → (VtxDeg‘𝐻) = (VtxDeg‘𝐺)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 Vcvv 3438 〈cop 4584 class class class wbr 5096 dom cdm 5622 ↾ cres 5624 “ cima 5625 Fun wfun 6484 Fn wfn 6485 –onto→wfo 6488 –1-1-onto→wf1o 6489 ‘cfv 6490 (class class class)co 7356 0cc0 11024 ..^cfzo 13568 ♯chash 14251 Vtxcvtx 29018 iEdgciedg 29019 VtxDegcvtxdg 29488 EulerPathsceupth 30221 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pr 5375 ax-un 7678 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-ov 7359 df-1st 7931 df-2nd 7932 df-vtx 29020 df-iedg 29021 df-vtxdg 29489 df-wlks 29622 df-trls 29713 df-eupth 30222 |
| This theorem is referenced by: eupth2 30263 |
| Copyright terms: Public domain | W3C validator |