| 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 15872 | . . . . . 6 ⊢ (𝐺 ∈ 𝑊 → (Vtx‘𝐺) ∈ V) | |
| 5 | 1, 4 | syl 14 | . . . . 5 ⊢ (𝜑 → (Vtx‘𝐺) ∈ V) |
| 6 | 3, 5 | eqeltrid 2318 | . . . 4 ⊢ (𝜑 → 𝑉 ∈ V) |
| 7 | eupthvdres.i | . . . . . 6 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 8 | iedgex 15873 | . . . . . . 7 ⊢ (𝐺 ∈ 𝑊 → (iEdg‘𝐺) ∈ V) | |
| 9 | 1, 8 | syl 14 | . . . . . 6 ⊢ (𝜑 → (iEdg‘𝐺) ∈ V) |
| 10 | 7, 9 | eqeltrid 2318 | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ V) |
| 11 | resexg 5053 | . . . . 5 ⊢ (𝐼 ∈ V → (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) | |
| 12 | 10, 11 | syl 14 | . . . 4 ⊢ (𝜑 → (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) |
| 13 | opexg 4320 | . . . 4 ⊢ ((𝑉 ∈ V ∧ (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) → 〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉 ∈ V) | |
| 14 | 6, 12, 13 | syl2anc 411 | . . 3 ⊢ (𝜑 → 〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉 ∈ V) |
| 15 | 2, 14 | eqeltrid 2318 | . 2 ⊢ (𝜑 → 𝐻 ∈ V) |
| 16 | 2 | fveq2i 5642 | . . . 4 ⊢ (Vtx‘𝐻) = (Vtx‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) |
| 17 | opvtxfv 15876 | . . . . 5 ⊢ ((𝑉 ∈ V ∧ (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) → (Vtx‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) = 𝑉) | |
| 18 | 6, 12, 17 | syl2anc 411 | . . . 4 ⊢ (𝜑 → (Vtx‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) = 𝑉) |
| 19 | 16, 18 | eqtrid 2276 | . . 3 ⊢ (𝜑 → (Vtx‘𝐻) = 𝑉) |
| 20 | 19, 3 | eqtrdi 2280 | . 2 ⊢ (𝜑 → (Vtx‘𝐻) = (Vtx‘𝐺)) |
| 21 | 2 | fveq2i 5642 | . . . . 5 ⊢ (iEdg‘𝐻) = (iEdg‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) |
| 22 | opiedgfv 15879 | . . . . . 6 ⊢ ((𝑉 ∈ V ∧ (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) → (iEdg‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) = (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))) | |
| 23 | 6, 12, 22 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → (iEdg‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) = (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))) |
| 24 | 21, 23 | eqtrid 2276 | . . . 4 ⊢ (𝜑 → (iEdg‘𝐻) = (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))) |
| 25 | eupthvdres.p | . . . . . 6 ⊢ (𝜑 → 𝐹(EulerPaths‘𝐺)𝑃) | |
| 26 | 7 | eupthf1o 16304 | . . . . . 6 ⊢ (𝐹(EulerPaths‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))–1-1-onto→dom 𝐼) |
| 27 | f1ofo 5590 | . . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))–1-1-onto→dom 𝐼 → 𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼) | |
| 28 | foima 5564 | . . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼 → (𝐹 “ (0..^(♯‘𝐹))) = dom 𝐼) | |
| 29 | 25, 26, 27, 28 | 4syl 18 | . . . . 5 ⊢ (𝜑 → (𝐹 “ (0..^(♯‘𝐹))) = dom 𝐼) |
| 30 | 29 | reseq2d 5013 | . . . 4 ⊢ (𝜑 → (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) = (𝐼 ↾ dom 𝐼)) |
| 31 | eupthvdres.f | . . . . . 6 ⊢ (𝜑 → Fun 𝐼) | |
| 32 | 31 | funfnd 5357 | . . . . 5 ⊢ (𝜑 → 𝐼 Fn dom 𝐼) |
| 33 | fnresdm 5441 | . . . . 5 ⊢ (𝐼 Fn dom 𝐼 → (𝐼 ↾ dom 𝐼) = 𝐼) | |
| 34 | 32, 33 | syl 14 | . . . 4 ⊢ (𝜑 → (𝐼 ↾ dom 𝐼) = 𝐼) |
| 35 | 24, 30, 34 | 3eqtrd 2268 | . . 3 ⊢ (𝜑 → (iEdg‘𝐻) = 𝐼) |
| 36 | 35, 7 | eqtrdi 2280 | . 2 ⊢ (𝜑 → (iEdg‘𝐻) = (iEdg‘𝐺)) |
| 37 | 1, 15, 20, 36 | vtxdeqd 16150 | 1 ⊢ (𝜑 → (VtxDeg‘𝐻) = (VtxDeg‘𝐺)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1397 ∈ wcel 2202 Vcvv 2802 〈cop 3672 class class class wbr 4088 dom cdm 4725 ↾ cres 4727 “ cima 4728 Fun wfun 5320 Fn wfn 5321 –onto→wfo 5324 –1-1-onto→wf1o 5325 ‘cfv 5326 (class class class)co 6018 0cc0 8032 ..^cfzo 10377 ♯chash 11038 Vtxcvtx 15866 iEdgciedg 15867 VtxDegcvtxdg 16140 EulerPathsceupth 16296 |
| 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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4204 ax-sep 4207 ax-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-iinf 4686 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-mulcom 8133 ax-addass 8134 ax-mulass 8135 ax-distr 8136 ax-i2m1 8137 ax-0lt1 8138 ax-1rid 8139 ax-0id 8140 ax-rnegex 8141 ax-cnre 8143 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-ifp 986 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-reu 2517 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-if 3606 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-int 3929 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-tr 4188 df-id 4390 df-iord 4463 df-on 4465 df-ilim 4466 df-suc 4468 df-iom 4689 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-f1 5331 df-fo 5332 df-f1o 5333 df-fv 5334 df-riota 5971 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-recs 6471 df-frec 6557 df-1o 6582 df-er 6702 df-map 6819 df-en 6910 df-dom 6911 df-fin 6912 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-sub 8352 df-neg 8353 df-inn 9144 df-2 9202 df-3 9203 df-4 9204 df-5 9205 df-6 9206 df-7 9207 df-8 9208 df-9 9209 df-n0 9403 df-z 9480 df-dec 9612 df-uz 9756 df-fz 10244 df-fzo 10378 df-ihash 11039 df-word 11115 df-ndx 13087 df-slot 13088 df-base 13090 df-edgf 15859 df-vtx 15868 df-iedg 15869 df-vtxdg 16141 df-wlks 16172 df-trls 16235 df-eupth 16297 |
| This theorem is referenced by: eupth2fi 16333 |
| Copyright terms: Public domain | W3C validator |