| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > finsumvtxdg2ssteplem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for finsumvtxdg2sstep 30017. (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 29567 | . . . . 5 ⊢ (𝐺 ∈ UPGraph → 𝐺 ∈ UHGraph) | |
| 2 | finsumvtxdg2sstep.e | . . . . . 6 ⊢ 𝐸 = (iEdg‘𝐺) | |
| 3 | 2 | uhgrfun 29531 | . . . . 5 ⊢ (𝐺 ∈ UHGraph → Fun 𝐸) |
| 4 | 1, 3 | syl 18 | . . . 4 ⊢ (𝐺 ∈ UPGraph → Fun 𝐸) |
| 5 | 4 | ad2antrr 739 | . . 3 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → Fun 𝐸) |
| 6 | simprr 785 | . . 3 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → 𝐸 ∈ Fin) | |
| 7 | finsumvtxdg2sstep.i | . . . . 5 ⊢ 𝐼 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∉ (𝐸‘𝑖)} | |
| 8 | 7 | ssrab3 4033 | . . . 4 ⊢ 𝐼 ⊆ dom 𝐸 |
| 9 | 8 | a1i 11 | . . 3 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → 𝐼 ⊆ dom 𝐸) |
| 10 | hashreshashfun 14508 | . . 3 ⊢ ((Fun 𝐸 ∧ 𝐸 ∈ Fin ∧ 𝐼 ⊆ dom 𝐸) → (♯‘𝐸) = ((♯‘(𝐸 ↾ 𝐼)) + (♯‘(dom 𝐸 ∖ 𝐼)))) | |
| 11 | 5, 6, 9, 10 | syl3anc 1398 | . 2 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → (♯‘𝐸) = ((♯‘(𝐸 ↾ 𝐼)) + (♯‘(dom 𝐸 ∖ 𝐼)))) |
| 12 | finsumvtxdg2sstep.p | . . . . . 6 ⊢ 𝑃 = (𝐸 ↾ 𝐼) | |
| 13 | 12 | eqcomi 2771 | . . . . 5 ⊢ (𝐸 ↾ 𝐼) = 𝑃 |
| 14 | 13 | fveq2i 6885 | . . . 4 ⊢ (♯‘(𝐸 ↾ 𝐼)) = (♯‘𝑃) |
| 15 | 14 | a1i 11 | . . 3 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → (♯‘(𝐸 ↾ 𝐼)) = (♯‘𝑃)) |
| 16 | notrab 4271 | . . . . . 6 ⊢ (dom 𝐸 ∖ {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∉ (𝐸‘𝑖)}) = {𝑖 ∈ dom 𝐸 ∣ ¬ 𝑁 ∉ (𝐸‘𝑖)} | |
| 17 | 7 | difeq2i 4074 | . . . . . 6 ⊢ (dom 𝐸 ∖ 𝐼) = (dom 𝐸 ∖ {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∉ (𝐸‘𝑖)}) |
| 18 | finsumvtxdg2ssteplem.j | . . . . . . 7 ⊢ 𝐽 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)} | |
| 19 | nnel 3073 | . . . . . . . . 9 ⊢ (¬ 𝑁 ∉ (𝐸‘𝑖) ↔ 𝑁 ∈ (𝐸‘𝑖)) | |
| 20 | 19 | bicomi 227 | . . . . . . . 8 ⊢ (𝑁 ∈ (𝐸‘𝑖) ↔ ¬ 𝑁 ∉ (𝐸‘𝑖)) |
| 21 | 20 | rabbii 3419 | . . . . . . 7 ⊢ {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)} = {𝑖 ∈ dom 𝐸 ∣ ¬ 𝑁 ∉ (𝐸‘𝑖)} |
| 22 | 18, 21 | eqtri 2785 | . . . . . 6 ⊢ 𝐽 = {𝑖 ∈ dom 𝐸 ∣ ¬ 𝑁 ∉ (𝐸‘𝑖)} |
| 23 | 16, 17, 22 | 3eqtr4i 2795 | . . . . 5 ⊢ (dom 𝐸 ∖ 𝐼) = 𝐽 |
| 24 | 23 | a1i 11 | . . . 4 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → (dom 𝐸 ∖ 𝐼) = 𝐽) |
| 25 | 24 | fveq2d 6886 | . . 3 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → (♯‘(dom 𝐸 ∖ 𝐼)) = (♯‘𝐽)) |
| 26 | 15, 25 | oveq12d 7435 | . 2 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → ((♯‘(𝐸 ↾ 𝐼)) + (♯‘(dom 𝐸 ∖ 𝐼))) = ((♯‘𝑃) + (♯‘𝐽))) |
| 27 | 11, 26 | eqtrd 2797 | 1 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin)) → (♯‘𝐸) = ((♯‘𝑃) + (♯‘𝐽))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∉ wnel 3063 {crab 3414 ∖ cdif 3899 ⊆ wss 3902 {csn 4587 〈cop 4593 dom cdm 5659 ↾ cres 5661 Fun wfun 6531 ‘cfv 6537 (class class class)co 7417 Fincfn 8956 + caddc 11131 ♯chash 14398 Vtxcvtx 29461 iEdgciedg 29462 UHGraphcuhgr 29521 UPGraphcupgr 29545 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-cnex 11184 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 ax-pre-mulgt0 11205 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-2o 8460 df-oadd 8463 df-er 8700 df-en 8957 df-dom 8958 df-sdom 8959 df-fin 8960 df-dju 9910 df-card 9948 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-sub 11471 df-neg 11472 df-nn 12262 df-2 12331 df-n0 12533 df-xnn0 12606 df-z 12620 df-uz 12892 df-fz 13566 df-hash 14399 df-uhgr 29523 df-upgr 29547 |
| This theorem is used by: finsumvtxdg2sstep 30017 |
| Copyright terms: Public domain | W3C validator |