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

Theorem vtxdeqd 29411
Description: Equality theorem for the vertex degree: If two graphs are structurally equal, their vertex degree functions are equal. (Contributed by AV, 26-Feb-2021.)
Hypotheses
Ref Expression
vtxdeqd.g (𝜑𝐺𝑋)
vtxdeqd.h (𝜑𝐻𝑌)
vtxdeqd.v (𝜑 → (Vtx‘𝐻) = (Vtx‘𝐺))
vtxdeqd.i (𝜑 → (iEdg‘𝐻) = (iEdg‘𝐺))
Assertion
Ref Expression
vtxdeqd (𝜑 → (VtxDeg‘𝐻) = (VtxDeg‘𝐺))

Proof of Theorem vtxdeqd
Dummy variables 𝑢 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vtxdeqd.v . . 3 (𝜑 → (Vtx‘𝐻) = (Vtx‘𝐺))
2 vtxdeqd.i . . . . . . 7 (𝜑 → (iEdg‘𝐻) = (iEdg‘𝐺))
32dmeqd 5871 . . . . . 6 (𝜑 → dom (iEdg‘𝐻) = dom (iEdg‘𝐺))
42fveq1d 6862 . . . . . . 7 (𝜑 → ((iEdg‘𝐻)‘𝑥) = ((iEdg‘𝐺)‘𝑥))
54eleq2d 2815 . . . . . 6 (𝜑 → (𝑢 ∈ ((iEdg‘𝐻)‘𝑥) ↔ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)))
63, 5rabeqbidv 3427 . . . . 5 (𝜑 → {𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)} = {𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)})
76fveq2d 6864 . . . 4 (𝜑 → (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) = (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}))
84eqeq1d 2732 . . . . . 6 (𝜑 → (((iEdg‘𝐻)‘𝑥) = {𝑢} ↔ ((iEdg‘𝐺)‘𝑥) = {𝑢}))
93, 8rabeqbidv 3427 . . . . 5 (𝜑 → {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}} = {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}})
109fveq2d 6864 . . . 4 (𝜑 → (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}}) = (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}}))
117, 10oveq12d 7407 . . 3 (𝜑 → ((♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}})) = ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}})))
121, 11mpteq12dv 5196 . 2 (𝜑 → (𝑢 ∈ (Vtx‘𝐻) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}}))) = (𝑢 ∈ (Vtx‘𝐺) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}}))))
13 vtxdeqd.h . . 3 (𝜑𝐻𝑌)
14 eqid 2730 . . . 4 (Vtx‘𝐻) = (Vtx‘𝐻)
15 eqid 2730 . . . 4 (iEdg‘𝐻) = (iEdg‘𝐻)
16 eqid 2730 . . . 4 dom (iEdg‘𝐻) = dom (iEdg‘𝐻)
1714, 15, 16vtxdgfval 29401 . . 3 (𝐻𝑌 → (VtxDeg‘𝐻) = (𝑢 ∈ (Vtx‘𝐻) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}}))))
1813, 17syl 17 . 2 (𝜑 → (VtxDeg‘𝐻) = (𝑢 ∈ (Vtx‘𝐻) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}}))))
19 vtxdeqd.g . . 3 (𝜑𝐺𝑋)
20 eqid 2730 . . . 4 (Vtx‘𝐺) = (Vtx‘𝐺)
21 eqid 2730 . . . 4 (iEdg‘𝐺) = (iEdg‘𝐺)
22 eqid 2730 . . . 4 dom (iEdg‘𝐺) = dom (iEdg‘𝐺)
2320, 21, 22vtxdgfval 29401 . . 3 (𝐺𝑋 → (VtxDeg‘𝐺) = (𝑢 ∈ (Vtx‘𝐺) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}}))))
2419, 23syl 17 . 2 (𝜑 → (VtxDeg‘𝐺) = (𝑢 ∈ (Vtx‘𝐺) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +𝑒 (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}}))))
2512, 18, 243eqtr4d 2775 1 (𝜑 → (VtxDeg‘𝐻) = (VtxDeg‘𝐺))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1540  wcel 2109  {crab 3408  {csn 4591  cmpt 5190  dom cdm 5640  cfv 6513  (class class class)co 7389   +𝑒 cxad 13076  chash 14301  Vtxcvtx 28929  iEdgciedg 28930  VtxDegcvtxdg 29399
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5236  ax-sep 5253  ax-nul 5263  ax-pr 5389
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3756  df-csb 3865  df-dif 3919  df-un 3921  df-in 3923  df-ss 3933  df-nul 4299  df-if 4491  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-iun 4959  df-br 5110  df-opab 5172  df-mpt 5191  df-id 5535  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-res 5652  df-ima 5653  df-iota 6466  df-fun 6515  df-fn 6516  df-f 6517  df-f1 6518  df-fo 6519  df-f1o 6520  df-fv 6521  df-ov 7392  df-vtxdg 29400
This theorem is referenced by:  eupthvdres  30170
  Copyright terms: Public domain W3C validator