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

Theorem vtxdgop 29933
Description: The vertex degree expressed as operation. (Contributed by AV, 12-Dec-2021.)
Assertion
Ref Expression
vtxdgop (𝐺𝑊 → (VtxDeg‘𝐺) = ((Vtx‘𝐺)VtxDeg(iEdg‘𝐺)))

Proof of Theorem vtxdgop
Dummy variables 𝑢 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 opex 5439 . . 3 ⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩ ∈ V
2 fvex 6892 . . . . . 6 (Vtx‘𝐺) ∈ V
3 fvex 6892 . . . . . 6 (iEdg‘𝐺) ∈ V
42, 3opvtxfvi 29469 . . . . 5 (Vtx‘⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩) = (Vtx‘𝐺)
54eqcomi 2769 . . . 4 (Vtx‘𝐺) = (Vtx‘⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩)
62, 3opiedgfvi 29470 . . . . 5 (iEdg‘⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩) = (iEdg‘𝐺)
76eqcomi 2769 . . . 4 (iEdg‘𝐺) = (iEdg‘⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩)
8 eqid 2760 . . . 4 dom (iEdg‘𝐺) = dom (iEdg‘𝐺)
95, 7, 8vtxdgfval 29930 . . 3 (⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩ ∈ V → (VtxDeg‘⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩) = (𝑢 ∈ (Vtx‘𝐺) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}}))))
101, 9mp1i 14 . 2 (𝐺𝑊 → (VtxDeg‘⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩) = (𝑢 ∈ (Vtx‘𝐺) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}}))))
11 df-ov 7417 . . 3 ((Vtx‘𝐺)VtxDeg(iEdg‘𝐺)) = (VtxDeg‘⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩)
1211a1i 11 . 2 (𝐺𝑊 → ((Vtx‘𝐺)VtxDeg(iEdg‘𝐺)) = (VtxDeg‘⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩))
13 eqid 2760 . . 3 (Vtx‘𝐺) = (Vtx‘𝐺)
14 eqid 2760 . . 3 (iEdg‘𝐺) = (iEdg‘𝐺)
1513, 14, 8vtxdgfval 29930 . 2 (𝐺𝑊 → (VtxDeg‘𝐺) = (𝑢 ∈ (Vtx‘𝐺) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}}))))
1610, 12, 153eqtr4rd 2806 1 (𝐺𝑊 → (VtxDeg‘𝐺) = ((Vtx‘𝐺)VtxDeg(iEdg‘𝐺)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wcel 2145  {crab 3412  Vcvv 3450  {csn 4584  cop 4590  cmpt 5186  dom cdm 5655  cfv 6533  (class class class)co 7414   +𝑒 cxad 13164  chash 14397  Vtxcvtx 29456  iEdgciedg 29457  VtxDegcvtxdg 29928
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7737
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7417  df-1st 7987  df-2nd 7988  df-vtx 29458  df-iedg 29459  df-vtxdg 29929
This theorem is used by:  finsumvtxdg2size  30013
  Copyright terms: Public domain W3C validator