Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > trlsegvdeg | Structured version Visualization version GIF version |
Description: Formerly part of proof of eupth2lem3 28015: If a trail in a graph 𝐺 induces a subgraph 𝑍 with the vertices 𝑉 of 𝐺 and the edges being the edges of the walk, and a subgraph 𝑋 with the vertices 𝑉 of 𝐺 and the edges being the edges of the walk except the last one, and a subgraph 𝑌 with the vertices 𝑉 of 𝐺 and one edges being the last edge of the walk, then the vertex degree of any vertex 𝑈 of 𝐺 within 𝑍 is the sum of the vertex degree of 𝑈 within 𝑋 and the vertex degree of 𝑈 within 𝑌. Note that this theorem would not hold for arbitrary walks (if the last edge was identical with a previous edge, the degree of the vertices incident with this edge would not be increased because of this edge). (Contributed by Mario Carneiro, 8-Apr-2015.) (Revised by AV, 20-Feb-2021.) |
Ref | Expression |
---|---|
trlsegvdeg.v | ⊢ 𝑉 = (Vtx‘𝐺) |
trlsegvdeg.i | ⊢ 𝐼 = (iEdg‘𝐺) |
trlsegvdeg.f | ⊢ (𝜑 → Fun 𝐼) |
trlsegvdeg.n | ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹))) |
trlsegvdeg.u | ⊢ (𝜑 → 𝑈 ∈ 𝑉) |
trlsegvdeg.w | ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) |
trlsegvdeg.vx | ⊢ (𝜑 → (Vtx‘𝑋) = 𝑉) |
trlsegvdeg.vy | ⊢ (𝜑 → (Vtx‘𝑌) = 𝑉) |
trlsegvdeg.vz | ⊢ (𝜑 → (Vtx‘𝑍) = 𝑉) |
trlsegvdeg.ix | ⊢ (𝜑 → (iEdg‘𝑋) = (𝐼 ↾ (𝐹 “ (0..^𝑁)))) |
trlsegvdeg.iy | ⊢ (𝜑 → (iEdg‘𝑌) = {〈(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))〉}) |
trlsegvdeg.iz | ⊢ (𝜑 → (iEdg‘𝑍) = (𝐼 ↾ (𝐹 “ (0...𝑁)))) |
Ref | Expression |
---|---|
trlsegvdeg | ⊢ (𝜑 → ((VtxDeg‘𝑍)‘𝑈) = (((VtxDeg‘𝑋)‘𝑈) + ((VtxDeg‘𝑌)‘𝑈))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2821 | . 2 ⊢ (iEdg‘𝑋) = (iEdg‘𝑋) | |
2 | eqid 2821 | . 2 ⊢ (iEdg‘𝑌) = (iEdg‘𝑌) | |
3 | eqid 2821 | . 2 ⊢ (Vtx‘𝑋) = (Vtx‘𝑋) | |
4 | trlsegvdeg.vy | . . 3 ⊢ (𝜑 → (Vtx‘𝑌) = 𝑉) | |
5 | trlsegvdeg.vx | . . 3 ⊢ (𝜑 → (Vtx‘𝑋) = 𝑉) | |
6 | 4, 5 | eqtr4d 2859 | . 2 ⊢ (𝜑 → (Vtx‘𝑌) = (Vtx‘𝑋)) |
7 | trlsegvdeg.vz | . . 3 ⊢ (𝜑 → (Vtx‘𝑍) = 𝑉) | |
8 | 7, 5 | eqtr4d 2859 | . 2 ⊢ (𝜑 → (Vtx‘𝑍) = (Vtx‘𝑋)) |
9 | trlsegvdeg.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
10 | trlsegvdeg.i | . . . . 5 ⊢ 𝐼 = (iEdg‘𝐺) | |
11 | trlsegvdeg.f | . . . . 5 ⊢ (𝜑 → Fun 𝐼) | |
12 | trlsegvdeg.n | . . . . 5 ⊢ (𝜑 → 𝑁 ∈ (0..^(♯‘𝐹))) | |
13 | trlsegvdeg.u | . . . . 5 ⊢ (𝜑 → 𝑈 ∈ 𝑉) | |
14 | trlsegvdeg.w | . . . . 5 ⊢ (𝜑 → 𝐹(Trails‘𝐺)𝑃) | |
15 | trlsegvdeg.ix | . . . . 5 ⊢ (𝜑 → (iEdg‘𝑋) = (𝐼 ↾ (𝐹 “ (0..^𝑁)))) | |
16 | trlsegvdeg.iy | . . . . 5 ⊢ (𝜑 → (iEdg‘𝑌) = {〈(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))〉}) | |
17 | trlsegvdeg.iz | . . . . 5 ⊢ (𝜑 → (iEdg‘𝑍) = (𝐼 ↾ (𝐹 “ (0...𝑁)))) | |
18 | 9, 10, 11, 12, 13, 14, 5, 4, 7, 15, 16, 17 | trlsegvdeglem4 28002 | . . . 4 ⊢ (𝜑 → dom (iEdg‘𝑋) = ((𝐹 “ (0..^𝑁)) ∩ dom 𝐼)) |
19 | 9, 10, 11, 12, 13, 14, 5, 4, 7, 15, 16, 17 | trlsegvdeglem5 28003 | . . . 4 ⊢ (𝜑 → dom (iEdg‘𝑌) = {(𝐹‘𝑁)}) |
20 | 18, 19 | ineq12d 4190 | . . 3 ⊢ (𝜑 → (dom (iEdg‘𝑋) ∩ dom (iEdg‘𝑌)) = (((𝐹 “ (0..^𝑁)) ∩ dom 𝐼) ∩ {(𝐹‘𝑁)})) |
21 | fzonel 13052 | . . . . . . 7 ⊢ ¬ 𝑁 ∈ (0..^𝑁) | |
22 | 10 | trlf1 27480 | . . . . . . . . 9 ⊢ (𝐹(Trails‘𝐺)𝑃 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
23 | 14, 22 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼) |
24 | elfzouz2 13053 | . . . . . . . . 9 ⊢ (𝑁 ∈ (0..^(♯‘𝐹)) → (♯‘𝐹) ∈ (ℤ≥‘𝑁)) | |
25 | fzoss2 13066 | . . . . . . . . 9 ⊢ ((♯‘𝐹) ∈ (ℤ≥‘𝑁) → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) | |
26 | 12, 24, 25 | 3syl 18 | . . . . . . . 8 ⊢ (𝜑 → (0..^𝑁) ⊆ (0..^(♯‘𝐹))) |
27 | f1elima 7021 | . . . . . . . 8 ⊢ ((𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 ∧ 𝑁 ∈ (0..^(♯‘𝐹)) ∧ (0..^𝑁) ⊆ (0..^(♯‘𝐹))) → ((𝐹‘𝑁) ∈ (𝐹 “ (0..^𝑁)) ↔ 𝑁 ∈ (0..^𝑁))) | |
28 | 23, 12, 26, 27 | syl3anc 1367 | . . . . . . 7 ⊢ (𝜑 → ((𝐹‘𝑁) ∈ (𝐹 “ (0..^𝑁)) ↔ 𝑁 ∈ (0..^𝑁))) |
29 | 21, 28 | mtbiri 329 | . . . . . 6 ⊢ (𝜑 → ¬ (𝐹‘𝑁) ∈ (𝐹 “ (0..^𝑁))) |
30 | 29 | orcd 869 | . . . . 5 ⊢ (𝜑 → (¬ (𝐹‘𝑁) ∈ (𝐹 “ (0..^𝑁)) ∨ ¬ (𝐹‘𝑁) ∈ dom 𝐼)) |
31 | ianor 978 | . . . . . 6 ⊢ (¬ ((𝐹‘𝑁) ∈ (𝐹 “ (0..^𝑁)) ∧ (𝐹‘𝑁) ∈ dom 𝐼) ↔ (¬ (𝐹‘𝑁) ∈ (𝐹 “ (0..^𝑁)) ∨ ¬ (𝐹‘𝑁) ∈ dom 𝐼)) | |
32 | elin 4169 | . . . . . 6 ⊢ ((𝐹‘𝑁) ∈ ((𝐹 “ (0..^𝑁)) ∩ dom 𝐼) ↔ ((𝐹‘𝑁) ∈ (𝐹 “ (0..^𝑁)) ∧ (𝐹‘𝑁) ∈ dom 𝐼)) | |
33 | 31, 32 | xchnxbir 335 | . . . . 5 ⊢ (¬ (𝐹‘𝑁) ∈ ((𝐹 “ (0..^𝑁)) ∩ dom 𝐼) ↔ (¬ (𝐹‘𝑁) ∈ (𝐹 “ (0..^𝑁)) ∨ ¬ (𝐹‘𝑁) ∈ dom 𝐼)) |
34 | 30, 33 | sylibr 236 | . . . 4 ⊢ (𝜑 → ¬ (𝐹‘𝑁) ∈ ((𝐹 “ (0..^𝑁)) ∩ dom 𝐼)) |
35 | disjsn 4647 | . . . 4 ⊢ ((((𝐹 “ (0..^𝑁)) ∩ dom 𝐼) ∩ {(𝐹‘𝑁)}) = ∅ ↔ ¬ (𝐹‘𝑁) ∈ ((𝐹 “ (0..^𝑁)) ∩ dom 𝐼)) | |
36 | 34, 35 | sylibr 236 | . . 3 ⊢ (𝜑 → (((𝐹 “ (0..^𝑁)) ∩ dom 𝐼) ∩ {(𝐹‘𝑁)}) = ∅) |
37 | 20, 36 | eqtrd 2856 | . 2 ⊢ (𝜑 → (dom (iEdg‘𝑋) ∩ dom (iEdg‘𝑌)) = ∅) |
38 | 9, 10, 11, 12, 13, 14, 5, 4, 7, 15, 16, 17 | trlsegvdeglem2 28000 | . 2 ⊢ (𝜑 → Fun (iEdg‘𝑋)) |
39 | 9, 10, 11, 12, 13, 14, 5, 4, 7, 15, 16, 17 | trlsegvdeglem3 28001 | . 2 ⊢ (𝜑 → Fun (iEdg‘𝑌)) |
40 | 13, 5 | eleqtrrd 2916 | . 2 ⊢ (𝜑 → 𝑈 ∈ (Vtx‘𝑋)) |
41 | f1f 6575 | . . . . 5 ⊢ (𝐹:(0..^(♯‘𝐹))–1-1→dom 𝐼 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) | |
42 | 14, 22, 41 | 3syl 18 | . . . 4 ⊢ (𝜑 → 𝐹:(0..^(♯‘𝐹))⟶dom 𝐼) |
43 | 11, 42, 12 | resunimafz0 13804 | . . 3 ⊢ (𝜑 → (𝐼 ↾ (𝐹 “ (0...𝑁))) = ((𝐼 ↾ (𝐹 “ (0..^𝑁))) ∪ {〈(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))〉})) |
44 | 15, 16 | uneq12d 4140 | . . 3 ⊢ (𝜑 → ((iEdg‘𝑋) ∪ (iEdg‘𝑌)) = ((𝐼 ↾ (𝐹 “ (0..^𝑁))) ∪ {〈(𝐹‘𝑁), (𝐼‘(𝐹‘𝑁))〉})) |
45 | 43, 17, 44 | 3eqtr4d 2866 | . 2 ⊢ (𝜑 → (iEdg‘𝑍) = ((iEdg‘𝑋) ∪ (iEdg‘𝑌))) |
46 | 9, 10, 11, 12, 13, 14, 5, 4, 7, 15, 16, 17 | trlsegvdeglem6 28004 | . 2 ⊢ (𝜑 → dom (iEdg‘𝑋) ∈ Fin) |
47 | 9, 10, 11, 12, 13, 14, 5, 4, 7, 15, 16, 17 | trlsegvdeglem7 28005 | . 2 ⊢ (𝜑 → dom (iEdg‘𝑌) ∈ Fin) |
48 | 1, 2, 3, 6, 8, 37, 38, 39, 40, 45, 46, 47 | vtxdfiun 27264 | 1 ⊢ (𝜑 → ((VtxDeg‘𝑍)‘𝑈) = (((VtxDeg‘𝑋)‘𝑈) + ((VtxDeg‘𝑌)‘𝑈))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∨ wo 843 = wceq 1537 ∈ wcel 2114 ∪ cun 3934 ∩ cin 3935 ⊆ wss 3936 ∅c0 4291 {csn 4567 〈cop 4573 class class class wbr 5066 dom cdm 5555 ↾ cres 5557 “ cima 5558 Fun wfun 6349 ⟶wf 6351 –1-1→wf1 6352 ‘cfv 6355 (class class class)co 7156 0cc0 10537 + caddc 10540 ℤ≥cuz 12244 ...cfz 12893 ..^cfzo 13034 ♯chash 13691 Vtxcvtx 26781 iEdgciedg 26782 VtxDegcvtxdg 27247 Trailsctrls 27472 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-ifp 1058 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-int 4877 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-1o 8102 df-oadd 8106 df-er 8289 df-map 8408 df-en 8510 df-dom 8511 df-sdom 8512 df-fin 8513 df-dju 9330 df-card 9368 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-n0 11899 df-xnn0 11969 df-z 11983 df-uz 12245 df-xadd 12509 df-fz 12894 df-fzo 13035 df-hash 13692 df-word 13863 df-vtxdg 27248 df-wlks 27381 df-trls 27474 |
This theorem is referenced by: eupth2lem3lem7 28013 |
Copyright terms: Public domain | W3C validator |