| 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 16030 | . . . . . 6 ⊢ (𝐺 ∈ 𝑊 → (Vtx‘𝐺) ∈ V) | |
| 5 | 1, 4 | syl 14 | . . . . 5 ⊢ (𝜑 → (Vtx‘𝐺) ∈ V) |
| 6 | 3, 5 | eqeltrid 2321 | . . . 4 ⊢ (𝜑 → 𝑉 ∈ V) |
| 7 | eupthvdres.i | . . . . . 6 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 8 | iedgex 16031 | . . . . . . 7 ⊢ (𝐺 ∈ 𝑊 → (iEdg‘𝐺) ∈ V) | |
| 9 | 1, 8 | syl 14 | . . . . . 6 ⊢ (𝜑 → (iEdg‘𝐺) ∈ V) |
| 10 | 7, 9 | eqeltrid 2321 | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ V) |
| 11 | resexg 5080 | . . . . 5 ⊢ (𝐼 ∈ V → (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) | |
| 12 | 10, 11 | syl 14 | . . . 4 ⊢ (𝜑 → (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) |
| 13 | opexg 4346 | . . . 4 ⊢ ((𝑉 ∈ V ∧ (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) → 〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉 ∈ V) | |
| 14 | 6, 12, 13 | syl2anc 411 | . . 3 ⊢ (𝜑 → 〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉 ∈ V) |
| 15 | 2, 14 | eqeltrid 2321 | . 2 ⊢ (𝜑 → 𝐻 ∈ V) |
| 16 | 2 | fveq2i 5675 | . . . 4 ⊢ (Vtx‘𝐻) = (Vtx‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) |
| 17 | opvtxfv 16034 | . . . . 5 ⊢ ((𝑉 ∈ V ∧ (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) → (Vtx‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) = 𝑉) | |
| 18 | 6, 12, 17 | syl2anc 411 | . . . 4 ⊢ (𝜑 → (Vtx‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) = 𝑉) |
| 19 | 16, 18 | eqtrid 2279 | . . 3 ⊢ (𝜑 → (Vtx‘𝐻) = 𝑉) |
| 20 | 19, 3 | eqtrdi 2283 | . 2 ⊢ (𝜑 → (Vtx‘𝐻) = (Vtx‘𝐺)) |
| 21 | 2 | fveq2i 5675 | . . . . 5 ⊢ (iEdg‘𝐻) = (iEdg‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) |
| 22 | opiedgfv 16037 | . . . . . 6 ⊢ ((𝑉 ∈ V ∧ (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) ∈ V) → (iEdg‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) = (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))) | |
| 23 | 6, 12, 22 | syl2anc 411 | . . . . 5 ⊢ (𝜑 → (iEdg‘〈𝑉, (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))〉) = (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))) |
| 24 | 21, 23 | eqtrid 2279 | . . . 4 ⊢ (𝜑 → (iEdg‘𝐻) = (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹))))) |
| 25 | eupthvdres.p | . . . . . 6 ⊢ (𝜑 → 𝐹(EulerPaths‘𝐺)𝑃) | |
| 26 | 7 | eupthf1o 16462 | . . . . . 6 ⊢ (𝐹(EulerPaths‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))–1-1-onto→dom 𝐼) |
| 27 | f1ofo 5623 | . . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))–1-1-onto→dom 𝐼 → 𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼) | |
| 28 | foima 5597 | . . . . . 6 ⊢ (𝐹:(0..^(♯‘𝐹))–onto→dom 𝐼 → (𝐹 “ (0..^(♯‘𝐹))) = dom 𝐼) | |
| 29 | 25, 26, 27, 28 | 4syl 18 | . . . . 5 ⊢ (𝜑 → (𝐹 “ (0..^(♯‘𝐹))) = dom 𝐼) |
| 30 | 29 | reseq2d 5040 | . . . 4 ⊢ (𝜑 → (𝐼 ↾ (𝐹 “ (0..^(♯‘𝐹)))) = (𝐼 ↾ dom 𝐼)) |
| 31 | eupthvdres.f | . . . . . 6 ⊢ (𝜑 → Fun 𝐼) | |
| 32 | 31 | funfnd 5385 | . . . . 5 ⊢ (𝜑 → 𝐼 Fn dom 𝐼) |
| 33 | fnresdm 5469 | . . . . 5 ⊢ (𝐼 Fn dom 𝐼 → (𝐼 ↾ dom 𝐼) = 𝐼) | |
| 34 | 32, 33 | syl 14 | . . . 4 ⊢ (𝜑 → (𝐼 ↾ dom 𝐼) = 𝐼) |
| 35 | 24, 30, 34 | 3eqtrd 2271 | . . 3 ⊢ (𝜑 → (iEdg‘𝐻) = 𝐼) |
| 36 | 35, 7 | eqtrdi 2283 | . 2 ⊢ (𝜑 → (iEdg‘𝐻) = (iEdg‘𝐺)) |
| 37 | 1, 15, 20, 36 | vtxdeqd 16308 | 1 ⊢ (𝜑 → (VtxDeg‘𝐻) = (VtxDeg‘𝐺)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2205 Vcvv 2815 〈cop 3694 class class class wbr 4111 dom cdm 4751 ↾ cres 4753 “ cima 4754 Fun wfun 5348 Fn wfn 5349 –onto→wfo 5352 –1-1-onto→wf1o 5353 ‘cfv 5354 (class class class)co 6052 0cc0 8129 ..^cfzo 10480 ♯chash 11142 Vtxcvtx 16024 iEdgciedg 16025 VtxDegcvtxdg 16298 EulerPathsceupth 16454 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4227 ax-sep 4230 ax-nul 4238 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-setind 4661 ax-iinf 4712 ax-cnex 8220 ax-resscn 8221 ax-1cn 8222 ax-1re 8223 ax-icn 8224 ax-addcl 8225 ax-addrcl 8226 ax-mulcl 8227 ax-addcom 8229 ax-mulcom 8230 ax-addass 8231 ax-mulass 8232 ax-distr 8233 ax-i2m1 8234 ax-0lt1 8235 ax-1rid 8236 ax-0id 8237 ax-rnegex 8238 ax-cnre 8240 ax-pre-ltirr 8241 ax-pre-ltwlin 8242 ax-pre-lttrn 8243 ax-pre-apti 8244 ax-pre-ltadd 8245 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-ifp 987 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3045 df-csb 3141 df-dif 3215 df-un 3217 df-in 3219 df-ss 3226 df-nul 3511 df-if 3623 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-iun 3995 df-br 4112 df-opab 4174 df-mpt 4175 df-tr 4211 df-id 4416 df-iord 4489 df-on 4491 df-ilim 4492 df-suc 4494 df-iom 4715 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-f1 5359 df-fo 5360 df-f1o 5361 df-fv 5362 df-riota 6005 df-ov 6055 df-oprab 6056 df-mpo 6057 df-1st 6336 df-2nd 6337 df-recs 6538 df-frec 6624 df-1o 6649 df-er 6769 df-map 6886 df-en 6978 df-dom 6979 df-fin 6980 df-pnf 8312 df-mnf 8313 df-xr 8314 df-ltxr 8315 df-le 8316 df-sub 8448 df-neg 8449 df-inn 9240 df-2 9298 df-3 9299 df-4 9300 df-5 9301 df-6 9302 df-7 9303 df-8 9304 df-9 9305 df-n0 9499 df-z 9580 df-dec 9713 df-uz 9857 df-fz 10346 df-fzo 10481 df-ihash 11143 df-word 11229 df-ndx 13232 df-slot 13233 df-base 13235 df-edgf 16017 df-vtx 16026 df-iedg 16027 df-vtxdg 16299 df-wlks 16330 df-trls 16393 df-eupth 16455 |
| This theorem is referenced by: eupth2fi 16491 |
| Copyright terms: Public domain | W3C validator |