Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > finsumvtxdg2ssteplem2 | Structured version Visualization version GIF version |
Description: Lemma for finsumvtxdg2sstep 28052. (Contributed by AV, 12-Dec-2021.) |
Ref | Expression |
---|---|
finsumvtxdg2sstep.v | ⊢ 𝑉 = (Vtx‘𝐺) |
finsumvtxdg2sstep.e | ⊢ 𝐸 = (iEdg‘𝐺) |
finsumvtxdg2sstep.k | ⊢ 𝐾 = (𝑉 ∖ {𝑁}) |
finsumvtxdg2sstep.i | ⊢ 𝐼 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∉ (𝐸‘𝑖)} |
finsumvtxdg2sstep.p | ⊢ 𝑃 = (𝐸 ↾ 𝐼) |
finsumvtxdg2sstep.s | ⊢ 𝑆 = 〈𝐾, 𝑃〉 |
finsumvtxdg2ssteplem.j | ⊢ 𝐽 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)} |
Ref | Expression |
---|---|
finsumvtxdg2ssteplem2 | ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → ((VtxDeg‘𝐺)‘𝑁) = ((♯‘𝐽) + (♯‘{𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}}))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dmfi 9174 | . . . 4 ⊢ (𝐸 ∈ Fin → dom 𝐸 ∈ Fin) | |
2 | 1 | adantl 482 | . . 3 ⊢ ((𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) → dom 𝐸 ∈ Fin) |
3 | simpr 485 | . . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → 𝑁 ∈ 𝑉) | |
4 | finsumvtxdg2sstep.v | . . . 4 ⊢ 𝑉 = (Vtx‘𝐺) | |
5 | finsumvtxdg2sstep.e | . . . 4 ⊢ 𝐸 = (iEdg‘𝐺) | |
6 | eqid 2737 | . . . 4 ⊢ dom 𝐸 = dom 𝐸 | |
7 | 4, 5, 6 | vtxdgfival 27972 | . . 3 ⊢ ((dom 𝐸 ∈ Fin ∧ 𝑁 ∈ 𝑉) → ((VtxDeg‘𝐺)‘𝑁) = ((♯‘{𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)}) + (♯‘{𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}}))) |
8 | 2, 3, 7 | syl2anr 597 | . 2 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → ((VtxDeg‘𝐺)‘𝑁) = ((♯‘{𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)}) + (♯‘{𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}}))) |
9 | finsumvtxdg2ssteplem.j | . . . . . 6 ⊢ 𝐽 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)} | |
10 | 9 | eqcomi 2746 | . . . . 5 ⊢ {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)} = 𝐽 |
11 | 10 | fveq2i 6815 | . . . 4 ⊢ (♯‘{𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)}) = (♯‘𝐽) |
12 | 11 | a1i 11 | . . 3 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → (♯‘{𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)}) = (♯‘𝐽)) |
13 | 12 | oveq1d 7332 | . 2 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → ((♯‘{𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)}) + (♯‘{𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}})) = ((♯‘𝐽) + (♯‘{𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}}))) |
14 | 8, 13 | eqtrd 2777 | 1 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → ((VtxDeg‘𝐺)‘𝑁) = ((♯‘𝐽) + (♯‘{𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}}))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1540 ∈ wcel 2105 ∉ wnel 3047 {crab 3404 ∖ cdif 3894 {csn 4571 〈cop 4577 dom cdm 5608 ↾ cres 5610 ‘cfv 6466 (class class class)co 7317 Fincfn 8783 + caddc 10954 ♯chash 14124 Vtxcvtx 27502 iEdgciedg 27503 UPGraphcupgr 27586 VtxDegcvtxdg 27968 |
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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2708 ax-rep 5224 ax-sep 5238 ax-nul 5245 ax-pow 5303 ax-pr 5367 ax-un 7630 ax-cnex 11007 ax-resscn 11008 ax-1cn 11009 ax-icn 11010 ax-addcl 11011 ax-addrcl 11012 ax-mulcl 11013 ax-mulrcl 11014 ax-mulcom 11015 ax-addass 11016 ax-mulass 11017 ax-distr 11018 ax-i2m1 11019 ax-1ne0 11020 ax-1rid 11021 ax-rnegex 11022 ax-rrecex 11023 ax-cnre 11024 ax-pre-lttri 11025 ax-pre-lttrn 11026 ax-pre-ltadd 11027 ax-pre-mulgt0 11028 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-reu 3351 df-rab 3405 df-v 3443 df-sbc 3727 df-csb 3843 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3916 df-nul 4268 df-if 4472 df-pw 4547 df-sn 4572 df-pr 4574 df-op 4578 df-uni 4851 df-int 4893 df-iun 4939 df-br 5088 df-opab 5150 df-mpt 5171 df-tr 5205 df-id 5507 df-eprel 5513 df-po 5521 df-so 5522 df-fr 5563 df-we 5565 df-xp 5614 df-rel 5615 df-cnv 5616 df-co 5617 df-dm 5618 df-rn 5619 df-res 5620 df-ima 5621 df-pred 6225 df-ord 6292 df-on 6293 df-lim 6294 df-suc 6295 df-iota 6418 df-fun 6468 df-fn 6469 df-f 6470 df-f1 6471 df-fo 6472 df-f1o 6473 df-fv 6474 df-riota 7274 df-ov 7320 df-oprab 7321 df-mpo 7322 df-om 7760 df-1st 7878 df-2nd 7879 df-frecs 8146 df-wrecs 8177 df-recs 8251 df-rdg 8290 df-1o 8346 df-er 8548 df-en 8784 df-dom 8785 df-sdom 8786 df-fin 8787 df-card 9775 df-pnf 11091 df-mnf 11092 df-xr 11093 df-ltxr 11094 df-le 11095 df-sub 11287 df-neg 11288 df-nn 12054 df-n0 12314 df-z 12400 df-uz 12663 df-xadd 12929 df-hash 14125 df-vtxdg 27969 |
This theorem is referenced by: finsumvtxdg2sstep 28052 |
Copyright terms: Public domain | W3C validator |