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

Theorem vtxdgval 27249
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 26786 . . . 4 (𝑈𝑉𝐺 ∈ V)
3 vtxdgval.i . . . . 5 𝐼 = (iEdg‘𝐺)
4 vtxdgval.a . . . . 5 𝐴 = dom 𝐼
51, 3, 4vtxdgfval 27248 . . . 4 (𝐺 ∈ V → (VtxDeg‘𝐺) = (𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}}))))
62, 5syl 17 . . 3 (𝑈𝑉 → (VtxDeg‘𝐺) = (𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}}))))
76fveq1d 6671 . 2 (𝑈𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}})))‘𝑈))
8 eleq1 2900 . . . . . 6 (𝑢 = 𝑈 → (𝑢 ∈ (𝐼𝑥) ↔ 𝑈 ∈ (𝐼𝑥)))
98rabbidv 3480 . . . . 5 (𝑢 = 𝑈 → {𝑥𝐴𝑢 ∈ (𝐼𝑥)} = {𝑥𝐴𝑈 ∈ (𝐼𝑥)})
109fveq2d 6673 . . . 4 (𝑢 = 𝑈 → (♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) = (♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}))
11 sneq 4576 . . . . . . 7 (𝑢 = 𝑈 → {𝑢} = {𝑈})
1211eqeq2d 2832 . . . . . 6 (𝑢 = 𝑈 → ((𝐼𝑥) = {𝑢} ↔ (𝐼𝑥) = {𝑈}))
1312rabbidv 3480 . . . . 5 (𝑢 = 𝑈 → {𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}} = {𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})
1413fveq2d 6673 . . . 4 (𝑢 = 𝑈 → (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}}) = (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}}))
1510, 14oveq12d 7173 . . 3 (𝑢 = 𝑈 → ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}})) = ((♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})))
16 eqid 2821 . . 3 (𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}}))) = (𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}})))
17 ovex 7188 . . 3 ((♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})) ∈ V
1815, 16, 17fvmpt 6767 . 2 (𝑈𝑉 → ((𝑢𝑉 ↦ ((♯‘{𝑥𝐴𝑢 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑢}})))‘𝑈) = ((♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})))
197, 18eqtrd 2856 1 (𝑈𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((♯‘{𝑥𝐴𝑈 ∈ (𝐼𝑥)}) +𝑒 (♯‘{𝑥𝐴 ∣ (𝐼𝑥) = {𝑈}})))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1533  wcel 2110  {crab 3142  Vcvv 3494  {csn 4566  cmpt 5145  dom cdm 5554  cfv 6354  (class class class)co 7155   +𝑒 cxad 12504  chash 13689  Vtxcvtx 26780  iEdgciedg 26781  VtxDegcvtxdg 27246
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-rep 5189  ax-sep 5202  ax-nul 5209  ax-pow 5265  ax-pr 5329
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4838  df-iun 4920  df-br 5066  df-opab 5128  df-mpt 5146  df-id 5459  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362  df-ov 7158  df-vtxdg 27247
This theorem is referenced by:  vtxdgfival  27250  vtxdun  27262  vtxdlfgrval  27266  vtxd0nedgb  27269  vtxdushgrfvedg  27271  vtxdginducedm1  27324
  Copyright terms: Public domain W3C validator