Theorem numedglnl 28393

Description: The number of edges incident with a vertex 𝑁 is the number of edges joining 𝑁 with other vertices and the number of loops on 𝑁 in a pseudograph of finite size. (Contributed by AV, 19-Dec-2021.)

Hypotheses

Ref	Expression
edglnl.v	⊢ 𝑉 = (Vtx‘𝐺)
edglnl.e	⊢ 𝐸 = (iEdg‘𝐺)

Assertion

Ref	Expression
numedglnl	⊢ ((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) → (Σ𝑣 ∈ (𝑉 ∖ {𝑁})(♯‘{𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))}) + (♯‘{𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}})) = (♯‘{𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)}))

Distinct variable groups:   𝑣,𝐸   𝑖,𝐺   𝑖,𝑁,𝑣   𝑖,𝑉,𝑣   𝑖,𝐸   𝑣,𝐺

Proof of Theorem numedglnl

Dummy variables 𝑚 𝑛 𝑤 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		diffi 9175	. . . . . . 7 ⊢ (𝑉 ∈ Fin → (𝑉 ∖ {𝑁}) ∈ Fin)
2	1	adantr 481	. . . . . 6 ⊢ ((𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) → (𝑉 ∖ {𝑁}) ∈ Fin)
3	2	3ad2ant2 1134	. . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) → (𝑉 ∖ {𝑁}) ∈ Fin)
4		dmfi 9326	. . . . . . . . 9 ⊢ (𝐸 ∈ Fin → dom 𝐸 ∈ Fin)
5		rabfi 9265	. . . . . . . . 9 ⊢ (dom 𝐸 ∈ Fin → {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∈ Fin)
6	4, 5	syl 17	. . . . . . . 8 ⊢ (𝐸 ∈ Fin → {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∈ Fin)
7	6	adantl 482	. . . . . . 7 ⊢ ((𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) → {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∈ Fin)
8	7	3ad2ant2 1134	. . . . . 6 ⊢ ((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) → {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∈ Fin)
9	8	adantr 481	. . . . 5 ⊢ (((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∈ Fin)
10		notnotb 314	. . . . . . . . . . . . . 14 ⊢ (𝑁 ∈ (𝐸‘𝑖) ↔ ¬ ¬ 𝑁 ∈ (𝐸‘𝑖))
11		notnotb 314	. . . . . . . . . . . . . . . . 17 ⊢ (𝑣 ∈ (𝐸‘𝑖) ↔ ¬ ¬ 𝑣 ∈ (𝐸‘𝑖))
12		upgruhgr 28351	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝐺 ∈ UPGraph → 𝐺 ∈ UHGraph)
13		edglnl.e	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ 𝐸 = (iEdg‘𝐺)
14	13	uhgrfun 28315	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝐺 ∈ UHGraph → Fun 𝐸)
15	12, 14	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝐺 ∈ UPGraph → Fun 𝐸)
16	13	iedgedg 28299	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((Fun 𝐸 ∧ 𝑖 ∈ dom 𝐸) → (𝐸‘𝑖) ∈ (Edg‘𝐺))
17	15, 16	sylan 580	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑖 ∈ dom 𝐸) → (𝐸‘𝑖) ∈ (Edg‘𝐺))
18		edglnl.v	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ 𝑉 = (Vtx‘𝐺)
19		eqid 2732	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (Edg‘𝐺) = (Edg‘𝐺)
20	18, 19	upgredg 28386	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝐺 ∈ UPGraph ∧ (𝐸‘𝑖) ∈ (Edg‘𝐺)) → ∃𝑚 ∈ 𝑉 ∃𝑛 ∈ 𝑉 (𝐸‘𝑖) = {𝑚, 𝑛})
21	17, 20	syldan 591	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑖 ∈ dom 𝐸) → ∃𝑚 ∈ 𝑉 ∃𝑛 ∈ 𝑉 (𝐸‘𝑖) = {𝑚, 𝑛})
22	21	ex 413	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝐺 ∈ UPGraph → (𝑖 ∈ dom 𝐸 → ∃𝑚 ∈ 𝑉 ∃𝑛 ∈ 𝑉 (𝐸‘𝑖) = {𝑚, 𝑛}))
23	22	3ad2ant1 1133	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) → (𝑖 ∈ dom 𝐸 → ∃𝑚 ∈ 𝑉 ∃𝑛 ∈ 𝑉 (𝐸‘𝑖) = {𝑚, 𝑛}))
24	23	adantr 481	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑤 ∈ (𝑉 ∖ {𝑁}))) → (𝑖 ∈ dom 𝐸 → ∃𝑚 ∈ 𝑉 ∃𝑛 ∈ 𝑉 (𝐸‘𝑖) = {𝑚, 𝑛}))
25	24	adantr 481	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑤 ∈ (𝑉 ∖ {𝑁}))) ∧ ¬ 𝑣 = 𝑤) → (𝑖 ∈ dom 𝐸 → ∃𝑚 ∈ 𝑉 ∃𝑛 ∈ 𝑉 (𝐸‘𝑖) = {𝑚, 𝑛}))
26	25	imp 407	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑤 ∈ (𝑉 ∖ {𝑁}))) ∧ ¬ 𝑣 = 𝑤) ∧ 𝑖 ∈ dom 𝐸) → ∃𝑚 ∈ 𝑉 ∃𝑛 ∈ 𝑉 (𝐸‘𝑖) = {𝑚, 𝑛})
27		eldifsni 4792	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑣 ∈ (𝑉 ∖ {𝑁}) → 𝑣 ≠ 𝑁)
28		eldifsni 4792	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑤 ∈ (𝑉 ∖ {𝑁}) → 𝑤 ≠ 𝑁)
29		3elpr2eq 4906	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 ⊢ (((𝑁 ∈ {𝑚, 𝑛} ∧ 𝑣 ∈ {𝑚, 𝑛} ∧ 𝑤 ∈ {𝑚, 𝑛}) ∧ (𝑣 ≠ 𝑁 ∧ 𝑤 ≠ 𝑁)) → 𝑣 = 𝑤)
30	29	expcom 414	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 ⊢ ((𝑣 ≠ 𝑁 ∧ 𝑤 ≠ 𝑁) → ((𝑁 ∈ {𝑚, 𝑛} ∧ 𝑣 ∈ {𝑚, 𝑛} ∧ 𝑤 ∈ {𝑚, 𝑛}) → 𝑣 = 𝑤))
31	30	3expd 1353	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 ⊢ ((𝑣 ≠ 𝑁 ∧ 𝑤 ≠ 𝑁) → (𝑁 ∈ {𝑚, 𝑛} → (𝑣 ∈ {𝑚, 𝑛} → (𝑤 ∈ {𝑚, 𝑛} → 𝑣 = 𝑤))))
32	31	com23 86	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 ⊢ ((𝑣 ≠ 𝑁 ∧ 𝑤 ≠ 𝑁) → (𝑣 ∈ {𝑚, 𝑛} → (𝑁 ∈ {𝑚, 𝑛} → (𝑤 ∈ {𝑚, 𝑛} → 𝑣 = 𝑤))))
33	32	3imp 1111	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (((𝑣 ≠ 𝑁 ∧ 𝑤 ≠ 𝑁) ∧ 𝑣 ∈ {𝑚, 𝑛} ∧ 𝑁 ∈ {𝑚, 𝑛}) → (𝑤 ∈ {𝑚, 𝑛} → 𝑣 = 𝑤))
34	33	con3d 152	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (((𝑣 ≠ 𝑁 ∧ 𝑤 ≠ 𝑁) ∧ 𝑣 ∈ {𝑚, 𝑛} ∧ 𝑁 ∈ {𝑚, 𝑛}) → (¬ 𝑣 = 𝑤 → ¬ 𝑤 ∈ {𝑚, 𝑛}))
35	34	3exp 1119	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝑣 ≠ 𝑁 ∧ 𝑤 ≠ 𝑁) → (𝑣 ∈ {𝑚, 𝑛} → (𝑁 ∈ {𝑚, 𝑛} → (¬ 𝑣 = 𝑤 → ¬ 𝑤 ∈ {𝑚, 𝑛}))))
36	35	com24 95	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑣 ≠ 𝑁 ∧ 𝑤 ≠ 𝑁) → (¬ 𝑣 = 𝑤 → (𝑁 ∈ {𝑚, 𝑛} → (𝑣 ∈ {𝑚, 𝑛} → ¬ 𝑤 ∈ {𝑚, 𝑛}))))
37	36	imp 407	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝑣 ≠ 𝑁 ∧ 𝑤 ≠ 𝑁) ∧ ¬ 𝑣 = 𝑤) → (𝑁 ∈ {𝑚, 𝑛} → (𝑣 ∈ {𝑚, 𝑛} → ¬ 𝑤 ∈ {𝑚, 𝑛})))
38		eleq2 2822	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝐸‘𝑖) = {𝑚, 𝑛} → (𝑁 ∈ (𝐸‘𝑖) ↔ 𝑁 ∈ {𝑚, 𝑛}))
39		eleq2 2822	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝐸‘𝑖) = {𝑚, 𝑛} → (𝑣 ∈ (𝐸‘𝑖) ↔ 𝑣 ∈ {𝑚, 𝑛}))
40		eleq2 2822	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((𝐸‘𝑖) = {𝑚, 𝑛} → (𝑤 ∈ (𝐸‘𝑖) ↔ 𝑤 ∈ {𝑚, 𝑛}))
41	40	notbid 317	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((𝐸‘𝑖) = {𝑚, 𝑛} → (¬ 𝑤 ∈ (𝐸‘𝑖) ↔ ¬ 𝑤 ∈ {𝑚, 𝑛}))
42	39, 41	imbi12d 344	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝐸‘𝑖) = {𝑚, 𝑛} → ((𝑣 ∈ (𝐸‘𝑖) → ¬ 𝑤 ∈ (𝐸‘𝑖)) ↔ (𝑣 ∈ {𝑚, 𝑛} → ¬ 𝑤 ∈ {𝑚, 𝑛})))
43	38, 42	imbi12d 344	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝐸‘𝑖) = {𝑚, 𝑛} → ((𝑁 ∈ (𝐸‘𝑖) → (𝑣 ∈ (𝐸‘𝑖) → ¬ 𝑤 ∈ (𝐸‘𝑖))) ↔ (𝑁 ∈ {𝑚, 𝑛} → (𝑣 ∈ {𝑚, 𝑛} → ¬ 𝑤 ∈ {𝑚, 𝑛}))))
44	37, 43	syl5ibrcom 246	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((𝑣 ≠ 𝑁 ∧ 𝑤 ≠ 𝑁) ∧ ¬ 𝑣 = 𝑤) → ((𝐸‘𝑖) = {𝑚, 𝑛} → (𝑁 ∈ (𝐸‘𝑖) → (𝑣 ∈ (𝐸‘𝑖) → ¬ 𝑤 ∈ (𝐸‘𝑖)))))
45	44	adantr 481	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((((𝑣 ≠ 𝑁 ∧ 𝑤 ≠ 𝑁) ∧ ¬ 𝑣 = 𝑤) ∧ (𝑚 ∈ 𝑉 ∧ 𝑛 ∈ 𝑉)) → ((𝐸‘𝑖) = {𝑚, 𝑛} → (𝑁 ∈ (𝐸‘𝑖) → (𝑣 ∈ (𝐸‘𝑖) → ¬ 𝑤 ∈ (𝐸‘𝑖)))))
46	45	rexlimdvva 3211	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑣 ≠ 𝑁 ∧ 𝑤 ≠ 𝑁) ∧ ¬ 𝑣 = 𝑤) → (∃𝑚 ∈ 𝑉 ∃𝑛 ∈ 𝑉 (𝐸‘𝑖) = {𝑚, 𝑛} → (𝑁 ∈ (𝐸‘𝑖) → (𝑣 ∈ (𝐸‘𝑖) → ¬ 𝑤 ∈ (𝐸‘𝑖)))))
47	46	ex 413	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑣 ≠ 𝑁 ∧ 𝑤 ≠ 𝑁) → (¬ 𝑣 = 𝑤 → (∃𝑚 ∈ 𝑉 ∃𝑛 ∈ 𝑉 (𝐸‘𝑖) = {𝑚, 𝑛} → (𝑁 ∈ (𝐸‘𝑖) → (𝑣 ∈ (𝐸‘𝑖) → ¬ 𝑤 ∈ (𝐸‘𝑖))))))
48	27, 28, 47	syl2an 596	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑤 ∈ (𝑉 ∖ {𝑁})) → (¬ 𝑣 = 𝑤 → (∃𝑚 ∈ 𝑉 ∃𝑛 ∈ 𝑉 (𝐸‘𝑖) = {𝑚, 𝑛} → (𝑁 ∈ (𝐸‘𝑖) → (𝑣 ∈ (𝐸‘𝑖) → ¬ 𝑤 ∈ (𝐸‘𝑖))))))
49	48	adantl 482	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑤 ∈ (𝑉 ∖ {𝑁}))) → (¬ 𝑣 = 𝑤 → (∃𝑚 ∈ 𝑉 ∃𝑛 ∈ 𝑉 (𝐸‘𝑖) = {𝑚, 𝑛} → (𝑁 ∈ (𝐸‘𝑖) → (𝑣 ∈ (𝐸‘𝑖) → ¬ 𝑤 ∈ (𝐸‘𝑖))))))
50	49	imp 407	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑤 ∈ (𝑉 ∖ {𝑁}))) ∧ ¬ 𝑣 = 𝑤) → (∃𝑚 ∈ 𝑉 ∃𝑛 ∈ 𝑉 (𝐸‘𝑖) = {𝑚, 𝑛} → (𝑁 ∈ (𝐸‘𝑖) → (𝑣 ∈ (𝐸‘𝑖) → ¬ 𝑤 ∈ (𝐸‘𝑖)))))
51	50	adantr 481	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑤 ∈ (𝑉 ∖ {𝑁}))) ∧ ¬ 𝑣 = 𝑤) ∧ 𝑖 ∈ dom 𝐸) → (∃𝑚 ∈ 𝑉 ∃𝑛 ∈ 𝑉 (𝐸‘𝑖) = {𝑚, 𝑛} → (𝑁 ∈ (𝐸‘𝑖) → (𝑣 ∈ (𝐸‘𝑖) → ¬ 𝑤 ∈ (𝐸‘𝑖)))))
52	26, 51	mpd 15	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑤 ∈ (𝑉 ∖ {𝑁}))) ∧ ¬ 𝑣 = 𝑤) ∧ 𝑖 ∈ dom 𝐸) → (𝑁 ∈ (𝐸‘𝑖) → (𝑣 ∈ (𝐸‘𝑖) → ¬ 𝑤 ∈ (𝐸‘𝑖))))
53	52	imp 407	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑤 ∈ (𝑉 ∖ {𝑁}))) ∧ ¬ 𝑣 = 𝑤) ∧ 𝑖 ∈ dom 𝐸) ∧ 𝑁 ∈ (𝐸‘𝑖)) → (𝑣 ∈ (𝐸‘𝑖) → ¬ 𝑤 ∈ (𝐸‘𝑖)))
54	11, 53	biimtrrid 242	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑤 ∈ (𝑉 ∖ {𝑁}))) ∧ ¬ 𝑣 = 𝑤) ∧ 𝑖 ∈ dom 𝐸) ∧ 𝑁 ∈ (𝐸‘𝑖)) → (¬ ¬ 𝑣 ∈ (𝐸‘𝑖) → ¬ 𝑤 ∈ (𝐸‘𝑖)))
55	54	orrd 861	. . . . . . . . . . . . . . 15 ⊢ ((((((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑤 ∈ (𝑉 ∖ {𝑁}))) ∧ ¬ 𝑣 = 𝑤) ∧ 𝑖 ∈ dom 𝐸) ∧ 𝑁 ∈ (𝐸‘𝑖)) → (¬ 𝑣 ∈ (𝐸‘𝑖) ∨ ¬ 𝑤 ∈ (𝐸‘𝑖)))
56	55	ex 413	. . . . . . . . . . . . . 14 ⊢ (((((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑤 ∈ (𝑉 ∖ {𝑁}))) ∧ ¬ 𝑣 = 𝑤) ∧ 𝑖 ∈ dom 𝐸) → (𝑁 ∈ (𝐸‘𝑖) → (¬ 𝑣 ∈ (𝐸‘𝑖) ∨ ¬ 𝑤 ∈ (𝐸‘𝑖))))
57	10, 56	biimtrrid 242	. . . . . . . . . . . . 13 ⊢ (((((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑤 ∈ (𝑉 ∖ {𝑁}))) ∧ ¬ 𝑣 = 𝑤) ∧ 𝑖 ∈ dom 𝐸) → (¬ ¬ 𝑁 ∈ (𝐸‘𝑖) → (¬ 𝑣 ∈ (𝐸‘𝑖) ∨ ¬ 𝑤 ∈ (𝐸‘𝑖))))
58	57	orrd 861	. . . . . . . . . . . 12 ⊢ (((((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑤 ∈ (𝑉 ∖ {𝑁}))) ∧ ¬ 𝑣 = 𝑤) ∧ 𝑖 ∈ dom 𝐸) → (¬ 𝑁 ∈ (𝐸‘𝑖) ∨ (¬ 𝑣 ∈ (𝐸‘𝑖) ∨ ¬ 𝑤 ∈ (𝐸‘𝑖))))
59		anandi 674	. . . . . . . . . . . . . . 15 ⊢ ((𝑁 ∈ (𝐸‘𝑖) ∧ (𝑣 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))) ↔ ((𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∧ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))))
60	59	bicomi 223	. . . . . . . . . . . . . 14 ⊢ (((𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∧ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))) ↔ (𝑁 ∈ (𝐸‘𝑖) ∧ (𝑣 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))))
61	60	notbii 319	. . . . . . . . . . . . 13 ⊢ (¬ ((𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∧ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))) ↔ ¬ (𝑁 ∈ (𝐸‘𝑖) ∧ (𝑣 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))))
62		ianor 980	. . . . . . . . . . . . 13 ⊢ (¬ (𝑁 ∈ (𝐸‘𝑖) ∧ (𝑣 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))) ↔ (¬ 𝑁 ∈ (𝐸‘𝑖) ∨ ¬ (𝑣 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))))
63		ianor 980	. . . . . . . . . . . . . 14 ⊢ (¬ (𝑣 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖)) ↔ (¬ 𝑣 ∈ (𝐸‘𝑖) ∨ ¬ 𝑤 ∈ (𝐸‘𝑖)))
64	63	orbi2i 911	. . . . . . . . . . . . 13 ⊢ ((¬ 𝑁 ∈ (𝐸‘𝑖) ∨ ¬ (𝑣 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))) ↔ (¬ 𝑁 ∈ (𝐸‘𝑖) ∨ (¬ 𝑣 ∈ (𝐸‘𝑖) ∨ ¬ 𝑤 ∈ (𝐸‘𝑖))))
65	61, 62, 64	3bitri 296	. . . . . . . . . . . 12 ⊢ (¬ ((𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∧ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))) ↔ (¬ 𝑁 ∈ (𝐸‘𝑖) ∨ (¬ 𝑣 ∈ (𝐸‘𝑖) ∨ ¬ 𝑤 ∈ (𝐸‘𝑖))))
66	58, 65	sylibr 233	. . . . . . . . . . 11 ⊢ (((((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑤 ∈ (𝑉 ∖ {𝑁}))) ∧ ¬ 𝑣 = 𝑤) ∧ 𝑖 ∈ dom 𝐸) → ¬ ((𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∧ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))))
67	66	ralrimiva 3146	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑤 ∈ (𝑉 ∖ {𝑁}))) ∧ ¬ 𝑣 = 𝑤) → ∀𝑖 ∈ dom 𝐸 ¬ ((𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∧ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))))
68		inrab 4305	. . . . . . . . . . . 12 ⊢ ({𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∩ {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))}) = {𝑖 ∈ dom 𝐸 ∣ ((𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∧ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖)))}
69	68	eqeq1i 2737	. . . . . . . . . . 11 ⊢ (({𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∩ {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))}) = ∅ ↔ {𝑖 ∈ dom 𝐸 ∣ ((𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∧ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖)))} = ∅)
70		rabeq0 4383	. . . . . . . . . . 11 ⊢ ({𝑖 ∈ dom 𝐸 ∣ ((𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∧ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖)))} = ∅ ↔ ∀𝑖 ∈ dom 𝐸 ¬ ((𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∧ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))))
71	69, 70	bitri 274	. . . . . . . . . 10 ⊢ (({𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∩ {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))}) = ∅ ↔ ∀𝑖 ∈ dom 𝐸 ¬ ((𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∧ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))))
72	67, 71	sylibr 233	. . . . . . . . 9 ⊢ ((((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑤 ∈ (𝑉 ∖ {𝑁}))) ∧ ¬ 𝑣 = 𝑤) → ({𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∩ {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))}) = ∅)
73	72	ex 413	. . . . . . . 8 ⊢ (((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑤 ∈ (𝑉 ∖ {𝑁}))) → (¬ 𝑣 = 𝑤 → ({𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∩ {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))}) = ∅))
74	73	orrd 861	. . . . . . 7 ⊢ (((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑣 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑤 ∈ (𝑉 ∖ {𝑁}))) → (𝑣 = 𝑤 ∨ ({𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∩ {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))}) = ∅))
75	74	ralrimivva 3200	. . . . . 6 ⊢ ((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) → ∀𝑣 ∈ (𝑉 ∖ {𝑁})∀𝑤 ∈ (𝑉 ∖ {𝑁})(𝑣 = 𝑤 ∨ ({𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∩ {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))}) = ∅))
76		eleq1w 2816	. . . . . . . . 9 ⊢ (𝑣 = 𝑤 → (𝑣 ∈ (𝐸‘𝑖) ↔ 𝑤 ∈ (𝐸‘𝑖)))
77	76	anbi2d 629	. . . . . . . 8 ⊢ (𝑣 = 𝑤 → ((𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ↔ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))))
78	77	rabbidv 3440	. . . . . . 7 ⊢ (𝑣 = 𝑤 → {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} = {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))})
79	78	disjor 5127	. . . . . 6 ⊢ (Disj 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ↔ ∀𝑣 ∈ (𝑉 ∖ {𝑁})∀𝑤 ∈ (𝑉 ∖ {𝑁})(𝑣 = 𝑤 ∨ ({𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∩ {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑤 ∈ (𝐸‘𝑖))}) = ∅))
80	75, 79	sylibr 233	. . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) → Disj 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))})
81	3, 9, 80	hashiun 15764	. . . 4 ⊢ ((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) → (♯‘∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))}) = Σ𝑣 ∈ (𝑉 ∖ {𝑁})(♯‘{𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))}))
82	81	eqcomd 2738	. . 3 ⊢ ((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) → Σ𝑣 ∈ (𝑉 ∖ {𝑁})(♯‘{𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))}) = (♯‘∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))}))
83	82	oveq1d 7420	. 2 ⊢ ((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) → (Σ𝑣 ∈ (𝑉 ∖ {𝑁})(♯‘{𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))}) + (♯‘{𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}})) = ((♯‘∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))}) + (♯‘{𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}})))
84	9	ralrimiva 3146	. . . 4 ⊢ ((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) → ∀𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∈ Fin)
85		iunfi 9336	. . . 4 ⊢ (((𝑉 ∖ {𝑁}) ∈ Fin ∧ ∀𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∈ Fin) → ∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∈ Fin)
86	3, 84, 85	syl2anc 584	. . 3 ⊢ ((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) → ∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∈ Fin)
87		rabfi 9265	. . . . . 6 ⊢ (dom 𝐸 ∈ Fin → {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}} ∈ Fin)
88	4, 87	syl 17	. . . . 5 ⊢ (𝐸 ∈ Fin → {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}} ∈ Fin)
89	88	adantl 482	. . . 4 ⊢ ((𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) → {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}} ∈ Fin)
90	89	3ad2ant2 1134	. . 3 ⊢ ((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) → {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}} ∈ Fin)
91		fveqeq2 6897	. . . . . . 7 ⊢ (𝑖 = 𝑗 → ((𝐸‘𝑖) = {𝑁} ↔ (𝐸‘𝑗) = {𝑁}))
92	91	elrab 3682	. . . . . 6 ⊢ (𝑗 ∈ {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}} ↔ (𝑗 ∈ dom 𝐸 ∧ (𝐸‘𝑗) = {𝑁}))
93		eldifn 4126	. . . . . . . . . . . . . . 15 ⊢ (𝑣 ∈ (𝑉 ∖ {𝑁}) → ¬ 𝑣 ∈ {𝑁})
94		eleq2 2822	. . . . . . . . . . . . . . . 16 ⊢ ((𝐸‘𝑗) = {𝑁} → (𝑣 ∈ (𝐸‘𝑗) ↔ 𝑣 ∈ {𝑁}))
95	94	notbid 317	. . . . . . . . . . . . . . 15 ⊢ ((𝐸‘𝑗) = {𝑁} → (¬ 𝑣 ∈ (𝐸‘𝑗) ↔ ¬ 𝑣 ∈ {𝑁}))
96	93, 95	imbitrrid 245	. . . . . . . . . . . . . 14 ⊢ ((𝐸‘𝑗) = {𝑁} → (𝑣 ∈ (𝑉 ∖ {𝑁}) → ¬ 𝑣 ∈ (𝐸‘𝑗)))
97	96	adantl 482	. . . . . . . . . . . . 13 ⊢ ((𝑗 ∈ dom 𝐸 ∧ (𝐸‘𝑗) = {𝑁}) → (𝑣 ∈ (𝑉 ∖ {𝑁}) → ¬ 𝑣 ∈ (𝐸‘𝑗)))
98	97	adantl 482	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐸 ∧ (𝐸‘𝑗) = {𝑁})) → (𝑣 ∈ (𝑉 ∖ {𝑁}) → ¬ 𝑣 ∈ (𝐸‘𝑗)))
99	98	imp 407	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐸 ∧ (𝐸‘𝑗) = {𝑁})) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → ¬ 𝑣 ∈ (𝐸‘𝑗))
100	99	intnand 489	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐸 ∧ (𝐸‘𝑗) = {𝑁})) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → ¬ (𝑁 ∈ (𝐸‘𝑗) ∧ 𝑣 ∈ (𝐸‘𝑗)))
101	100	intnand 489	. . . . . . . . 9 ⊢ ((((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐸 ∧ (𝐸‘𝑗) = {𝑁})) ∧ 𝑣 ∈ (𝑉 ∖ {𝑁})) → ¬ (𝑗 ∈ dom 𝐸 ∧ (𝑁 ∈ (𝐸‘𝑗) ∧ 𝑣 ∈ (𝐸‘𝑗))))
102	101	ralrimiva 3146	. . . . . . . 8 ⊢ (((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐸 ∧ (𝐸‘𝑗) = {𝑁})) → ∀𝑣 ∈ (𝑉 ∖ {𝑁}) ¬ (𝑗 ∈ dom 𝐸 ∧ (𝑁 ∈ (𝐸‘𝑗) ∧ 𝑣 ∈ (𝐸‘𝑗))))
103		eliun 5000	. . . . . . . . . 10 ⊢ (𝑗 ∈ ∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ↔ ∃𝑣 ∈ (𝑉 ∖ {𝑁})𝑗 ∈ {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))})
104	103	notbii 319	. . . . . . . . 9 ⊢ (¬ 𝑗 ∈ ∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ↔ ¬ ∃𝑣 ∈ (𝑉 ∖ {𝑁})𝑗 ∈ {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))})
105		ralnex 3072	. . . . . . . . 9 ⊢ (∀𝑣 ∈ (𝑉 ∖ {𝑁}) ¬ 𝑗 ∈ {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ↔ ¬ ∃𝑣 ∈ (𝑉 ∖ {𝑁})𝑗 ∈ {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))})
106		fveq2 6888	. . . . . . . . . . . . . 14 ⊢ (𝑖 = 𝑗 → (𝐸‘𝑖) = (𝐸‘𝑗))
107	106	eleq2d 2819	. . . . . . . . . . . . 13 ⊢ (𝑖 = 𝑗 → (𝑁 ∈ (𝐸‘𝑖) ↔ 𝑁 ∈ (𝐸‘𝑗)))
108	106	eleq2d 2819	. . . . . . . . . . . . 13 ⊢ (𝑖 = 𝑗 → (𝑣 ∈ (𝐸‘𝑖) ↔ 𝑣 ∈ (𝐸‘𝑗)))
109	107, 108	anbi12d 631	. . . . . . . . . . . 12 ⊢ (𝑖 = 𝑗 → ((𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ↔ (𝑁 ∈ (𝐸‘𝑗) ∧ 𝑣 ∈ (𝐸‘𝑗))))
110	109	elrab 3682	. . . . . . . . . . 11 ⊢ (𝑗 ∈ {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ↔ (𝑗 ∈ dom 𝐸 ∧ (𝑁 ∈ (𝐸‘𝑗) ∧ 𝑣 ∈ (𝐸‘𝑗))))
111	110	notbii 319	. . . . . . . . . 10 ⊢ (¬ 𝑗 ∈ {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ↔ ¬ (𝑗 ∈ dom 𝐸 ∧ (𝑁 ∈ (𝐸‘𝑗) ∧ 𝑣 ∈ (𝐸‘𝑗))))
112	111	ralbii 3093	. . . . . . . . 9 ⊢ (∀𝑣 ∈ (𝑉 ∖ {𝑁}) ¬ 𝑗 ∈ {𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ↔ ∀𝑣 ∈ (𝑉 ∖ {𝑁}) ¬ (𝑗 ∈ dom 𝐸 ∧ (𝑁 ∈ (𝐸‘𝑗) ∧ 𝑣 ∈ (𝐸‘𝑗))))
113	104, 105, 112	3bitr2i 298	. . . . . . . 8 ⊢ (¬ 𝑗 ∈ ∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ↔ ∀𝑣 ∈ (𝑉 ∖ {𝑁}) ¬ (𝑗 ∈ dom 𝐸 ∧ (𝑁 ∈ (𝐸‘𝑗) ∧ 𝑣 ∈ (𝐸‘𝑗))))
114	102, 113	sylibr 233	. . . . . . 7 ⊢ (((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) ∧ (𝑗 ∈ dom 𝐸 ∧ (𝐸‘𝑗) = {𝑁})) → ¬ 𝑗 ∈ ∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))})
115	114	ex 413	. . . . . 6 ⊢ ((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) → ((𝑗 ∈ dom 𝐸 ∧ (𝐸‘𝑗) = {𝑁}) → ¬ 𝑗 ∈ ∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))}))
116	92, 115	biimtrid 241	. . . . 5 ⊢ ((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) → (𝑗 ∈ {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}} → ¬ 𝑗 ∈ ∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))}))
117	116	ralrimiv 3145	. . . 4 ⊢ ((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) → ∀𝑗 ∈ {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}} ¬ 𝑗 ∈ ∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))})
118		disjr 4448	. . . 4 ⊢ ((∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∩ {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}}) = ∅ ↔ ∀𝑗 ∈ {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}} ¬ 𝑗 ∈ ∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))})
119	117, 118	sylibr 233	. . 3 ⊢ ((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) → (∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∩ {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}}) = ∅)
120		hashun 14338	. . 3 ⊢ ((∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∈ Fin ∧ {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}} ∈ Fin ∧ (∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∩ {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}}) = ∅) → (♯‘(∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∪ {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}})) = ((♯‘∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))}) + (♯‘{𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}})))
121	86, 90, 119, 120	syl3anc 1371	. 2 ⊢ ((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) → (♯‘(∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∪ {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}})) = ((♯‘∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))}) + (♯‘{𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}})))
122	18, 13	edglnl 28392	. . . 4 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → (∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∪ {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}}) = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)})
123	122	3adant2 1131	. . 3 ⊢ ((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) → (∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∪ {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}}) = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)})
124	123	fveq2d 6892	. 2 ⊢ ((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) → (♯‘(∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∪ {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}})) = (♯‘{𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)}))
125	83, 121, 124	3eqtr2d 2778	1 ⊢ ((𝐺 ∈ UPGraph ∧ (𝑉 ∈ Fin ∧ 𝐸 ∈ Fin) ∧ 𝑁 ∈ 𝑉) → (Σ𝑣 ∈ (𝑉 ∖ {𝑁})(♯‘{𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))}) + (♯‘{𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}})) = (♯‘{𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)}))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 396   ∨ wo 845   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106   ≠ wne 2940  ∀wral 3061  ∃wrex 3070  {crab 3432   ∖ cdif 3944   ∪ cun 3945   ∩ cin 3946  ∅c0 4321  {csn 4627  {cpr 4629  ∪ ciun 4996  Disj wdisj 5112  dom cdm 5675  Fun wfun 6534  ‘cfv 6540  (class class class)co 7405  Fincfn 8935   + caddc 11109  ♯chash 14286  Σcsu 15628  Vtxcvtx 28245  iEdgciedg 28246  Edgcedg 28296  UHGraphcuhgr 28305  UPGraphcupgr 28329

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7721  ax-inf2 9632  ax-cnex 11162  ax-resscn 11163  ax-1cn 11164  ax-icn 11165  ax-addcl 11166  ax-addrcl 11167  ax-mulcl 11168  ax-mulrcl 11169  ax-mulcom 11170  ax-addass 11171  ax-mulass 11172  ax-distr 11173  ax-i2m1 11174  ax-1ne0 11175  ax-1rid 11176  ax-rnegex 11177  ax-rrecex 11178  ax-cnre 11179  ax-pre-lttri 11180  ax-pre-lttrn 11181  ax-pre-ltadd 11182  ax-pre-mulgt0 11183  ax-pre-sup 11184

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rmo 3376  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-int 4950  df-iun 4998  df-disj 5113  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-se 5631  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-pred 6297  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-isom 6549  df-riota 7361  df-ov 7408  df-oprab 7409  df-mpo 7410  df-om 7852  df-1st 7971  df-2nd 7972  df-frecs 8262  df-wrecs 8293  df-recs 8367  df-rdg 8406  df-1o 8462  df-2o 8463  df-oadd 8466  df-er 8699  df-en 8936  df-dom 8937  df-sdom 8938  df-fin 8939  df-sup 9433  df-oi 9501  df-dju 9892  df-card 9930  df-pnf 11246  df-mnf 11247  df-xr 11248  df-ltxr 11249  df-le 11250  df-sub 11442  df-neg 11443  df-div 11868  df-nn 12209  df-2 12271  df-3 12272  df-n0 12469  df-xnn0 12541  df-z 12555  df-uz 12819  df-rp 12971  df-fz 13481  df-fzo 13624  df-seq 13963  df-exp 14024  df-hash 14287  df-cj 15042  df-re 15043  df-im 15044  df-sqrt 15178  df-abs 15179  df-clim 15428  df-sum 15629  df-edg 28297  df-uhgr 28307  df-upgr 28331

This theorem is referenced by:  finsumvtxdg2ssteplem3  28793