![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > vtxdginducedm1fi | Structured version Visualization version GIF version |
Description: The degree of a vertex 𝑣 in the induced subgraph 𝑆 of a pseudograph 𝐺 of finite size obtained by removing one vertex 𝑁 plus the number of edges joining the vertex 𝑣 and the vertex 𝑁 is the degree of the vertex 𝑣 in the pseudograph 𝐺. (Contributed by AV, 18-Dec-2021.) |
Ref | Expression |
---|---|
vtxdginducedm1.v | ⊢ 𝑉 = (Vtx‘𝐺) |
vtxdginducedm1.e | ⊢ 𝐸 = (iEdg‘𝐺) |
vtxdginducedm1.k | ⊢ 𝐾 = (𝑉 ∖ {𝑁}) |
vtxdginducedm1.i | ⊢ 𝐼 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∉ (𝐸‘𝑖)} |
vtxdginducedm1.p | ⊢ 𝑃 = (𝐸 ↾ 𝐼) |
vtxdginducedm1.s | ⊢ 𝑆 = 〈𝐾, 𝑃〉 |
vtxdginducedm1.j | ⊢ 𝐽 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)} |
Ref | Expression |
---|---|
vtxdginducedm1fi | ⊢ (𝐸 ∈ Fin → ∀𝑣 ∈ (𝑉 ∖ {𝑁})((VtxDeg‘𝐺)‘𝑣) = (((VtxDeg‘𝑆)‘𝑣) + (♯‘{𝑙 ∈ 𝐽 ∣ 𝑣 ∈ (𝐸‘𝑙)}))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | vtxdginducedm1.v | . . 3 ⊢ 𝑉 = (Vtx‘𝐺) | |
2 | vtxdginducedm1.e | . . 3 ⊢ 𝐸 = (iEdg‘𝐺) | |
3 | vtxdginducedm1.k | . . 3 ⊢ 𝐾 = (𝑉 ∖ {𝑁}) | |
4 | vtxdginducedm1.i | . . 3 ⊢ 𝐼 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∉ (𝐸‘𝑖)} | |
5 | vtxdginducedm1.p | . . 3 ⊢ 𝑃 = (𝐸 ↾ 𝐼) | |
6 | vtxdginducedm1.s | . . 3 ⊢ 𝑆 = 〈𝐾, 𝑃〉 | |
7 | vtxdginducedm1.j | . . 3 ⊢ 𝐽 = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)} | |
8 | 1, 2, 3, 4, 5, 6, 7 | vtxdginducedm1 26647 | . 2 ⊢ ∀𝑣 ∈ (𝑉 ∖ {𝑁})((VtxDeg‘𝐺)‘𝑣) = (((VtxDeg‘𝑆)‘𝑣) +𝑒 (♯‘{𝑙 ∈ 𝐽 ∣ 𝑣 ∈ (𝐸‘𝑙)})) |
9 | 5 | dmeqi 5478 | . . . . . . . . 9 ⊢ dom 𝑃 = dom (𝐸 ↾ 𝐼) |
10 | finresfin 8349 | . . . . . . . . . 10 ⊢ (𝐸 ∈ Fin → (𝐸 ↾ 𝐼) ∈ Fin) | |
11 | dmfi 8407 | . . . . . . . . . 10 ⊢ ((𝐸 ↾ 𝐼) ∈ Fin → dom (𝐸 ↾ 𝐼) ∈ Fin) | |
12 | 10, 11 | syl 17 | . . . . . . . . 9 ⊢ (𝐸 ∈ Fin → dom (𝐸 ↾ 𝐼) ∈ Fin) |
13 | 9, 12 | syl5eqel 2841 | . . . . . . . 8 ⊢ (𝐸 ∈ Fin → dom 𝑃 ∈ Fin) |
14 | 6 | fveq2i 6353 | . . . . . . . . . 10 ⊢ (Vtx‘𝑆) = (Vtx‘〈𝐾, 𝑃〉) |
15 | 1 | fvexi 6361 | . . . . . . . . . . . . 13 ⊢ 𝑉 ∈ V |
16 | 15 | difexi 4959 | . . . . . . . . . . . 12 ⊢ (𝑉 ∖ {𝑁}) ∈ V |
17 | 3, 16 | eqeltri 2833 | . . . . . . . . . . 11 ⊢ 𝐾 ∈ V |
18 | 2 | fvexi 6361 | . . . . . . . . . . . . 13 ⊢ 𝐸 ∈ V |
19 | 18 | resex 5599 | . . . . . . . . . . . 12 ⊢ (𝐸 ↾ 𝐼) ∈ V |
20 | 5, 19 | eqeltri 2833 | . . . . . . . . . . 11 ⊢ 𝑃 ∈ V |
21 | 17, 20 | opvtxfvi 26086 | . . . . . . . . . 10 ⊢ (Vtx‘〈𝐾, 𝑃〉) = 𝐾 |
22 | 14, 21, 3 | 3eqtrri 2785 | . . . . . . . . 9 ⊢ (𝑉 ∖ {𝑁}) = (Vtx‘𝑆) |
23 | 1, 2, 3, 4, 5, 6 | vtxdginducedm1lem1 26643 | . . . . . . . . . 10 ⊢ (iEdg‘𝑆) = 𝑃 |
24 | 23 | eqcomi 2767 | . . . . . . . . 9 ⊢ 𝑃 = (iEdg‘𝑆) |
25 | eqid 2758 | . . . . . . . . 9 ⊢ dom 𝑃 = dom 𝑃 | |
26 | 22, 24, 25 | vtxdgfisnn0 26579 | . . . . . . . 8 ⊢ ((dom 𝑃 ∈ Fin ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → ((VtxDeg‘𝑆)‘𝑣) ∈ ℕ0) |
27 | 13, 26 | sylan 489 | . . . . . . 7 ⊢ ((𝐸 ∈ Fin ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → ((VtxDeg‘𝑆)‘𝑣) ∈ ℕ0) |
28 | 27 | nn0red 11542 | . . . . . 6 ⊢ ((𝐸 ∈ Fin ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → ((VtxDeg‘𝑆)‘𝑣) ∈ ℝ) |
29 | dmfi 8407 | . . . . . . . . . . 11 ⊢ (𝐸 ∈ Fin → dom 𝐸 ∈ Fin) | |
30 | rabfi 8348 | . . . . . . . . . . 11 ⊢ (dom 𝐸 ∈ Fin → {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)} ∈ Fin) | |
31 | 29, 30 | syl 17 | . . . . . . . . . 10 ⊢ (𝐸 ∈ Fin → {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)} ∈ Fin) |
32 | 7, 31 | syl5eqel 2841 | . . . . . . . . 9 ⊢ (𝐸 ∈ Fin → 𝐽 ∈ Fin) |
33 | rabfi 8348 | . . . . . . . . 9 ⊢ (𝐽 ∈ Fin → {𝑙 ∈ 𝐽 ∣ 𝑣 ∈ (𝐸‘𝑙)} ∈ Fin) | |
34 | hashcl 13337 | . . . . . . . . 9 ⊢ ({𝑙 ∈ 𝐽 ∣ 𝑣 ∈ (𝐸‘𝑙)} ∈ Fin → (♯‘{𝑙 ∈ 𝐽 ∣ 𝑣 ∈ (𝐸‘𝑙)}) ∈ ℕ0) | |
35 | 32, 33, 34 | 3syl 18 | . . . . . . . 8 ⊢ (𝐸 ∈ Fin → (♯‘{𝑙 ∈ 𝐽 ∣ 𝑣 ∈ (𝐸‘𝑙)}) ∈ ℕ0) |
36 | 35 | adantr 472 | . . . . . . 7 ⊢ ((𝐸 ∈ Fin ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → (♯‘{𝑙 ∈ 𝐽 ∣ 𝑣 ∈ (𝐸‘𝑙)}) ∈ ℕ0) |
37 | 36 | nn0red 11542 | . . . . . 6 ⊢ ((𝐸 ∈ Fin ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → (♯‘{𝑙 ∈ 𝐽 ∣ 𝑣 ∈ (𝐸‘𝑙)}) ∈ ℝ) |
38 | 28, 37 | rexaddd 12256 | . . . . 5 ⊢ ((𝐸 ∈ Fin ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → (((VtxDeg‘𝑆)‘𝑣) +𝑒 (♯‘{𝑙 ∈ 𝐽 ∣ 𝑣 ∈ (𝐸‘𝑙)})) = (((VtxDeg‘𝑆)‘𝑣) + (♯‘{𝑙 ∈ 𝐽 ∣ 𝑣 ∈ (𝐸‘𝑙)}))) |
39 | 38 | eqeq2d 2768 | . . . 4 ⊢ ((𝐸 ∈ Fin ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → (((VtxDeg‘𝐺)‘𝑣) = (((VtxDeg‘𝑆)‘𝑣) +𝑒 (♯‘{𝑙 ∈ 𝐽 ∣ 𝑣 ∈ (𝐸‘𝑙)})) ↔ ((VtxDeg‘𝐺)‘𝑣) = (((VtxDeg‘𝑆)‘𝑣) + (♯‘{𝑙 ∈ 𝐽 ∣ 𝑣 ∈ (𝐸‘𝑙)})))) |
40 | 39 | biimpd 219 | . . 3 ⊢ ((𝐸 ∈ Fin ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → (((VtxDeg‘𝐺)‘𝑣) = (((VtxDeg‘𝑆)‘𝑣) +𝑒 (♯‘{𝑙 ∈ 𝐽 ∣ 𝑣 ∈ (𝐸‘𝑙)})) → ((VtxDeg‘𝐺)‘𝑣) = (((VtxDeg‘𝑆)‘𝑣) + (♯‘{𝑙 ∈ 𝐽 ∣ 𝑣 ∈ (𝐸‘𝑙)})))) |
41 | 40 | ralimdva 3098 | . 2 ⊢ (𝐸 ∈ Fin → (∀𝑣 ∈ (𝑉 ∖ {𝑁})((VtxDeg‘𝐺)‘𝑣) = (((VtxDeg‘𝑆)‘𝑣) +𝑒 (♯‘{𝑙 ∈ 𝐽 ∣ 𝑣 ∈ (𝐸‘𝑙)})) → ∀𝑣 ∈ (𝑉 ∖ {𝑁})((VtxDeg‘𝐺)‘𝑣) = (((VtxDeg‘𝑆)‘𝑣) + (♯‘{𝑙 ∈ 𝐽 ∣ 𝑣 ∈ (𝐸‘𝑙)})))) |
42 | 8, 41 | mpi 20 | 1 ⊢ (𝐸 ∈ Fin → ∀𝑣 ∈ (𝑉 ∖ {𝑁})((VtxDeg‘𝐺)‘𝑣) = (((VtxDeg‘𝑆)‘𝑣) + (♯‘{𝑙 ∈ 𝐽 ∣ 𝑣 ∈ (𝐸‘𝑙)}))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1630 ∈ wcel 2137 ∉ wnel 3033 ∀wral 3048 {crab 3052 Vcvv 3338 ∖ cdif 3710 {csn 4319 〈cop 4325 dom cdm 5264 ↾ cres 5266 ‘cfv 6047 (class class class)co 6811 Fincfn 8119 + caddc 10129 ℕ0cn0 11482 +𝑒 cxad 12135 ♯chash 13309 Vtxcvtx 26071 iEdgciedg 26072 VtxDegcvtxdg 26569 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1869 ax-4 1884 ax-5 1986 ax-6 2052 ax-7 2088 ax-8 2139 ax-9 2146 ax-10 2166 ax-11 2181 ax-12 2194 ax-13 2389 ax-ext 2738 ax-rep 4921 ax-sep 4931 ax-nul 4939 ax-pow 4990 ax-pr 5053 ax-un 7112 ax-cnex 10182 ax-resscn 10183 ax-1cn 10184 ax-icn 10185 ax-addcl 10186 ax-addrcl 10187 ax-mulcl 10188 ax-mulrcl 10189 ax-mulcom 10190 ax-addass 10191 ax-mulass 10192 ax-distr 10193 ax-i2m1 10194 ax-1ne0 10195 ax-1rid 10196 ax-rnegex 10197 ax-rrecex 10198 ax-cnre 10199 ax-pre-lttri 10200 ax-pre-lttrn 10201 ax-pre-ltadd 10202 ax-pre-mulgt0 10203 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1633 df-ex 1852 df-nf 1857 df-sb 2045 df-eu 2609 df-mo 2610 df-clab 2745 df-cleq 2751 df-clel 2754 df-nfc 2889 df-ne 2931 df-nel 3034 df-ral 3053 df-rex 3054 df-reu 3055 df-rmo 3056 df-rab 3057 df-v 3340 df-sbc 3575 df-csb 3673 df-dif 3716 df-un 3718 df-in 3720 df-ss 3727 df-pss 3729 df-nul 4057 df-if 4229 df-pw 4302 df-sn 4320 df-pr 4322 df-tp 4324 df-op 4326 df-uni 4587 df-int 4626 df-iun 4672 df-br 4803 df-opab 4863 df-mpt 4880 df-tr 4903 df-id 5172 df-eprel 5177 df-po 5185 df-so 5186 df-fr 5223 df-we 5225 df-xp 5270 df-rel 5271 df-cnv 5272 df-co 5273 df-dm 5274 df-rn 5275 df-res 5276 df-ima 5277 df-pred 5839 df-ord 5885 df-on 5886 df-lim 5887 df-suc 5888 df-iota 6010 df-fun 6049 df-fn 6050 df-f 6051 df-f1 6052 df-fo 6053 df-f1o 6054 df-fv 6055 df-riota 6772 df-ov 6814 df-oprab 6815 df-mpt2 6816 df-om 7229 df-1st 7331 df-2nd 7332 df-wrecs 7574 df-recs 7635 df-rdg 7673 df-1o 7727 df-oadd 7731 df-er 7909 df-en 8120 df-dom 8121 df-sdom 8122 df-fin 8123 df-card 8953 df-cda 9180 df-pnf 10266 df-mnf 10267 df-xr 10268 df-ltxr 10269 df-le 10270 df-sub 10458 df-neg 10459 df-nn 11211 df-n0 11483 df-xnn0 11554 df-z 11568 df-uz 11878 df-xadd 12138 df-fz 12518 df-hash 13310 df-vtx 26073 df-iedg 26074 df-vtxdg 26570 |
This theorem is referenced by: finsumvtxdg2ssteplem4 26652 |
Copyright terms: Public domain | W3C validator |