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

Theorem vtxdgval 27835
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 27372 . . . 4 (𝑈𝑉𝐺 ∈ V)
3 vtxdgval.i . . . . 5 𝐼 = (iEdg‘𝐺)
4 vtxdgval.a . . . . 5 𝐴 = dom 𝐼
51, 3, 4vtxdgfval 27834 . . . 4 (𝐺 ∈ V → (VtxDeg‘𝐺) = (𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}}))))
62, 5syl 17 . . 3 (𝑈𝑉 → (VtxDeg‘𝐺) = (𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}}))))
76fveq1d 6776 . 2 (𝑈𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}})))‘𝑈))
8 eleq1 2826 . . . . . 6 (𝑢 = 𝑈 → (𝑢 ∈ (𝐼𝑥) ↔ 𝑈 ∈ (𝐼𝑥)))
98rabbidv 3414 . . . . 5 (𝑢 = 𝑈 → {𝑥𝐴𝑢 ∈ (𝐼𝑥)} = {𝑥𝐴𝑈 ∈ (𝐼𝑥)})
109fveq2d 6778 . . . 4 (𝑢 = 𝑈 → (♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) = (♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}))
11 sneq 4571 . . . . . . 7 (𝑢 = 𝑈 → {𝑢} = {𝑈})
1211eqeq2d 2749 . . . . . 6 (𝑢 = 𝑈 → ((𝐼𝑥) = {𝑢} ↔ (𝐼𝑥) = {𝑈}))
1312rabbidv 3414 . . . . 5 (𝑢 = 𝑈 → {𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}} = {𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})
1413fveq2d 6778 . . . 4 (𝑢 = 𝑈 → (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}}) = (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}}))
1510, 14oveq12d 7293 . . 3 (𝑢 = 𝑈 → ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}})) = ((♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})))
16 eqid 2738 . . 3 (𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}}))) = (𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}})))
17 ovex 7308 . . 3 ((♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})) ∈ V
1815, 16, 17fvmpt 6875 . 2 (𝑈𝑉 → ((𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}})))‘𝑈) = ((♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})))
197, 18eqtrd 2778 1 (𝑈𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1539  wcel 2106  {crab 3068  Vcvv 3432  {csn 4561  cmpt 5157  dom cdm 5589  cfv 6433  (class class class)co 7275   +𝑒 cxad 12846  chash 14044  Vtxcvtx 27366  iEdgciedg 27367  VtxDegcvtxdg 27832
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-ov 7278  df-vtxdg 27833
This theorem is referenced by:  vtxdgfival  27836  vtxdun  27848  vtxdlfgrval  27852  vtxd0nedgb  27855  vtxdushgrfvedg  27857  vtxdginducedm1  27910
  Copyright terms: Public domain W3C validator