MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  vtxdgval Structured version   Visualization version   GIF version

Theorem vtxdgval 29445
Description: The degree of a vertex. (Contributed by Mario Carneiro, 12-Mar-2015.) (Revised by Alexander van der Vekens, 20-Dec-2017.) (Revised by AV, 10-Dec-2020.) (Revised by AV, 22-Mar-2021.)
Hypotheses
Ref Expression
vtxdgval.v 𝑉 = (Vtx‘𝐺)
vtxdgval.i 𝐼 = (iEdg‘𝐺)
vtxdgval.a 𝐴 = dom 𝐼
Assertion
Ref Expression
vtxdgval (𝑈𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐺   𝑥,𝑈
Allowed substitution hints:   𝐼(𝑥)   𝑉(𝑥)

Proof of Theorem vtxdgval
Dummy variable 𝑢 is distinct from all other variables.
StepHypRef Expression
1 vtxdgval.v . . . . 5 𝑉 = (Vtx‘𝐺)
211vgrex 28978 . . . 4 (𝑈𝑉𝐺 ∈ V)
3 vtxdgval.i . . . . 5 𝐼 = (iEdg‘𝐺)
4 vtxdgval.a . . . . 5 𝐴 = dom 𝐼
51, 3, 4vtxdgfval 29444 . . . 4 (𝐺 ∈ V → (VtxDeg‘𝐺) = (𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}}))))
62, 5syl 17 . . 3 (𝑈𝑉 → (VtxDeg‘𝐺) = (𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}}))))
76fveq1d 6824 . 2 (𝑈𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}})))‘𝑈))
8 eleq1 2819 . . . . . 6 (𝑢 = 𝑈 → (𝑢 ∈ (𝐼𝑥) ↔ 𝑈 ∈ (𝐼𝑥)))
98rabbidv 3402 . . . . 5 (𝑢 = 𝑈 → {𝑥𝐴𝑢 ∈ (𝐼𝑥)} = {𝑥𝐴𝑈 ∈ (𝐼𝑥)})
109fveq2d 6826 . . . 4 (𝑢 = 𝑈 → (♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) = (♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}))
11 sneq 4586 . . . . . . 7 (𝑢 = 𝑈 → {𝑢} = {𝑈})
1211eqeq2d 2742 . . . . . 6 (𝑢 = 𝑈 → ((𝐼𝑥) = {𝑢} ↔ (𝐼𝑥) = {𝑈}))
1312rabbidv 3402 . . . . 5 (𝑢 = 𝑈 → {𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}} = {𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})
1413fveq2d 6826 . . . 4 (𝑢 = 𝑈 → (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}}) = (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}}))
1510, 14oveq12d 7364 . . 3 (𝑢 = 𝑈 → ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}})) = ((♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})))
16 eqid 2731 . . 3 (𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}}))) = (𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}})))
17 ovex 7379 . . 3 ((♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})) ∈ V
1815, 16, 17fvmpt 6929 . 2 (𝑈𝑉 → ((𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}})))‘𝑈) = ((♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})))
197, 18eqtrd 2766 1 (𝑈𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wcel 2111  {crab 3395  Vcvv 3436  {csn 4576  cmpt 5172  dom cdm 5616  cfv 6481  (class class class)co 7346   +𝑒 cxad 13006  chash 14234  Vtxcvtx 28972  iEdgciedg 28973  VtxDegcvtxdg 29442
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5217  ax-sep 5234  ax-nul 5244  ax-pr 5370
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4476  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-iun 4943  df-br 5092  df-opab 5154  df-mpt 5173  df-id 5511  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-ov 7349  df-vtxdg 29443
This theorem is referenced by:  vtxdgfival  29446  vtxdun  29458  vtxdlfgrval  29462  vtxd0nedgb  29465  vtxdushgrfvedg  29467  vtxdginducedm1  29520
  Copyright terms: Public domain W3C validator