| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > eupthvdres | GIF version | ||
| Description: 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 | . . 3 ⊢ 𝐻 = 〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉 | |
| 3 | eupthvdres.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 4 | vtxex 16173 | . . . . . 6 ⊢ (𝐺 ∈ 𝑊 → (Vtx‘𝐺) ∈ V) | |
| 5 | 1, 4 | syl 14 | . . . . 5 ⊢ (𝜑 → (Vtx‘𝐺) ∈ V) |
| 6 | 3, 5 | eqeltrid 2325 | . . . 4 ⊢ (𝜑 → 𝑉 ∈ V) |
| 7 | eupthvdres.i | . . . . . 6 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 8 | iedgex 16174 | . . . . . . 7 ⊢ (𝐺 ∈ 𝑊 → (iEdg‘𝐺) ∈ V) | |
| 9 | 1, 8 | syl 14 | . . . . . 6 ⊢ (𝜑 → (iEdg‘𝐺) ∈ V) |
| 10 | 7, 9 | eqeltrid 2325 | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ V) |
| 11 | resexg 5098 | . . . . 5 ⊢ (𝐼 ∈ V → (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) | |
| 12 | 10, 11 | syl 14 | . . . 4 ⊢ (𝜑 → (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) |
| 13 | opexg 4363 | . . . 4 ⊢ ((𝑉 ∈ V ∧ (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) → 〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉 ∈ V) | |
| 14 | 6, 12, 13 | syl2anc 415 | . . 3 ⊢ (𝜑 → 〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉 ∈ V) |
| 15 | 2, 14 | eqeltrid 2325 | . 2 ⊢ (𝜑 → 𝐻 ∈ V) |
| 16 | 2 | fveq2i 5693 | . . . 4 ⊢ (Vtx‘𝐻) = (Vtx‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) |
| 17 | opvtxfv 16177 | . . . . 5 ⊢ ((𝑉 ∈ V ∧ (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) → (Vtx‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) = 𝑉) | |
| 18 | 6, 12, 17 | syl2anc 415 | . . . 4 ⊢ (𝜑 → (Vtx‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) = 𝑉) |
| 19 | 16, 18 | eqtrid 2283 | . . 3 ⊢ (𝜑 → (Vtx‘𝐻) = 𝑉) |
| 20 | 19, 3 | eqtrdi 2287 | . 2 ⊢ (𝜑 → (Vtx‘𝐻) = (Vtx‘𝐺)) |
| 21 | 2 | fveq2i 5693 | . . . . 5 ⊢ (iEdg‘𝐻) = (iEdg‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) |
| 22 | opiedgfv 16180 | . . . . . 6 ⊢ ((𝑉 ∈ V ∧ (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) → (iEdg‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) = (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))) | |
| 23 | 6, 12, 22 | syl2anc 415 | . . . . 5 ⊢ (𝜑 → (iEdg‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) = (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))) |
| 24 | 21, 23 | eqtrid 2283 | . . . 4 ⊢ (𝜑 → (iEdg‘𝐻) = (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))) |
| 25 | eupthvdres.p | . . . . . 6 ⊢ (𝜑 → 𝐹(EulerPaths‘𝐺)𝑃) | |
| 26 | 7 | eupthf1o 16605 | . . . . . 6 ⊢ (𝐹(EulerPaths‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))–1-1-onto→dom 𝐼) |
| 27 | f1ofo 5641 | . . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))–1-1-onto→dom 𝐼 → 𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼) | |
| 28 | foima 5615 | . . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼 → (𝐹 “ (0..^(♯‘𝐹))) = dom 𝐼) | |
| 29 | 25, 26, 27, 28 | 4syl 18 | . . . . 5 ⊢ (𝜑 → (𝐹 “ (0..^(♯‘𝐹))) = dom 𝐼) |
| 30 | 29 | reseq2d 5058 | . . . 4 ⊢ (𝜑 → (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) = (𝐼 ↾ dom 𝐼)) |
| 31 | eupthvdres.f | . . . . . 6 ⊢ (𝜑 → Fun 𝐼) | |
| 32 | 31 | funfnd 5403 | . . . . 5 ⊢ (𝜑 → 𝐼 Fn dom 𝐼) |
| 33 | fnresdm 5487 | . . . . 5 ⊢ (𝐼 Fn dom 𝐼 → (𝐼 ↾ dom 𝐼) = 𝐼) | |
| 34 | 32, 33 | syl 14 | . . . 4 ⊢ (𝜑 → (𝐼 ↾ dom 𝐼) = 𝐼) |
| 35 | 24, 30, 34 | 3eqtrd 2275 | . . 3 ⊢ (𝜑 → (iEdg‘𝐻) = 𝐼) |
| 36 | 35, 7 | eqtrdi 2287 | . 2 ⊢ (𝜑 → (iEdg‘𝐻) = (iEdg‘𝐺)) |
| 37 | 1, 15, 20, 36 | vtxdeqd 16451 | 1 ⊢ (𝜑 → (VtxDeg‘𝐻) = (VtxDeg‘𝐺)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1402 ∈ wcel 2209 Vcvv 2821 〈cop 3708 class class class wbr 4125 dom cdm 4769 ↾ cres 4771 “ cima 4772 Fun wfun 5366 Fn wfn 5367 –onto→wfo 5370 –1-1-onto→wf1o 5371 ‘cfv 5372 (class class class)co 6075 0cc0 8169 ..^cfzo 10527 ♯chash 11192 Vtxcvtx 16167 iEdgciedg 16168 VtxDegcvtxdg 16441 EulerPathsceupth 16597 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4241 ax-sep 4244 ax-nul 4254 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-iinf 4730 ax-cnex 8260 ax-resscn 8261 ax-1cn 8262 ax-1re 8263 ax-icn 8264 ax-addcl 8265 ax-addrcl 8266 ax-mulcl 8267 ax-addcom 8269 ax-mulcom 8270 ax-addass 8271 ax-mulass 8272 ax-distr 8273 ax-i2m1 8274 ax-0lt1 8275 ax-1rid 8276 ax-0id 8277 ax-rnegex 8278 ax-cnre 8280 ax-pre-ltirr 8281 ax-pre-ltwlin 8282 ax-pre-lttrn 8283 ax-pre-apti 8284 ax-pre-ltadd 8285 |
| This theorem depends on definitions: df-bi 117 df-dc 847 df-ifp 991 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3636 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-iun 4009 df-br 4126 df-opab 4188 df-mpt 4189 df-tr 4225 df-id 4433 df-iord 4506 df-on 4508 df-ilim 4509 df-suc 4511 df-iom 4733 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-fv 5380 df-riota 6028 df-ov 6078 df-oprab 6079 df-mpo 6080 df-1st 6364 df-2nd 6365 df-recs 6566 df-frec 6652 df-1o 6677 df-er 6797 df-map 6914 df-en 7013 df-dom 7014 df-fin 7015 df-pnf 8352 df-mnf 8353 df-xr 8354 df-ltxr 8355 df-le 8356 df-sub 8489 df-neg 8490 df-inn 9284 df-2 9342 df-3 9343 df-4 9344 df-5 9345 df-6 9346 df-7 9347 df-8 9348 df-9 9349 df-n0 9543 df-z 9624 df-dec 9757 df-uz 9901 df-fz 10391 df-fzo 10528 df-ihash 11193 df-word 11283 df-ndx 13333 df-slot 13334 df-base 13336 df-edgf 16160 df-vtx 16169 df-iedg 16170 df-vtxdg 16442 df-wlks 16473 df-trls 16536 df-eupth 16598 |
| This theorem is referenced by: eupth2fi 16634 |
| Copyright terms: Public domain | W3C validator |