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

Theorem finsumvtxdg2size 26502
Description: The sum of the degrees of all vertices of a finite pseudograph of finite size is twice the size of the pseudograph. See equation (1) in section I.1 in [Bollobas] p. 4. Here, the "proof" is simply the statement "Since each edge has two endvertices, the sum of the degrees is exactly twice the number of edges". The formal proof of this theorem (for pseudographs) is much more complicated, taking also the used auxiliary theorems into account. The proof for a (finite) simple graph (see fusgr1th 26503) would be shorter, but nevertheless still laborious. Although this theorem would hold also for infinite pseudographs and pseudographs of infinite size, the proof of this most general version (see theorem "sumvtxdg2size" below) would require many more auxiliary theorems (e.g., the extension of the sum Σ over an arbitrary set).

I dedicate this theorem and its proof to Norman Megill, who deceased too early on December 9, 2021. This proof is an example for the rigor which was the main motivation for Norman Megill to invent and develop Metamath, see section 1.1.6 "Rigor" on page 19 of the Metamath book: "... it is usually assumed in mathematical literature that the person reading the proof is a mathematician familiar with the specialty being described, and that the missing steps are obvious to such a reader or at least the reader is capable of filling them in." I filled in the missing steps of Bollobas' proof as Norm would have liked it... (Contributed by Alexander van der Vekens, 19-Dec-2021.)

