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

Theorem vtxdgval 29796
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 29330 . . . 4 (𝑈𝑉𝐺 ∈ V)
3 vtxdgval.i . . . . 5 𝐼 = (iEdg‘𝐺)
4 vtxdgval.a . . . . 5 𝐴 = dom 𝐼
51, 3, 4vtxdgfval 29795 . . . 4 (𝐺 ∈ V → (VtxDeg‘𝐺) = (𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}}))))
62, 5syl 18 . . 3 (𝑈𝑉 → (VtxDeg‘𝐺) = (𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}}))))
76fveq1d 6885 . 2 (𝑈𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}})))‘𝑈))
8 eleq1 2851 . . . . . 6 (𝑢 = 𝑈 → (𝑢 ∈ (𝐼𝑥) ↔ 𝑈 ∈ (𝐼𝑥)))
98rabbidv 3423 . . . . 5 (𝑢 = 𝑈 → {𝑥𝐴𝑢 ∈ (𝐼𝑥)} = {𝑥𝐴𝑈 ∈ (𝐼𝑥)})
109fveq2d 6887 . . . 4 (𝑢 = 𝑈 → (♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) = (♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}))
11 sneq 4600 . . . . . . 7 (𝑢 = 𝑈 → {𝑢} = {𝑈})
1211eqeq2d 2774 . . . . . 6 (𝑢 = 𝑈 → ((𝐼𝑥) = {𝑢} ↔ (𝐼𝑥) = {𝑈}))
1312rabbidv 3423 . . . . 5 (𝑢 = 𝑈 → {𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}} = {𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})
1413fveq2d 6887 . . . 4 (𝑢 = 𝑈 → (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}}) = (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}}))
1510, 14oveq12d 7430 . . 3 (𝑢 = 𝑈 → ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}})) = ((♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})))
16 eqid 2763 . . 3 (𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}}))) = (𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}})))
17 ovex 7445 . . 3 ((♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})) ∈ V
1815, 16, 17fvmpt 6991 . 2 (𝑈𝑉 → ((𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}})))‘𝑈) = ((♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})))
197, 18eqtrd 2798 1 (𝑈𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1570  wcel 2143  {crab 3416  Vcvv 3455  {csn 4590  cmpt 5193  dom cdm 5663  cfv 6538  (class class class)co 7412   +𝑒 cxad 13136  chash 14368  Vtxcvtx 29324  iEdgciedg 29325  VtxDegcvtxdg 29793
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pr 5406
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7415  df-vtxdg 29794
This theorem is referenced by:  vtxdgfival  29797  vtxdun  29809  vtxdlfgrval  29813  vtxd0nedgb  29816  vtxdushgrfvedg  29818  vtxdginducedm1  29871
  Copyright terms: Public domain W3C validator