Metamath Proof Explorer

Theorem vtxdfiun

Description: The degree of a vertex in the union of two hypergraphs of finite size on the same vertex set is the sum of the degrees of the vertex in each hypergraph. (Contributed by Mario Carneiro, 12-Mar-2015) (Revised by Alexander van der Vekens, 21-Jan-2018) (Revised by AV, 19-Feb-2021)

Ref Expression
Hypotheses vtxdun.i ⊢ I = iEdg ⁡ G
vtxdun.j ⊢ J = iEdg ⁡ H
vtxdun.vg ⊢ V = Vtx ⁡ G
vtxdun.vh ⊢ φ → Vtx ⁡ H = V
vtxdun.vu ⊢ φ → Vtx ⁡ U = V
vtxdun.d ⊢ φ → dom ⁡ I ∩ dom ⁡ J = ∅
vtxdun.fi ⊢ φ → Fun ⁡ I
vtxdun.fj ⊢ φ → Fun ⁡ J
vtxdun.n ⊢ φ → N ∈ V
vtxdun.u ⊢ φ → iEdg ⁡ U = I ∪ J
vtxdfiun.a ⊢ φ → dom ⁡ I ∈ Fin
vtxdfiun.b ⊢ φ → dom ⁡ J ∈ Fin
Assertion vtxdfiun ⊢ φ → VtxDeg ⁡ U ⁡ N = VtxDeg ⁡ G ⁡ N + VtxDeg ⁡ H ⁡ N

Proof

Step Hyp Ref Expression
1 vtxdun.i ⊢ I = iEdg ⁡ G
2 vtxdun.j ⊢ J = iEdg ⁡ H
3 vtxdun.vg ⊢ V = Vtx ⁡ G
4 vtxdun.vh ⊢ φ → Vtx ⁡ H = V
5 vtxdun.vu ⊢ φ → Vtx ⁡ U = V
6 vtxdun.d ⊢ φ → dom ⁡ I ∩ dom ⁡ J = ∅
7 vtxdun.fi ⊢ φ → Fun ⁡ I
8 vtxdun.fj ⊢ φ → Fun ⁡ J
9 vtxdun.n ⊢ φ → N ∈ V
10 vtxdun.u ⊢ φ → iEdg ⁡ U = I ∪ J
11 vtxdfiun.a ⊢ φ → dom ⁡ I ∈ Fin
12 vtxdfiun.b ⊢ φ → dom ⁡ J ∈ Fin
13 1 2 3 4 5 6 7 8 9 10 vtxdun ⊢ φ → VtxDeg ⁡ U ⁡ N = VtxDeg ⁡ G ⁡ N + 𝑒 VtxDeg ⁡ H ⁡ N
14 eqid ⊢ dom ⁡ I = dom ⁡ I
15 3 1 14 vtxdgfisnn0 ⊢ dom ⁡ I ∈ Fin ∧ N ∈ V → VtxDeg ⁡ G ⁡ N ∈ ℕ 0
16 11 9 15 syl2anc ⊢ φ → VtxDeg ⁡ G ⁡ N ∈ ℕ 0
17 16 nn0red ⊢ φ → VtxDeg ⁡ G ⁡ N ∈ ℝ
18 9 4 eleqtrrd ⊢ φ → N ∈ Vtx ⁡ H
19 eqid ⊢ Vtx ⁡ H = Vtx ⁡ H
20 eqid ⊢ dom ⁡ J = dom ⁡ J
21 19 2 20 vtxdgfisnn0 ⊢ dom ⁡ J ∈ Fin ∧ N ∈ Vtx ⁡ H → VtxDeg ⁡ H ⁡ N ∈ ℕ 0
22 12 18 21 syl2anc ⊢ φ → VtxDeg ⁡ H ⁡ N ∈ ℕ 0
23 22 nn0red ⊢ φ → VtxDeg ⁡ H ⁡ N ∈ ℝ
24 17 23 rexaddd ⊢ φ → VtxDeg ⁡ G ⁡ N + 𝑒 VtxDeg ⁡ H ⁡ N = VtxDeg ⁡ G ⁡ N + VtxDeg ⁡ H ⁡ N
25 13 24 eqtrd ⊢ φ → VtxDeg ⁡ U ⁡ N = VtxDeg ⁡ G ⁡ N + VtxDeg ⁡ H ⁡ N