| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > vtxdlfgrval | Structured version Visualization version GIF version | ||
| Description: The value of the vertex degree function for a loop-free graph 𝐺. (Contributed by AV, 23-Feb-2021.) |
| Ref | Expression |
|---|---|
| vtxdlfgrval.v | ⊢ 𝑉 = (Vtx‘𝐺) |
| vtxdlfgrval.i | ⊢ 𝐼 = (iEdg‘𝐺) |
| vtxdlfgrval.a | ⊢ 𝐴 = dom 𝐼 |
| vtxdlfgrval.d | ⊢ 𝐷 = (VtxDeg‘𝐺) |
| Ref | Expression |
|---|---|
| vtxdlfgrval | ⊢ ((𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} ∧ 𝑈 ∈ 𝑉) → (𝐷‘𝑈) = (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vtxdlfgrval.d | . . . 4 ⊢ 𝐷 = (VtxDeg‘𝐺) | |
| 2 | 1 | fveq1i 6889 | . . 3 ⊢ (𝐷‘𝑈) = ((VtxDeg‘𝐺)‘𝑈) |
| 3 | vtxdlfgrval.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 4 | vtxdlfgrval.i | . . . . 5 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 5 | vtxdlfgrval.a | . . . . 5 ⊢ 𝐴 = dom 𝐼 | |
| 6 | 3, 4, 5 | vtxdgval 29855 | . . . 4 ⊢ (𝑈 ∈ 𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
| 7 | 6 | adantl 487 | . . 3 ⊢ ((𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} ∧ 𝑈 ∈ 𝑉) → ((VtxDeg‘𝐺)‘𝑈) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
| 8 | 2, 7 | eqtrid 2813 | . 2 ⊢ ((𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} ∧ 𝑈 ∈ 𝑉) → (𝐷‘𝑈) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
| 9 | eqid 2766 | . . . . . . 7 ⊢ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} = {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} | |
| 10 | 4, 5, 9 | lfgrnloop 29512 | . . . . . 6 ⊢ (𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} → {𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}} = ∅) |
| 11 | 10 | adantr 486 | . . . . 5 ⊢ ((𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} ∧ 𝑈 ∈ 𝑉) → {𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}} = ∅) |
| 12 | 11 | fveq2d 6892 | . . . 4 ⊢ ((𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} ∧ 𝑈 ∈ 𝑉) → (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}) = (♯‘∅)) |
| 13 | hash0 14423 | . . . 4 ⊢ (♯‘∅) = 0 | |
| 14 | 12, 13 | eqtrdi 2817 | . . 3 ⊢ ((𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} ∧ 𝑈 ∈ 𝑉) → (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}) = 0) |
| 15 | 14 | oveq2d 7439 | . 2 ⊢ ((𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} ∧ 𝑈 ∈ 𝑉) → ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}})) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 0)) |
| 16 | 4 | dmeqi 5899 | . . . . . . 7 ⊢ dom 𝐼 = dom (iEdg‘𝐺) |
| 17 | 5, 16 | eqtri 2789 | . . . . . 6 ⊢ 𝐴 = dom (iEdg‘𝐺) |
| 18 | fvex 6901 | . . . . . . 7 ⊢ (iEdg‘𝐺) ∈ V | |
| 19 | 18 | dmex 7915 | . . . . . 6 ⊢ dom (iEdg‘𝐺) ∈ V |
| 20 | 17, 19 | eqeltri 2862 | . . . . 5 ⊢ 𝐴 ∈ V |
| 21 | 20 | rabex 5314 | . . . 4 ⊢ {𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)} ∈ V |
| 22 | hashxnn0 14395 | . . . 4 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)} ∈ V → (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) ∈ ℕ0*) | |
| 23 | xnn0xr 12600 | . . . 4 ⊢ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) ∈ ℕ0* → (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) ∈ ℝ*) | |
| 24 | 21, 22, 23 | mp2b 10 | . . 3 ⊢ (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) ∈ ℝ* |
| 25 | xaddrid 13285 | . . 3 ⊢ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) ∈ ℝ* → ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 0) = (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)})) | |
| 26 | 24, 25 | mp1i 14 | . 2 ⊢ ((𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} ∧ 𝑈 ∈ 𝑉) → ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 0) = (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)})) |
| 27 | 8, 15, 26 | 3eqtrd 2805 | 1 ⊢ ((𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} ∧ 𝑈 ∈ 𝑉) → (𝐷‘𝑈) = (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)})) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 {crab 3419 Vcvv 3458 ∅c0 4289 𝒫 cpw 4567 {csn 4594 class class class wbr 5114 dom cdm 5666 ⟶wf 6539 ‘cfv 6543 (class class class)co 7423 0cc0 11118 ℝ*cxr 11260 ≤ cle 11262 2c2 12313 ℕ0*cxnn0 12595 +𝑒 cxad 13153 ♯chash 14386 Vtxcvtx 29383 iEdgciedg 29384 VtxDegcvtxdg 29852 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-cnex 11174 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 ax-pre-mulgt0 11195 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-int 4918 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7872 df-1st 7995 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-1o 8462 df-er 8703 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-card 9944 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11461 df-neg 11462 df-nn 12252 df-2 12321 df-n0 12523 df-xnn0 12596 df-z 12610 df-uz 12881 df-xadd 13156 df-fz 13554 df-hash 14387 df-vtxdg 29853 |
| This theorem is used by: vtxdumgrval 29873 1hevtxdg1 29893 |
| Copyright terms: Public domain | W3C validator |