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

Theorem vtxdgop 30108
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 6929 . . . . . 6 (Vtx‘𝐺) ∈ V
3 fvex 6929 . . . . . 6 (iEdg‘𝐺) ∈ V
42, 3opvtxfvi 29644 . . . . 5 (Vtx‘⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩) = (Vtx‘𝐺)
54eqcomi 2772 . . . 4 (Vtx‘𝐺) = (Vtx‘⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩)
62, 3opiedgfvi 29645 . . . . 5 (iEdg‘⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩) = (iEdg‘𝐺)
76eqcomi 2772 . . . 4 (iEdg‘𝐺) = (iEdg‘⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩)
8 eqid 2763 . . . 4 dom (iEdg‘𝐺) = dom (iEdg‘𝐺)
95, 7, 8vtxdgfval 30105 . . 3 (⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩ ∈ V → (VtxDeg‘⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩) = (𝑢 ∈ (Vtx‘𝐺) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +e (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}}))))
101, 9mp1i 14 . 2 (𝐺 ∈ 𝑊 → (VtxDeg‘⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩) = (𝑢 ∈ (Vtx‘𝐺) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +e (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}}))))
11 df-ov 7454 . . 3 ((Vtx‘𝐺)VtxDeg(iEdg‘𝐺)) = (VtxDeg‘⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩)
1211a1i 11 . 2 (𝐺 ∈ 𝑊 → ((Vtx‘𝐺)VtxDeg(iEdg‘𝐺)) = (VtxDeg‘⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩))
13 eqid 2763 . . 3 (Vtx‘𝐺) = (Vtx‘𝐺)
14 eqid 2763 . . 3 (iEdg‘𝐺) = (iEdg‘𝐺)
1513, 14, 8vtxdgfval 30105 . 2 (𝐺 ∈ 𝑊 → (VtxDeg‘𝐺) = (𝑢 ∈ (Vtx‘𝐺) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +e (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}}))))
1610, 12, 153eqtr4rd 2809 1 (𝐺 ∈ 𝑊 → (VtxDeg‘𝐺) = ((Vtx‘𝐺)VtxDeg(iEdg‘𝐺)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  {crab 3416  Vcvv 3454  {csn 4588  ⟨cop 4840   ↦ cmpt 5192  dom cdm 5658  ‘cfv 6566  (class class class)co 7451   +e cxad 13279  ♯chash 14515  Vtxcvtx 29631  iEdgciedg 29632  VtxDegcvtxdg 30103
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-1st 8035  df-2nd 8036  df-vtx 29633  df-iedg 29634  df-vtxdg 30104
This theorem is used by:  finsumvtxdg2size  30188
  Copyright terms: Public domain W3C validator