| 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 6841 | . . 3 ⊢ (𝐷‘𝑈) = ((VtxDeg‘𝐺)‘𝑈) |
| 3 | vtxdlfgrval.v | . . . . 5 ⊢ 𝑉 = (Vtx‘𝐺) | |
| 4 | vtxdlfgrval.i | . . . . 5 ⊢ 𝐼 = (iEdg‘𝐺) | |
| 5 | vtxdlfgrval.a | . . . . 5 ⊢ 𝐴 = dom 𝐼 | |
| 6 | 3, 4, 5 | vtxdgval 29537 | . . . 4 ⊢ (𝑈 ∈ 𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
| 7 | 6 | adantl 481 | . . 3 ⊢ ((𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} ∧ 𝑈 ∈ 𝑉) → ((VtxDeg‘𝐺)‘𝑈) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
| 8 | 2, 7 | eqtrid 2783 | . 2 ⊢ ((𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} ∧ 𝑈 ∈ 𝑉) → (𝐷‘𝑈) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))) |
| 9 | eqid 2736 | . . . . . . 7 ⊢ {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} = {𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} | |
| 10 | 4, 5, 9 | lfgrnloop 29194 | . . . . . 6 ⊢ (𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} → {𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}} = ∅) |
| 11 | 10 | adantr 480 | . . . . 5 ⊢ ((𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} ∧ 𝑈 ∈ 𝑉) → {𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}} = ∅) |
| 12 | 11 | fveq2d 6844 | . . . 4 ⊢ ((𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} ∧ 𝑈 ∈ 𝑉) → (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}) = (♯‘∅)) |
| 13 | hash0 14329 | . . . 4 ⊢ (♯‘∅) = 0 | |
| 14 | 12, 13 | eqtrdi 2787 | . . 3 ⊢ ((𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} ∧ 𝑈 ∈ 𝑉) → (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}) = 0) |
| 15 | 14 | oveq2d 7383 | . 2 ⊢ ((𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} ∧ 𝑈 ∈ 𝑉) → ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}})) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 0)) |
| 16 | 4 | dmeqi 5859 | . . . . . . 7 ⊢ dom 𝐼 = dom (iEdg‘𝐺) |
| 17 | 5, 16 | eqtri 2759 | . . . . . 6 ⊢ 𝐴 = dom (iEdg‘𝐺) |
| 18 | fvex 6853 | . . . . . . 7 ⊢ (iEdg‘𝐺) ∈ V | |
| 19 | 18 | dmex 7860 | . . . . . 6 ⊢ dom (iEdg‘𝐺) ∈ V |
| 20 | 17, 19 | eqeltri 2832 | . . . . 5 ⊢ 𝐴 ∈ V |
| 21 | 20 | rabex 5280 | . . . 4 ⊢ {𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)} ∈ V |
| 22 | hashxnn0 14301 | . . . 4 ⊢ ({𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)} ∈ V → (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) ∈ ℕ0*) | |
| 23 | xnn0xr 12515 | . . . 4 ⊢ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) ∈ ℕ0* → (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) ∈ ℝ*) | |
| 24 | 21, 22, 23 | mp2b 10 | . . 3 ⊢ (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) ∈ ℝ* |
| 25 | xaddrid 13193 | . . 3 ⊢ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) ∈ ℝ* → ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 0) = (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)})) | |
| 26 | 24, 25 | mp1i 13 | . 2 ⊢ ((𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} ∧ 𝑈 ∈ 𝑉) → ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +𝑒 0) = (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)})) |
| 27 | 8, 15, 26 | 3eqtrd 2775 | 1 ⊢ ((𝐼:𝐴⟶{𝑥 ∈ 𝒫 𝑉 ∣ 2 ≤ (♯‘𝑥)} ∧ 𝑈 ∈ 𝑉) → (𝐷‘𝑈) = (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)})) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 {crab 3389 Vcvv 3429 ∅c0 4273 𝒫 cpw 4541 {csn 4567 class class class wbr 5085 dom cdm 5631 ⟶wf 6494 ‘cfv 6498 (class class class)co 7367 0cc0 11038 ℝ*cxr 11178 ≤ cle 11180 2c2 12236 ℕ0*cxnn0 12510 +𝑒 cxad 13061 ♯chash 14292 Vtxcvtx 29065 iEdgciedg 29066 VtxDegcvtxdg 29534 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-card 9863 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-n0 12438 df-xnn0 12511 df-z 12525 df-uz 12789 df-xadd 13064 df-fz 13462 df-hash 14293 df-vtxdg 29535 |
| This theorem is referenced by: vtxdumgrval 29555 1hevtxdg1 29575 |
| Copyright terms: Public domain | W3C validator |