![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > finsumvtxdg2ssteplem1 | Structured version Visualization version GIF version |
Description: Lemma for finsumvtxdg2sstep 29582. (Contributed by AV, 15-Dec-2021.) |
Ref | Expression |
---|---|
finsumvtxdg2sstep.v | ⊢ 𝑉 = (Vtx‘𝐺) |
finsumvtxdg2sstep.e | ⊢ 𝐸 = (iEdg‘𝐺) |
finsumvtxdg2sstep.k | ⊢ 𝐾 = (𝑉 ∖ {𝑁}) |
finsumvtxdg2sstep.i | ⊢ 𝐼 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∉ (𝐸‘𝑖)} |
finsumvtxdg2sstep.p | ⊢ 𝑃 = (𝐸 ↾ 𝐼) |
finsumvtxdg2sstep.s | ⊢ 𝑆 = 〈𝐾, 𝑃〉 |
finsumvtxdg2ssteplem.j | ⊢ 𝐽 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)} |
Ref | Expression |
---|---|
finsumvtxdg2ssteplem1 | ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → (♯‘𝐸) = ((♯‘𝑃) + (♯‘𝐽))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | upgruhgr 29134 | . . . . 5 ⊢ (𝐺 ∈ UPGraph → 𝐺 ∈ UHGraph) | |
2 | finsumvtxdg2sstep.e | . . . . . 6 ⊢ 𝐸 = (iEdg‘𝐺) | |
3 | 2 | uhgrfun 29098 | . . . . 5 ⊢ (𝐺 ∈ UHGraph → Fun 𝐸) |
4 | 1, 3 | syl 17 | . . . 4 ⊢ (𝐺 ∈ UPGraph → Fun 𝐸) |
5 | 4 | ad2antrr 726 | . . 3 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → Fun 𝐸) |
6 | simprr 773 | . . 3 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → 𝐸 ∈ Fin) | |
7 | finsumvtxdg2sstep.i | . . . . 5 ⊢ 𝐼 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∉ (𝐸‘𝑖)} | |
8 | 7 | ssrab3 4092 | . . . 4 ⊢ 𝐼 ⊆ dom 𝐸 |
9 | 8 | a1i 11 | . . 3 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → 𝐼 ⊆ dom 𝐸) |
10 | hashreshashfun 14475 | . . 3 ⊢ ((Fun 𝐸 ∧ 𝐸 ∈ Fin ∧ 𝐼 ⊆ dom 𝐸) → (♯‘𝐸) = ((♯‘(𝐸 ↾ 𝐼)) + (♯‘(dom 𝐸 ∖ 𝐼)))) | |
11 | 5, 6, 9, 10 | syl3anc 1370 | . 2 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → (♯‘𝐸) = ((♯‘(𝐸 ↾ 𝐼)) + (♯‘(dom 𝐸 ∖ 𝐼)))) |
12 | finsumvtxdg2sstep.p | . . . . . 6 ⊢ 𝑃 = (𝐸 ↾ 𝐼) | |
13 | 12 | eqcomi 2744 | . . . . 5 ⊢ (𝐸 ↾ 𝐼) = 𝑃 |
14 | 13 | fveq2i 6910 | . . . 4 ⊢ (♯‘(𝐸 ↾ 𝐼)) = (♯‘𝑃) |
15 | 14 | a1i 11 | . . 3 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → (♯‘(𝐸 ↾ 𝐼)) = (♯‘𝑃)) |
16 | notrab 4328 | . . . . . 6 ⊢ (dom 𝐸 ∖ {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∉ (𝐸‘𝑖)}) = {𝑖 ∈ dom 𝐸 ∣ ¬ 𝑁 ∉ (𝐸‘𝑖)} | |
17 | 7 | difeq2i 4133 | . . . . . 6 ⊢ (dom 𝐸 ∖ 𝐼) = (dom 𝐸 ∖ {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∉ (𝐸‘𝑖)}) |
18 | finsumvtxdg2ssteplem.j | . . . . . . 7 ⊢ 𝐽 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)} | |
19 | nnel 3054 | . . . . . . . . 9 ⊢ (¬ 𝑁 ∉ (𝐸‘𝑖) ↔ 𝑁 ∈ (𝐸‘𝑖)) | |
20 | 19 | bicomi 224 | . . . . . . . 8 ⊢ (𝑁 ∈ (𝐸‘𝑖) ↔ ¬ 𝑁 ∉ (𝐸‘𝑖)) |
21 | 20 | rabbii 3439 | . . . . . . 7 ⊢ {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)} = {𝑖 ∈ dom 𝐸 ∣ ¬ 𝑁 ∉ (𝐸‘𝑖)} |
22 | 18, 21 | eqtri 2763 | . . . . . 6 ⊢ 𝐽 = {𝑖 ∈ dom 𝐸 ∣ ¬ 𝑁 ∉ (𝐸‘𝑖)} |
23 | 16, 17, 22 | 3eqtr4i 2773 | . . . . 5 ⊢ (dom 𝐸 ∖ 𝐼) = 𝐽 |
24 | 23 | a1i 11 | . . . 4 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → (dom 𝐸 ∖ 𝐼) = 𝐽) |
25 | 24 | fveq2d 6911 | . . 3 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → (♯‘(dom 𝐸 ∖ 𝐼)) = (♯‘𝐽)) |
26 | 15, 25 | oveq12d 7449 | . 2 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → ((♯‘(𝐸 ↾ 𝐼)) + (♯‘(dom 𝐸 ∖ 𝐼))) = ((♯‘𝑃) + (♯‘𝐽))) |
27 | 11, 26 | eqtrd 2775 | 1 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → (♯‘𝐸) = ((♯‘𝑃) + (♯‘𝐽))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2106 ∉ wnel 3044 {crab 3433 ∖ cdif 3960 ⊆ wss 3963 {csn 4631 〈cop 4637 dom cdm 5689 ↾ cres 5691 Fun wfun 6557 ‘cfv 6563 (class class class)co 7431 Fincfn 8984 + caddc 11156 ♯chash 14366 Vtxcvtx 29028 iEdgciedg 29029 UHGraphcuhgr 29088 UPGraphcupgr 29112 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-2o 8506 df-oadd 8509 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-dju 9939 df-card 9977 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-2 12327 df-n0 12525 df-xnn0 12598 df-z 12612 df-uz 12877 df-fz 13545 df-hash 14367 df-uhgr 29090 df-upgr 29114 |
This theorem is referenced by: finsumvtxdg2sstep 29582 |
Copyright terms: Public domain | W3C validator |