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

Theorem vtxdeqd 30058
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 5887 . . . . . 6 (𝜑 → dom (iEdg‘𝐻) = dom (iEdg‘𝐺))
42fveq1d 6887 . . . . . . 7 (𝜑 → ((iEdg‘𝐻)‘𝑥) = ((iEdg‘𝐺)‘𝑥))
54eleq2d 2847 . . . . . 6 (𝜑 → (𝑢 ∈ ((iEdg‘𝐻)‘𝑥) ↔ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)))
63, 5rabeqbidv 3430 . . . . 5 (𝜑 → {𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)} = {𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)})
76fveq2d 6889 . . . 4 (𝜑 → (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) = (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}))
84eqeq1d 2763 . . . . . 6 (𝜑 → (((iEdg‘𝐻)‘𝑥) = {𝑢} ↔ ((iEdg‘𝐺)‘𝑥) = {𝑢}))
93, 8rabeqbidv 3430 . . . . 5 (𝜑 → {𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}} = {𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}})
109fveq2d 6889 . . . 4 (𝜑 → (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}}) = (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}}))
117, 10oveq12d 7438 . . 3 (𝜑 → ((♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) +e (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}})) = ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +e (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}})))
121, 11mpteq12dv 5192 . 2 (𝜑 → (𝑢 ∈ (Vtx‘𝐻) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) +e (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}}))) = (𝑢 ∈ (Vtx‘𝐺) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +e (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}}))))
13 vtxdeqd.h . . 3 (𝜑 → 𝐻 ∈ 𝑌)
14 eqid 2761 . . . 4 (Vtx‘𝐻) = (Vtx‘𝐻)
15 eqid 2761 . . . 4 (iEdg‘𝐻) = (iEdg‘𝐻)
16 eqid 2761 . . . 4 dom (iEdg‘𝐻) = dom (iEdg‘𝐻)
1714, 15, 16vtxdgfval 30048 . . 3 (𝐻 ∈ 𝑌 → (VtxDeg‘𝐻) = (𝑢 ∈ (Vtx‘𝐻) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) +e (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}}))))
1813, 17syl 18 . 2 (𝜑 → (VtxDeg‘𝐻) = (𝑢 ∈ (Vtx‘𝐻) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ 𝑢 ∈ ((iEdg‘𝐻)‘𝑥)}) +e (♯‘{𝑥 ∈ dom (iEdg‘𝐻) ∣ ((iEdg‘𝐻)‘𝑥) = {𝑢}}))))
19 vtxdeqd.g . . 3 (𝜑 → 𝐺 ∈ 𝑋)
20 eqid 2761 . . . 4 (Vtx‘𝐺) = (Vtx‘𝐺)
21 eqid 2761 . . . 4 (iEdg‘𝐺) = (iEdg‘𝐺)
22 eqid 2761 . . . 4 dom (iEdg‘𝐺) = dom (iEdg‘𝐺)
2320, 21, 22vtxdgfval 30048 . . 3 (𝐺 ∈ 𝑋 → (VtxDeg‘𝐺) = (𝑢 ∈ (Vtx‘𝐺) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +e (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}}))))
2419, 23syl 18 . 2 (𝜑 → (VtxDeg‘𝐺) = (𝑢 ∈ (Vtx‘𝐺) ↦ ((♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ 𝑢 ∈ ((iEdg‘𝐺)‘𝑥)}) +e (♯‘{𝑥 ∈ dom (iEdg‘𝐺) ∣ ((iEdg‘𝐺)‘𝑥) = {𝑢}}))))
2512, 18, 243eqtr4d 2806 1 (𝜑 → (VtxDeg‘𝐻) = (VtxDeg‘𝐺))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  {crab 3413  {csn 4584   ↦ cmpt 5186  dom cdm 5651  ‘cfv 6538  (class class class)co 7420   +e cxad 13239  ♯chash 14474  Vtxcvtx 29574  iEdgciedg 29575  VtxDegcvtxdg 30046
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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  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 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  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 7423  df-vtxdg 30047
This theorem is used by:  eupthvdres  30836
  Copyright terms: Public domain W3C validator