Hypotheses
Ref Expression
sumvtxdg2size.v 𝑉 = (Vtx‘𝐺)
sumvtxdg2size.i 𝐼 = (iEdg‘𝐺)
sumvtxdg2size.d 𝐷 = (VtxDeg‘𝐺)
Assertion
Ref Expression
finsumvtxdg2size ((𝐺 ∈ UPGraph ∧ 𝑉 ∈ Fin ∧ 𝐼 ∈ Fin) → Σ𝑣𝑉 (𝐷𝑣) = (2 · (#‘𝐼)))
Distinct variable groups:   𝑣,𝐺   𝑣,𝑉
Allowed substitution hints:   𝐷(𝑣)   𝐼(𝑣)

Proof of Theorem finsumvtxdg2size
Dummy variables 𝑒 𝑘 𝑛 𝑓 𝑖 𝑤 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 upgrop 26034 . . . 4 (𝐺 ∈ UPGraph → ⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩ ∈ UPGraph)
2 fvex 6239 . . . . . 6 (iEdg‘𝐺) ∈ V
3 fvex 6239 . . . . . . 7 (iEdg‘⟨𝑘, 𝑒⟩) ∈ V
43resex 5478 . . . . . 6 ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}) ∈ V
5 eleq1 2718 . . . . . . . 8 (𝑒 = (iEdg‘𝐺) → (𝑒 ∈ Fin ↔ (iEdg‘𝐺) ∈ Fin))
65adantl 481 . . . . . . 7 ((𝑘 = (Vtx‘𝐺) ∧ 𝑒 = (iEdg‘𝐺)) → (𝑒 ∈ Fin ↔ (iEdg‘𝐺) ∈ Fin))
7 simpl 472 . . . . . . . . 9 ((𝑘 = (Vtx‘𝐺) ∧ 𝑒 = (iEdg‘𝐺)) → 𝑘 = (Vtx‘𝐺))
8 oveq12 6699 . . . . . . . . . . 11 ((𝑘 = (Vtx‘𝐺) ∧ 𝑒 = (iEdg‘𝐺)) → (𝑘VtxDeg𝑒) = ((Vtx‘𝐺)VtxDeg(iEdg‘𝐺)))
98fveq1d 6231 . . . . . . . . . 10 ((𝑘 = (Vtx‘𝐺) ∧ 𝑒 = (iEdg‘𝐺)) → ((𝑘VtxDeg𝑒)‘𝑣) = (((Vtx‘𝐺)VtxDeg(iEdg‘𝐺))‘𝑣))
109adantr 480 . . . . . . . . 9 (((𝑘 = (Vtx‘𝐺) ∧ 𝑒 = (iEdg‘𝐺)) ∧ 𝑣𝑘) → ((𝑘VtxDeg𝑒)‘𝑣) = (((Vtx‘𝐺)VtxDeg(iEdg‘𝐺))‘𝑣))
117, 10sumeq12dv 14481 . . . . . . . 8 ((𝑘 = (Vtx‘𝐺) ∧ 𝑒 = (iEdg‘𝐺)) → Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = Σ𝑣 ∈ (Vtx‘𝐺)(((Vtx‘𝐺)VtxDeg(iEdg‘𝐺))‘𝑣))
12 fveq2 6229 . . . . . . . . . 10 (𝑒 = (iEdg‘𝐺) → (#‘𝑒) = (#‘(iEdg‘𝐺)))
1312oveq2d 6706 . . . . . . . . 9 (𝑒 = (iEdg‘𝐺) → (2 · (#‘𝑒)) = (2 · (#‘(iEdg‘𝐺))))
1413adantl 481 . . . . . . . 8 ((𝑘 = (Vtx‘𝐺) ∧ 𝑒 = (iEdg‘𝐺)) → (2 · (#‘𝑒)) = (2 · (#‘(iEdg‘𝐺))))
1511, 14eqeq12d 2666 . . . . . . 7 ((𝑘 = (Vtx‘𝐺) ∧ 𝑒 = (iEdg‘𝐺)) → (Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = (2 · (#‘𝑒)) ↔ Σ𝑣 ∈ (Vtx‘𝐺)(((Vtx‘𝐺)VtxDeg(iEdg‘𝐺))‘𝑣) = (2 · (#‘(iEdg‘𝐺)))))
166, 15imbi12d 333 . . . . . 6 ((𝑘 = (Vtx‘𝐺) ∧ 𝑒 = (iEdg‘𝐺)) → ((𝑒 ∈ Fin → Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = (2 · (#‘𝑒))) ↔ ((iEdg‘𝐺) ∈ Fin → Σ𝑣 ∈ (Vtx‘𝐺)(((Vtx‘𝐺)VtxDeg(iEdg‘𝐺))‘𝑣) = (2 · (#‘(iEdg‘𝐺))))))
17 eleq1 2718 . . . . . . . 8 (𝑒 = 𝑓 → (𝑒 ∈ Fin ↔ 𝑓 ∈ Fin))
1817adantl 481 . . . . . . 7 ((𝑘 = 𝑤𝑒 = 𝑓) → (𝑒 ∈ Fin ↔ 𝑓 ∈ Fin))
19 simpl 472 . . . . . . . . 9 ((𝑘 = 𝑤𝑒 = 𝑓) → 𝑘 = 𝑤)
20 oveq12 6699 . . . . . . . . . . . 12 ((𝑘 = 𝑤𝑒 = 𝑓) → (𝑘VtxDeg𝑒) = (𝑤VtxDeg𝑓))
21 df-ov 6693 . . . . . . . . . . . 12 (𝑤VtxDeg𝑓) = (VtxDeg‘⟨𝑤, 𝑓⟩)
2220, 21syl6eq 2701 . . . . . . . . . . 11 ((𝑘 = 𝑤𝑒 = 𝑓) → (𝑘VtxDeg𝑒) = (VtxDeg‘⟨𝑤, 𝑓⟩))
2322fveq1d 6231 . . . . . . . . . 10 ((𝑘 = 𝑤𝑒 = 𝑓) → ((𝑘VtxDeg𝑒)‘𝑣) = ((VtxDeg‘⟨𝑤, 𝑓⟩)‘𝑣))
2423adantr 480 . . . . . . . . 9 (((𝑘 = 𝑤𝑒 = 𝑓) ∧ 𝑣𝑘) → ((𝑘VtxDeg𝑒)‘𝑣) = ((VtxDeg‘⟨𝑤, 𝑓⟩)‘𝑣))
2519, 24sumeq12dv 14481 . . . . . . . 8 ((𝑘 = 𝑤𝑒 = 𝑓) → Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = Σ𝑣𝑤 ((VtxDeg‘⟨𝑤, 𝑓⟩)‘𝑣))
26 fveq2 6229 . . . . . . . . . 10 (𝑒 = 𝑓 → (#‘𝑒) = (#‘𝑓))
2726oveq2d 6706 . . . . . . . . 9 (𝑒 = 𝑓 → (2 · (#‘𝑒)) = (2 · (#‘𝑓)))
2827adantl 481 . . . . . . . 8 ((𝑘 = 𝑤𝑒 = 𝑓) → (2 · (#‘𝑒)) = (2 · (#‘𝑓)))
2925, 28eqeq12d 2666 . . . . . . 7 ((𝑘 = 𝑤𝑒 = 𝑓) → (Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = (2 · (#‘𝑒)) ↔ Σ𝑣𝑤 ((VtxDeg‘⟨𝑤, 𝑓⟩)‘𝑣) = (2 · (#‘𝑓))))
3018, 29imbi12d 333 . . . . . 6 ((𝑘 = 𝑤𝑒 = 𝑓) → ((𝑒 ∈ Fin → Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = (2 · (#‘𝑒))) ↔ (𝑓 ∈ Fin → Σ𝑣𝑤 ((VtxDeg‘⟨𝑤, 𝑓⟩)‘𝑣) = (2 · (#‘𝑓)))))
31 vex 3234 . . . . . . . . 9 𝑘 ∈ V
32 vex 3234 . . . . . . . . 9 𝑒 ∈ V
3331, 32opvtxfvi 25934 . . . . . . . 8 (Vtx‘⟨𝑘, 𝑒⟩) = 𝑘
3433eqcomi 2660 . . . . . . 7 𝑘 = (Vtx‘⟨𝑘, 𝑒⟩)
35 eqid 2651 . . . . . . 7 (iEdg‘⟨𝑘, 𝑒⟩) = (iEdg‘⟨𝑘, 𝑒⟩)
36 eqid 2651 . . . . . . 7 {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)} = {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}
37 eqid 2651 . . . . . . 7 ⟨(𝑘 ∖ {𝑛}), ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})⟩ = ⟨(𝑘 ∖ {𝑛}), ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})⟩
3834, 35, 36, 37upgrres 26243 . . . . . 6 ((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ 𝑛𝑘) → ⟨(𝑘 ∖ {𝑛}), ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})⟩ ∈ UPGraph)
39 eleq1 2718 . . . . . . . 8 (𝑓 = ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}) → (𝑓 ∈ Fin ↔ ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}) ∈ Fin))
4039adantl 481 . . . . . . 7 ((𝑤 = (𝑘 ∖ {𝑛}) ∧ 𝑓 = ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})) → (𝑓 ∈ Fin ↔ ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}) ∈ Fin))
41 simpl 472 . . . . . . . . 9 ((𝑤 = (𝑘 ∖ {𝑛}) ∧ 𝑓 = ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})) → 𝑤 = (𝑘 ∖ {𝑛}))
42 opeq12 4435 . . . . . . . . . . . 12 ((𝑤 = (𝑘 ∖ {𝑛}) ∧ 𝑓 = ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})) → ⟨𝑤, 𝑓⟩ = ⟨(𝑘 ∖ {𝑛}), ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})⟩)
4342fveq2d 6233 . . . . . . . . . . 11 ((𝑤 = (𝑘 ∖ {𝑛}) ∧ 𝑓 = ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})) → (VtxDeg‘⟨𝑤, 𝑓⟩) = (VtxDeg‘⟨(𝑘 ∖ {𝑛}), ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})⟩))
4443fveq1d 6231 . . . . . . . . . 10 ((𝑤 = (𝑘 ∖ {𝑛}) ∧ 𝑓 = ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})) → ((VtxDeg‘⟨𝑤, 𝑓⟩)‘𝑣) = ((VtxDeg‘⟨(𝑘 ∖ {𝑛}), ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})⟩)‘𝑣))
4544adantr 480 . . . . . . . . 9 (((𝑤 = (𝑘 ∖ {𝑛}) ∧ 𝑓 = ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})) ∧ 𝑣𝑤) → ((VtxDeg‘⟨𝑤, 𝑓⟩)‘𝑣) = ((VtxDeg‘⟨(𝑘 ∖ {𝑛}), ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})⟩)‘𝑣))
4641, 45sumeq12dv 14481 . . . . . . . 8 ((𝑤 = (𝑘 ∖ {𝑛}) ∧ 𝑓 = ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})) → Σ𝑣𝑤 ((VtxDeg‘⟨𝑤, 𝑓⟩)‘𝑣) = Σ𝑣 ∈ (𝑘 ∖ {𝑛})((VtxDeg‘⟨(𝑘 ∖ {𝑛}), ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})⟩)‘𝑣))
47 fveq2 6229 . . . . . . . . . 10 (𝑓 = ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}) → (#‘𝑓) = (#‘((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})))
4847oveq2d 6706 . . . . . . . . 9 (𝑓 = ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}) → (2 · (#‘𝑓)) = (2 · (#‘((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}))))
4948adantl 481 . . . . . . . 8 ((𝑤 = (𝑘 ∖ {𝑛}) ∧ 𝑓 = ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})) → (2 · (#‘𝑓)) = (2 · (#‘((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}))))
5046, 49eqeq12d 2666 . . . . . . 7 ((𝑤 = (𝑘 ∖ {𝑛}) ∧ 𝑓 = ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})) → (Σ𝑣𝑤 ((VtxDeg‘⟨𝑤, 𝑓⟩)‘𝑣) = (2 · (#‘𝑓)) ↔ Σ𝑣 ∈ (𝑘 ∖ {𝑛})((VtxDeg‘⟨(𝑘 ∖ {𝑛}), ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})⟩)‘𝑣) = (2 · (#‘((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})))))
5140, 50imbi12d 333 . . . . . 6 ((𝑤 = (𝑘 ∖ {𝑛}) ∧ 𝑓 = ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})) → ((𝑓 ∈ Fin → Σ𝑣𝑤 ((VtxDeg‘⟨𝑤, 𝑓⟩)‘𝑣) = (2 · (#‘𝑓))) ↔ (((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}) ∈ Fin → Σ𝑣 ∈ (𝑘 ∖ {𝑛})((VtxDeg‘⟨(𝑘 ∖ {𝑛}), ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})⟩)‘𝑣) = (2 · (#‘((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}))))))
52 hasheq0 13192 . . . . . . . . 9 (𝑘 ∈ V → ((#‘𝑘) = 0 ↔ 𝑘 = ∅))
5331, 52ax-mp 5 . . . . . . . 8 ((#‘𝑘) = 0 ↔ 𝑘 = ∅)
54 2t0e0 11221 . . . . . . . . . 10 (2 · 0) = 0
5554a1i 11 . . . . . . . . 9 ((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ 𝑘 = ∅) → (2 · 0) = 0)
5631, 32opiedgfvi 25935 . . . . . . . . . . . . 13 (iEdg‘⟨𝑘, 𝑒⟩) = 𝑒
5756eqcomi 2660 . . . . . . . . . . . 12 𝑒 = (iEdg‘⟨𝑘, 𝑒⟩)
58 upgruhgr 26042 . . . . . . . . . . . . . 14 (⟨𝑘, 𝑒⟩ ∈ UPGraph → ⟨𝑘, 𝑒⟩ ∈ UHGraph)
5958adantr 480 . . . . . . . . . . . . 13 ((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ 𝑘 = ∅) → ⟨𝑘, 𝑒⟩ ∈ UHGraph)
6034eqeq1i 2656 . . . . . . . . . . . . . 14 (𝑘 = ∅ ↔ (Vtx‘⟨𝑘, 𝑒⟩) = ∅)
61 uhgr0vb 26012 . . . . . . . . . . . . . 14 ((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ (Vtx‘⟨𝑘, 𝑒⟩) = ∅) → (⟨𝑘, 𝑒⟩ ∈ UHGraph ↔ (iEdg‘⟨𝑘, 𝑒⟩) = ∅))
6260, 61sylan2b 491 . . . . . . . . . . . . 13 ((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ 𝑘 = ∅) → (⟨𝑘, 𝑒⟩ ∈ UHGraph ↔ (iEdg‘⟨𝑘, 𝑒⟩) = ∅))
6359, 62mpbid 222 . . . . . . . . . . . 12 ((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ 𝑘 = ∅) → (iEdg‘⟨𝑘, 𝑒⟩) = ∅)
6457, 63syl5eq 2697 . . . . . . . . . . 11 ((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ 𝑘 = ∅) → 𝑒 = ∅)
65 hasheq0 13192 . . . . . . . . . . . 12 (𝑒 ∈ V → ((#‘𝑒) = 0 ↔ 𝑒 = ∅))
6632, 65ax-mp 5 . . . . . . . . . . 11 ((#‘𝑒) = 0 ↔ 𝑒 = ∅)
6764, 66sylibr 224 . . . . . . . . . 10 ((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ 𝑘 = ∅) → (#‘𝑒) = 0)
6867oveq2d 6706 . . . . . . . . 9 ((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ 𝑘 = ∅) → (2 · (#‘𝑒)) = (2 · 0))
69 sumeq1 14463 . . . . . . . . . . 11 (𝑘 = ∅ → Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = Σ𝑣 ∈ ∅ ((𝑘VtxDeg𝑒)‘𝑣))
70 sum0 14496 . . . . . . . . . . 11 Σ𝑣 ∈ ∅ ((𝑘VtxDeg𝑒)‘𝑣) = 0
7169, 70syl6eq 2701 . . . . . . . . . 10 (𝑘 = ∅ → Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = 0)
7271adantl 481 . . . . . . . . 9 ((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ 𝑘 = ∅) → Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = 0)
7355, 68, 723eqtr4rd 2696 . . . . . . . 8 ((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ 𝑘 = ∅) → Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = (2 · (#‘𝑒)))
7453, 73sylan2b 491 . . . . . . 7 ((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ (#‘𝑘) = 0) → Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = (2 · (#‘𝑒)))
7574a1d 25 . . . . . 6 ((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ (#‘𝑘) = 0) → (𝑒 ∈ Fin → Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = (2 · (#‘𝑒))))
76 eleq1 2718 . . . . . . . . . . 11 ((𝑦 + 1) = (#‘𝑘) → ((𝑦 + 1) ∈ ℕ0 ↔ (#‘𝑘) ∈ ℕ0))
7776eqcoms 2659 . . . . . . . . . 10 ((#‘𝑘) = (𝑦 + 1) → ((𝑦 + 1) ∈ ℕ0 ↔ (#‘𝑘) ∈ ℕ0))
78773ad2ant2 1103 . . . . . . . . 9 ((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ (#‘𝑘) = (𝑦 + 1) ∧ 𝑛𝑘) → ((𝑦 + 1) ∈ ℕ0 ↔ (#‘𝑘) ∈ ℕ0))
79 hashclb 13187 . . . . . . . . . . . 12 (𝑘 ∈ V → (𝑘 ∈ Fin ↔ (#‘𝑘) ∈ ℕ0))
8079biimprd 238 . . . . . . . . . . 11 (𝑘 ∈ V → ((#‘𝑘) ∈ ℕ0𝑘 ∈ Fin))
8131, 80ax-mp 5 . . . . . . . . . 10 ((#‘𝑘) ∈ ℕ0𝑘 ∈ Fin)
82 eqid 2651 . . . . . . . . . . . . . . 15 (𝑘 ∖ {𝑛}) = (𝑘 ∖ {𝑛})
83 eqid 2651 . . . . . . . . . . . . . . 15 {𝑖 ∈ dom 𝑒𝑛 ∉ (𝑒𝑖)} = {𝑖 ∈ dom 𝑒𝑛 ∉ (𝑒𝑖)}
8456dmeqi 5357 . . . . . . . . . . . . . . . . . 18 dom (iEdg‘⟨𝑘, 𝑒⟩) = dom 𝑒
8584rabeqi 3224 . . . . . . . . . . . . . . . . 17 {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)} = {𝑖 ∈ dom 𝑒𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}
86 eqidd 2652 . . . . . . . . . . . . . . . . . . 19 (𝑖 ∈ dom 𝑒𝑛 = 𝑛)
8756a1i 11 . . . . . . . . . . . . . . . . . . . 20 (𝑖 ∈ dom 𝑒 → (iEdg‘⟨𝑘, 𝑒⟩) = 𝑒)
8887fveq1d 6231 . . . . . . . . . . . . . . . . . . 19 (𝑖 ∈ dom 𝑒 → ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖) = (𝑒𝑖))
8986, 88neleq12d 2930 . . . . . . . . . . . . . . . . . 18 (𝑖 ∈ dom 𝑒 → (𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖) ↔ 𝑛 ∉ (𝑒𝑖)))
9089rabbiia 3215 . . . . . . . . . . . . . . . . 17 {𝑖 ∈ dom 𝑒𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)} = {𝑖 ∈ dom 𝑒𝑛 ∉ (𝑒𝑖)}
9185, 90eqtri 2673 . . . . . . . . . . . . . . . 16 {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)} = {𝑖 ∈ dom 𝑒𝑛 ∉ (𝑒𝑖)}
9256, 91reseq12i 5426 . . . . . . . . . . . . . . 15 ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}) = (𝑒 ↾ {𝑖 ∈ dom 𝑒𝑛 ∉ (𝑒𝑖)})
9334, 57, 82, 83, 92, 37finsumvtxdg2sstep 26501 . . . . . . . . . . . . . 14 (((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ 𝑛𝑘) ∧ (𝑘 ∈ Fin ∧ 𝑒 ∈ Fin)) → ((((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}) ∈ Fin → Σ𝑣 ∈ (𝑘 ∖ {𝑛})((VtxDeg‘⟨(𝑘 ∖ {𝑛}), ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})⟩)‘𝑣) = (2 · (#‘((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})))) → Σ𝑣𝑘 ((VtxDeg‘⟨𝑘, 𝑒⟩)‘𝑣) = (2 · (#‘𝑒))))
94 df-ov 6693 . . . . . . . . . . . . . . . . . 18 (𝑘VtxDeg𝑒) = (VtxDeg‘⟨𝑘, 𝑒⟩)
9594fveq1i 6230 . . . . . . . . . . . . . . . . 17 ((𝑘VtxDeg𝑒)‘𝑣) = ((VtxDeg‘⟨𝑘, 𝑒⟩)‘𝑣)
9695a1i 11 . . . . . . . . . . . . . . . 16 (𝑣𝑘 → ((𝑘VtxDeg𝑒)‘𝑣) = ((VtxDeg‘⟨𝑘, 𝑒⟩)‘𝑣))
9796sumeq2i 14473 . . . . . . . . . . . . . . 15 Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = Σ𝑣𝑘 ((VtxDeg‘⟨𝑘, 𝑒⟩)‘𝑣)
9897eqeq1i 2656 . . . . . . . . . . . . . 14 𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = (2 · (#‘𝑒)) ↔ Σ𝑣𝑘 ((VtxDeg‘⟨𝑘, 𝑒⟩)‘𝑣) = (2 · (#‘𝑒)))
9993, 98syl6ibr 242 . . . . . . . . . . . . 13 (((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ 𝑛𝑘) ∧ (𝑘 ∈ Fin ∧ 𝑒 ∈ Fin)) → ((((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}) ∈ Fin → Σ𝑣 ∈ (𝑘 ∖ {𝑛})((VtxDeg‘⟨(𝑘 ∖ {𝑛}), ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})⟩)‘𝑣) = (2 · (#‘((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})))) → Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = (2 · (#‘𝑒))))
10099exp32 630 . . . . . . . . . . . 12 ((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ 𝑛𝑘) → (𝑘 ∈ Fin → (𝑒 ∈ Fin → ((((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}) ∈ Fin → Σ𝑣 ∈ (𝑘 ∖ {𝑛})((VtxDeg‘⟨(𝑘 ∖ {𝑛}), ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})⟩)‘𝑣) = (2 · (#‘((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})))) → Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = (2 · (#‘𝑒))))))
101100com34 91 . . . . . . . . . . 11 ((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ 𝑛𝑘) → (𝑘 ∈ Fin → ((((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}) ∈ Fin → Σ𝑣 ∈ (𝑘 ∖ {𝑛})((VtxDeg‘⟨(𝑘 ∖ {𝑛}), ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})⟩)‘𝑣) = (2 · (#‘((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})))) → (𝑒 ∈ Fin → Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = (2 · (#‘𝑒))))))
1021013adant2 1100 . . . . . . . . . 10 ((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ (#‘𝑘) = (𝑦 + 1) ∧ 𝑛𝑘) → (𝑘 ∈ Fin → ((((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}) ∈ Fin → Σ𝑣 ∈ (𝑘 ∖ {𝑛})((VtxDeg‘⟨(𝑘 ∖ {𝑛}), ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})⟩)‘𝑣) = (2 · (#‘((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})))) → (𝑒 ∈ Fin → Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = (2 · (#‘𝑒))))))
10381, 102syl5 34 . . . . . . . . 9 ((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ (#‘𝑘) = (𝑦 + 1) ∧ 𝑛𝑘) → ((#‘𝑘) ∈ ℕ0 → ((((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}) ∈ Fin → Σ𝑣 ∈ (𝑘 ∖ {𝑛})((VtxDeg‘⟨(𝑘 ∖ {𝑛}), ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})⟩)‘𝑣) = (2 · (#‘((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})))) → (𝑒 ∈ Fin → Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = (2 · (#‘𝑒))))))
10478, 103sylbid 230 . . . . . . . 8 ((⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ (#‘𝑘) = (𝑦 + 1) ∧ 𝑛𝑘) → ((𝑦 + 1) ∈ ℕ0 → ((((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}) ∈ Fin → Σ𝑣 ∈ (𝑘 ∖ {𝑛})((VtxDeg‘⟨(𝑘 ∖ {𝑛}), ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})⟩)‘𝑣) = (2 · (#‘((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})))) → (𝑒 ∈ Fin → Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = (2 · (#‘𝑒))))))
105104impcom 445 . . . . . . 7 (((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ (#‘𝑘) = (𝑦 + 1) ∧ 𝑛𝑘)) → ((((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}) ∈ Fin → Σ𝑣 ∈ (𝑘 ∖ {𝑛})((VtxDeg‘⟨(𝑘 ∖ {𝑛}), ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})⟩)‘𝑣) = (2 · (#‘((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})))) → (𝑒 ∈ Fin → Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = (2 · (#‘𝑒)))))
106105imp 444 . . . . . 6 ((((𝑦 + 1) ∈ ℕ0 ∧ (⟨𝑘, 𝑒⟩ ∈ UPGraph ∧ (#‘𝑘) = (𝑦 + 1) ∧ 𝑛𝑘)) ∧ (((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}) ∈ Fin → Σ𝑣 ∈ (𝑘 ∖ {𝑛})((VtxDeg‘⟨(𝑘 ∖ {𝑛}), ((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)})⟩)‘𝑣) = (2 · (#‘((iEdg‘⟨𝑘, 𝑒⟩) ↾ {𝑖 ∈ dom (iEdg‘⟨𝑘, 𝑒⟩) ∣ 𝑛 ∉ ((iEdg‘⟨𝑘, 𝑒⟩)‘𝑖)}))))) → (𝑒 ∈ Fin → Σ𝑣𝑘 ((𝑘VtxDeg𝑒)‘𝑣) = (2 · (#‘𝑒))))
1072, 4, 16, 30, 38, 51, 75, 106opfi1ind 13322 . . . . 5 ((⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩ ∈ UPGraph ∧ (Vtx‘𝐺) ∈ Fin) → ((iEdg‘𝐺) ∈ Fin → Σ𝑣 ∈ (Vtx‘𝐺)(((Vtx‘𝐺)VtxDeg(iEdg‘𝐺))‘𝑣) = (2 · (#‘(iEdg‘𝐺)))))
108107ex 449 . . . 4 (⟨(Vtx‘𝐺), (iEdg‘𝐺)⟩ ∈ UPGraph → ((Vtx‘𝐺) ∈ Fin → ((iEdg‘𝐺) ∈ Fin → Σ𝑣 ∈ (Vtx‘𝐺)(((Vtx‘𝐺)VtxDeg(iEdg‘𝐺))‘𝑣) = (2 · (#‘(iEdg‘𝐺))))))
1091, 108syl 17 . . 3 (𝐺 ∈ UPGraph → ((Vtx‘𝐺) ∈ Fin → ((iEdg‘𝐺) ∈ Fin → Σ𝑣 ∈ (Vtx‘𝐺)(((Vtx‘𝐺)VtxDeg(iEdg‘𝐺))‘𝑣) = (2 · (#‘(iEdg‘𝐺))))))
110 sumvtxdg2size.v . . . . 5 𝑉 = (Vtx‘𝐺)
111110eleq1i 2721 . . . 4 (𝑉 ∈ Fin ↔ (Vtx‘𝐺) ∈ Fin)
112111a1i 11 . . 3 (𝐺 ∈ UPGraph → (𝑉 ∈ Fin ↔ (Vtx‘𝐺) ∈ Fin))
113 sumvtxdg2size.i . . . . . 6 𝐼 = (iEdg‘𝐺)
114113eleq1i 2721 . . . . 5 (𝐼 ∈ Fin ↔ (iEdg‘𝐺) ∈ Fin)
115114a1i 11 . . . 4 (𝐺 ∈ UPGraph → (𝐼 ∈ Fin ↔ (iEdg‘𝐺) ∈ Fin))
116110a1i 11 . . . . . 6 (𝐺 ∈ UPGraph → 𝑉 = (Vtx‘𝐺))
117 sumvtxdg2size.d . . . . . . . . 9 𝐷 = (VtxDeg‘𝐺)
118 vtxdgop 26422 . . . . . . . . 9 (𝐺 ∈ UPGraph → (VtxDeg‘𝐺) = ((Vtx‘𝐺)VtxDeg(iEdg‘𝐺)))
119117, 118syl5eq 2697 . . . . . . . 8 (𝐺 ∈ UPGraph → 𝐷 = ((Vtx‘𝐺)VtxDeg(iEdg‘𝐺)))
120119fveq1d 6231 . . . . . . 7 (𝐺 ∈ UPGraph → (𝐷𝑣) = (((Vtx‘𝐺)VtxDeg(iEdg‘𝐺))‘𝑣))
121120adantr 480 . . . . . 6 ((𝐺 ∈ UPGraph ∧ 𝑣𝑉) → (𝐷𝑣) = (((Vtx‘𝐺)VtxDeg(iEdg‘𝐺))‘𝑣))
122116, 121sumeq12dv 14481 . . . . 5 (𝐺 ∈ UPGraph → Σ𝑣𝑉 (𝐷𝑣) = Σ𝑣 ∈ (Vtx‘𝐺)(((Vtx‘𝐺)VtxDeg(iEdg‘𝐺))‘𝑣))
123113fveq2i 6232 . . . . . . 7 (#‘𝐼) = (#‘(iEdg‘𝐺))
124123oveq2i 6701 . . . . . 6 (2 · (#‘𝐼)) = (2 · (#‘(iEdg‘𝐺)))
125124a1i 11 . . . . 5 (𝐺 ∈ UPGraph → (2 · (#‘𝐼)) = (2 · (#‘(iEdg‘𝐺))))
126122, 125eqeq12d 2666 . . . 4 (𝐺 ∈ UPGraph → (Σ𝑣𝑉 (𝐷𝑣) = (2 · (#‘𝐼)) ↔ Σ𝑣 ∈ (Vtx‘𝐺)(((Vtx‘𝐺)VtxDeg(iEdg‘𝐺))‘𝑣) = (2 · (#‘(iEdg‘𝐺)))))
127115, 126imbi12d 333 . . 3 (𝐺 ∈ UPGraph → ((𝐼 ∈ Fin → Σ𝑣𝑉 (𝐷𝑣) = (2 · (#‘𝐼))) ↔ ((iEdg‘𝐺) ∈ Fin → Σ𝑣 ∈ (Vtx‘𝐺)(((Vtx‘𝐺)VtxDeg(iEdg‘𝐺))‘𝑣) = (2 · (#‘(iEdg‘𝐺))))))
128109, 112, 1273imtr4d 283 . 2 (𝐺 ∈ UPGraph → (𝑉 ∈ Fin → (𝐼 ∈ Fin → Σ𝑣𝑉 (𝐷𝑣) = (2 · (#‘𝐼)))))
1291283imp 1275 1 ((𝐺 ∈ UPGraph ∧ 𝑉 ∈ Fin ∧ 𝐼 ∈ Fin) → Σ𝑣𝑉 (𝐷𝑣) = (2 · (#‘𝐼)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 383  w3a 1054   = wceq 1523  wcel 2030  wnel 2926  {crab 2945  Vcvv 3231  cdif 3604  c0 3948  {csn 4210  cop 4216  dom cdm 5143  cres 5145  cfv 5926  (class class class)co 6690  Fincfn 7997  0cc0 9974  1c1 9975   + caddc 9977   · cmul 9979  2c2 11108  0cn0 11330  #chash 13157  Σcsu 14460  Vtxcvtx 25919  iEdgciedg 25920  UHGraphcuhgr 25996  UPGraphcupgr 26020  VtxDegcvtxdg 26417
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-8 2032  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-rep 4804  ax-sep 4814  ax-nul 4822  ax-pow 4873  ax-pr 4936  ax-un 6991  ax-inf2 8576  ax-cnex 10030  ax-resscn 10031  ax-1cn 10032  ax-icn 10033  ax-addcl 10034  ax-addrcl 10035  ax-mulcl 10036  ax-mulrcl 10037  ax-mulcom 10038  ax-addass 10039  ax-mulass 10040  ax-distr 10041  ax-i2m1 10042  ax-1ne0 10043  ax-1rid 10044  ax-rnegex 10045  ax-rrecex 10046  ax-cnre 10047  ax-pre-lttri 10048  ax-pre-lttrn 10049  ax-pre-ltadd 10050  ax-pre-mulgt0 10051  ax-pre-sup 10052
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  df-fal 1529  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-nel 2927  df-ral 2946  df-rex 2947  df-reu 2948  df-rmo 2949  df-rab 2950  df-v 3233  df-sbc 3469  df-csb 3567  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-pss 3623  df-nul 3949  df-if 4120  df-pw 4193  df-sn 4211  df-pr 4213  df-tp 4215  df-op 4217  df-uni 4469  df-int 4508  df-iun 4554  df-disj 4653  df-br 4686  df-opab 4746  df-mpt 4763  df-tr 4786  df-id 5053  df-eprel 5058  df-po 5064  df-so 5065  df-fr 5102  df-se 5103  df-we 5104  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-ima 5156  df-pred 5718  df-ord 5764  df-on 5765  df-lim 5766  df-suc 5767  df-iota 5889  df-fun 5928  df-fn 5929  df-f 5930  df-f1 5931  df-fo 5932  df-f1o 5933  df-fv 5934  df-isom 5935  df-riota 6651  df-ov 6693  df-oprab 6694  df-mpt2 6695  df-om 7108  df-1st 7210  df-2nd 7211  df-wrecs 7452  df-recs 7513  df-rdg 7551  df-1o 7605  df-2o 7606  df-oadd 7609  df-er 7787  df-en 7998  df-dom 7999  df-sdom 8000  df-fin 8001  df-sup 8389  df-oi 8456  df-card 8803  df-cda 9028  df-pnf 10114  df-mnf 10115  df-xr 10116  df-ltxr 10117  df-le 10118  df-sub 10306  df-neg 10307  df-div 10723  df-nn 11059  df-2 11117  df-3 11118  df-n0 11331  df-xnn0 11402  df-z 11416  df-uz 11726  df-rp 11871  df-xadd 11985  df-fz 12365  df-fzo 12505  df-seq 12842  df-exp 12901  df-hash 13158  df-cj 13883  df-re 13884  df-im 13885  df-sqrt 14019  df-abs 14020  df-clim 14263  df-sum 14461  df-vtx 25921  df-iedg 25922  df-edg 25985  df-uhgr 25998  df-upgr 26022  df-vtxdg 26418
This theorem is referenced by:  fusgr1th  26503  finsumvtxdgeven  26504
  Copyright terms: Public domain W3C validator