Theorem vtxdgval 30079

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‘𝐺)‘𝑈) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +e (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}})))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐺   𝑥,𝑈

Allowed substitution hints:   𝐼(𝑥)   𝑉(𝑥)

Proof of Theorem vtxdgval

Dummy variable 𝑢 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		vtxdgval.v	. . . . 5 ⊢ 𝑉 = (Vtx‘𝐺)
2	1	1vgrex 29610	. . . 4 ⊢ (𝑈 ∈ 𝑉 → 𝐺 ∈ V)
3		vtxdgval.i	. . . . 5 ⊢ 𝐼 = (iEdg‘𝐺)
4		vtxdgval.a	. . . . 5 ⊢ 𝐴 = dom 𝐼
5	1, 3, 4	vtxdgfval 30078	. . . 4 ⊢ (𝐺 ∈ V → (VtxDeg‘𝐺) = (𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +e (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}}))))
6	2, 5	syl 18	. . 3 ⊢ (𝑈 ∈ 𝑉 → (VtxDeg‘𝐺) = (𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +e (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}}))))
7	6	fveq1d 6910	. 2 ⊢ (𝑈 ∈ 𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +e (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})))‘𝑈))
8		eleq1 2852	. . . . . 6 ⊢ (𝑢 = 𝑈 → (𝑢 ∈ (𝐼‘𝑥) ↔ 𝑈 ∈ (𝐼‘𝑥)))
9	8	rabbidv 3423	. . . . 5 ⊢ (𝑢 = 𝑈 → {𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)} = {𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)})
10	9	fveq2d 6912	. . . 4 ⊢ (𝑢 = 𝑈 → (♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) = (♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}))
11		sneq 4594	. . . . . . 7 ⊢ (𝑢 = 𝑈 → {𝑢} = {𝑈})
12	11	eqeq2d 2774	. . . . . 6 ⊢ (𝑢 = 𝑈 → ((𝐼‘𝑥) = {𝑢} ↔ (𝐼‘𝑥) = {𝑈}))
13	12	rabbidv 3423	. . . . 5 ⊢ (𝑢 = 𝑈 → {𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}} = {𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}})
14	13	fveq2d 6912	. . . 4 ⊢ (𝑢 = 𝑈 → (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}}) = (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}}))
15	10, 14	oveq12d 7461	. . 3 ⊢ (𝑢 = 𝑈 → ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +e (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +e (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}})))
16		eqid 2763	. . 3 ⊢ (𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +e (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}}))) = (𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +e (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})))
17		ovex 7476	. . 3 ⊢ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +e (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}})) ∈ V
18	15, 16, 17	fvmpt 7016	. 2 ⊢ (𝑈 ∈ 𝑉 → ((𝑢 ∈ 𝑉 ↦ ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑢 ∈ (𝐼‘𝑥)}) +e (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑢}})))‘𝑈) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +e (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}})))
19	7, 18	eqtrd 2798	1 ⊢ (𝑈 ∈ 𝑉 → ((VtxDeg‘𝐺)‘𝑈) = ((♯‘{𝑥 ∈ 𝐴 ∣ 𝑈 ∈ (𝐼‘𝑥)}) +e (♯‘{𝑥 ∈ 𝐴 ∣ (𝐼‘𝑥) = {𝑈}})))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  {crab 3416  Vcvv 3454  {csn 4588   ↦ cmpt 5189  dom cdm 5655  ‘cfv 6558  (class class class)co 7443   +_e cxad 13266  ♯chash 14501  Vtxcvtx 29604  iEdgciedg 29605  VtxDegcvtxdg 30076

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 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395

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 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  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 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-vtxdg 30077

This theorem is used by:  vtxdgfival  30080  vtxdun  30092  vtxdlfgrval  30096  vtxd0nedgb  30099  vtxdushgrfvedg  30101  vtxdginducedm1  30154