Theorem edglnl 29232

Description: The edges incident with a vertex 𝑁 are the edges joining 𝑁 with other vertices and the loops on 𝑁 in a pseudograph. (Contributed by AV, 18-Dec-2021.)

Hypotheses

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

Assertion

Ref	Expression
edglnl	⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → (∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∪ {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}}) = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)})

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

Allowed substitution hints:   𝐸(𝑖)   𝐺(𝑣)

Proof of Theorem edglnl

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

Step	Hyp	Ref	Expression
1		iunrab 5010	. . . 4 ⊢ ∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} = {𝑖 ∈ dom 𝐸 ∣ ∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))}
2	1	a1i 11	. . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → ∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} = {𝑖 ∈ dom 𝐸 ∣ ∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))})
3	2	uneq1d 4121	. 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → (∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∪ {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}}) = ({𝑖 ∈ dom 𝐸 ∣ ∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∪ {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}}))
4		unrab 4269	. . 3 ⊢ ({𝑖 ∈ dom 𝐸 ∣ ∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∪ {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}}) = {𝑖 ∈ dom 𝐸 ∣ (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∨ (𝐸‘𝑖) = {𝑁})}
5		simpl 482	. . . . . . . 8 ⊢ ((𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) → 𝑁 ∈ (𝐸‘𝑖))
6	5	rexlimivw 3135	. . . . . . 7 ⊢ (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) → 𝑁 ∈ (𝐸‘𝑖))
7	6	a1i 11	. . . . . 6 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑖 ∈ dom 𝐸) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) → 𝑁 ∈ (𝐸‘𝑖)))
8		snidg 4619	. . . . . . . 8 ⊢ (𝑁 ∈ 𝑉 → 𝑁 ∈ {𝑁})
9	8	ad2antlr 728	. . . . . . 7 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑖 ∈ dom 𝐸) → 𝑁 ∈ {𝑁})
10		eleq2 2826	. . . . . . 7 ⊢ ((𝐸‘𝑖) = {𝑁} → (𝑁 ∈ (𝐸‘𝑖) ↔ 𝑁 ∈ {𝑁}))
11	9, 10	syl5ibrcom 247	. . . . . 6 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑖 ∈ dom 𝐸) → ((𝐸‘𝑖) = {𝑁} → 𝑁 ∈ (𝐸‘𝑖)))
12	7, 11	jaod 860	. . . . 5 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑖 ∈ dom 𝐸) → ((∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∨ (𝐸‘𝑖) = {𝑁}) → 𝑁 ∈ (𝐸‘𝑖)))
13		upgruhgr 29191	. . . . . . . . 9 ⊢ (𝐺 ∈ UPGraph → 𝐺 ∈ UHGraph)
14		edglnl.e	. . . . . . . . . 10 ⊢ 𝐸 = (iEdg‘𝐺)
15	14	uhgrfun 29155	. . . . . . . . 9 ⊢ (𝐺 ∈ UHGraph → Fun 𝐸)
16	13, 15	syl 17	. . . . . . . 8 ⊢ (𝐺 ∈ UPGraph → Fun 𝐸)
17	16	adantr 480	. . . . . . 7 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → Fun 𝐸)
18	14	iedgedg 29139	. . . . . . 7 ⊢ ((Fun 𝐸 ∧ 𝑖 ∈ dom 𝐸) → (𝐸‘𝑖) ∈ (Edg‘𝐺))
19	17, 18	sylan 581	. . . . . 6 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑖 ∈ dom 𝐸) → (𝐸‘𝑖) ∈ (Edg‘𝐺))
20		edglnl.v	. . . . . . . . . 10 ⊢ 𝑉 = (Vtx‘𝐺)
21		eqid 2737	. . . . . . . . . 10 ⊢ (Edg‘𝐺) = (Edg‘𝐺)
22	20, 21	upgredg 29226	. . . . . . . . 9 ⊢ ((𝐺 ∈ UPGraph ∧ (𝐸‘𝑖) ∈ (Edg‘𝐺)) → ∃𝑛 ∈ 𝑉 ∃𝑚 ∈ 𝑉 (𝐸‘𝑖) = {𝑛, 𝑚})
23	22	ex 412	. . . . . . . 8 ⊢ (𝐺 ∈ UPGraph → ((𝐸‘𝑖) ∈ (Edg‘𝐺) → ∃𝑛 ∈ 𝑉 ∃𝑚 ∈ 𝑉 (𝐸‘𝑖) = {𝑛, 𝑚}))
24	23	ad2antrr 727	. . . . . . 7 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑖 ∈ dom 𝐸) → ((𝐸‘𝑖) ∈ (Edg‘𝐺) → ∃𝑛 ∈ 𝑉 ∃𝑚 ∈ 𝑉 (𝐸‘𝑖) = {𝑛, 𝑚}))
25		dfsn2 4595	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ {𝑛} = {𝑛, 𝑛}
26	25	eqcomi 2746	. . . . . . . . . . . . . . . . . . . . 21 ⊢ {𝑛, 𝑛} = {𝑛}
27		elsni 4599	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑁 ∈ {𝑛} → 𝑁 = 𝑛)
28		sneq 4592	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑁 = 𝑛 → {𝑁} = {𝑛})
29	28	eqcomd 2743	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑁 = 𝑛 → {𝑛} = {𝑁})
30	27, 29	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑁 ∈ {𝑛} → {𝑛} = {𝑁})
31	26, 30	eqtrid 2784	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑁 ∈ {𝑛} → {𝑛, 𝑛} = {𝑁})
32	31, 26	eleq2s 2855	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑁 ∈ {𝑛, 𝑛} → {𝑛, 𝑛} = {𝑁})
33		preq2 4693	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑚 = 𝑛 → {𝑛, 𝑚} = {𝑛, 𝑛})
34	33	eleq2d 2823	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑚 = 𝑛 → (𝑁 ∈ {𝑛, 𝑚} ↔ 𝑁 ∈ {𝑛, 𝑛}))
35	33	eqeq1d 2739	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑚 = 𝑛 → ({𝑛, 𝑚} = {𝑁} ↔ {𝑛, 𝑛} = {𝑁}))
36	34, 35	imbi12d 344	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑚 = 𝑛 → ((𝑁 ∈ {𝑛, 𝑚} → {𝑛, 𝑚} = {𝑁}) ↔ (𝑁 ∈ {𝑛, 𝑛} → {𝑛, 𝑛} = {𝑁})))
37	32, 36	mpbiri 258	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑚 = 𝑛 → (𝑁 ∈ {𝑛, 𝑚} → {𝑛, 𝑚} = {𝑁}))
38	37	imp 406	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑚 = 𝑛 ∧ 𝑁 ∈ {𝑛, 𝑚}) → {𝑛, 𝑚} = {𝑁})
39	38	olcd 875	. . . . . . . . . . . . . . . 16 ⊢ ((𝑚 = 𝑛 ∧ 𝑁 ∈ {𝑛, 𝑚}) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁}))
40	39	expcom 413	. . . . . . . . . . . . . . 15 ⊢ (𝑁 ∈ {𝑛, 𝑚} → (𝑚 = 𝑛 → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁})))
41	40	3ad2ant3 1136	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ 𝑉 ∧ (𝑛 ∈ 𝑉 ∧ 𝑚 ∈ 𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚}) → (𝑚 = 𝑛 → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁})))
42	41	com12 32	. . . . . . . . . . . . 13 ⊢ (𝑚 = 𝑛 → ((𝑁 ∈ 𝑉 ∧ (𝑛 ∈ 𝑉 ∧ 𝑚 ∈ 𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚}) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁})))
43		simpr3 1198	. . . . . . . . . . . . . . . 16 ⊢ ((𝑚 ≠ 𝑛 ∧ (𝑁 ∈ 𝑉 ∧ (𝑛 ∈ 𝑉 ∧ 𝑚 ∈ 𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚})) → 𝑁 ∈ {𝑛, 𝑚})
44		simpl 482	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑚 ≠ 𝑛 ∧ (𝑁 ∈ 𝑉 ∧ (𝑛 ∈ 𝑉 ∧ 𝑚 ∈ 𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚})) → 𝑚 ≠ 𝑛)
45	44	necomd 2988	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑚 ≠ 𝑛 ∧ (𝑁 ∈ 𝑉 ∧ (𝑛 ∈ 𝑉 ∧ 𝑚 ∈ 𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚})) → 𝑛 ≠ 𝑚)
46		simpr2 1197	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑚 ≠ 𝑛 ∧ (𝑁 ∈ 𝑉 ∧ (𝑛 ∈ 𝑉 ∧ 𝑚 ∈ 𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚})) → (𝑛 ∈ 𝑉 ∧ 𝑚 ∈ 𝑉))
47		prproe 4863	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑁 ∈ {𝑛, 𝑚} ∧ 𝑛 ≠ 𝑚 ∧ (𝑛 ∈ 𝑉 ∧ 𝑚 ∈ 𝑉)) → ∃𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ {𝑛, 𝑚})
48	43, 45, 46, 47	syl3anc 1374	. . . . . . . . . . . . . . . 16 ⊢ ((𝑚 ≠ 𝑛 ∧ (𝑁 ∈ 𝑉 ∧ (𝑛 ∈ 𝑉 ∧ 𝑚 ∈ 𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚})) → ∃𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ {𝑛, 𝑚})
49		r19.42v 3170	. . . . . . . . . . . . . . . 16 ⊢ (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ↔ (𝑁 ∈ {𝑛, 𝑚} ∧ ∃𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ {𝑛, 𝑚}))
50	43, 48, 49	sylanbrc 584	. . . . . . . . . . . . . . 15 ⊢ ((𝑚 ≠ 𝑛 ∧ (𝑁 ∈ 𝑉 ∧ (𝑛 ∈ 𝑉 ∧ 𝑚 ∈ 𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚})) → ∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}))
51	50	orcd 874	. . . . . . . . . . . . . 14 ⊢ ((𝑚 ≠ 𝑛 ∧ (𝑁 ∈ 𝑉 ∧ (𝑛 ∈ 𝑉 ∧ 𝑚 ∈ 𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚})) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁}))
52	51	ex 412	. . . . . . . . . . . . 13 ⊢ (𝑚 ≠ 𝑛 → ((𝑁 ∈ 𝑉 ∧ (𝑛 ∈ 𝑉 ∧ 𝑚 ∈ 𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚}) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁})))
53	42, 52	pm2.61ine 3016	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ 𝑉 ∧ (𝑛 ∈ 𝑉 ∧ 𝑚 ∈ 𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚}) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁}))
54	53	3exp 1120	. . . . . . . . . . 11 ⊢ (𝑁 ∈ 𝑉 → ((𝑛 ∈ 𝑉 ∧ 𝑚 ∈ 𝑉) → (𝑁 ∈ {𝑛, 𝑚} → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁}))))
55	54	ad2antlr 728	. . . . . . . . . 10 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑖 ∈ dom 𝐸) → ((𝑛 ∈ 𝑉 ∧ 𝑚 ∈ 𝑉) → (𝑁 ∈ {𝑛, 𝑚} → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁}))))
56	55	imp 406	. . . . . . . . 9 ⊢ ((((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑖 ∈ dom 𝐸) ∧ (𝑛 ∈ 𝑉 ∧ 𝑚 ∈ 𝑉)) → (𝑁 ∈ {𝑛, 𝑚} → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁})))
57		eleq2 2826	. . . . . . . . . 10 ⊢ ((𝐸‘𝑖) = {𝑛, 𝑚} → (𝑁 ∈ (𝐸‘𝑖) ↔ 𝑁 ∈ {𝑛, 𝑚}))
58		eleq2 2826	. . . . . . . . . . . . 13 ⊢ ((𝐸‘𝑖) = {𝑛, 𝑚} → (𝑣 ∈ (𝐸‘𝑖) ↔ 𝑣 ∈ {𝑛, 𝑚}))
59	57, 58	anbi12d 633	. . . . . . . . . . . 12 ⊢ ((𝐸‘𝑖) = {𝑛, 𝑚} → ((𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ↔ (𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚})))
60	59	rexbidv 3162	. . . . . . . . . . 11 ⊢ ((𝐸‘𝑖) = {𝑛, 𝑚} → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ↔ ∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚})))
61		eqeq1 2741	. . . . . . . . . . 11 ⊢ ((𝐸‘𝑖) = {𝑛, 𝑚} → ((𝐸‘𝑖) = {𝑁} ↔ {𝑛, 𝑚} = {𝑁}))
62	60, 61	orbi12d 919	. . . . . . . . . 10 ⊢ ((𝐸‘𝑖) = {𝑛, 𝑚} → ((∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∨ (𝐸‘𝑖) = {𝑁}) ↔ (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁})))
63	57, 62	imbi12d 344	. . . . . . . . 9 ⊢ ((𝐸‘𝑖) = {𝑛, 𝑚} → ((𝑁 ∈ (𝐸‘𝑖) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∨ (𝐸‘𝑖) = {𝑁})) ↔ (𝑁 ∈ {𝑛, 𝑚} → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁}))))
64	56, 63	syl5ibrcom 247	. . . . . . . 8 ⊢ ((((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑖 ∈ dom 𝐸) ∧ (𝑛 ∈ 𝑉 ∧ 𝑚 ∈ 𝑉)) → ((𝐸‘𝑖) = {𝑛, 𝑚} → (𝑁 ∈ (𝐸‘𝑖) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∨ (𝐸‘𝑖) = {𝑁}))))
65	64	rexlimdvva 3195	. . . . . . 7 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑖 ∈ dom 𝐸) → (∃𝑛 ∈ 𝑉 ∃𝑚 ∈ 𝑉 (𝐸‘𝑖) = {𝑛, 𝑚} → (𝑁 ∈ (𝐸‘𝑖) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∨ (𝐸‘𝑖) = {𝑁}))))
66	24, 65	syld 47	. . . . . 6 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑖 ∈ dom 𝐸) → ((𝐸‘𝑖) ∈ (Edg‘𝐺) → (𝑁 ∈ (𝐸‘𝑖) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∨ (𝐸‘𝑖) = {𝑁}))))
67	19, 66	mpd 15	. . . . 5 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑖 ∈ dom 𝐸) → (𝑁 ∈ (𝐸‘𝑖) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∨ (𝐸‘𝑖) = {𝑁})))
68	12, 67	impbid 212	. . . 4 ⊢ (((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) ∧ 𝑖 ∈ dom 𝐸) → ((∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∨ (𝐸‘𝑖) = {𝑁}) ↔ 𝑁 ∈ (𝐸‘𝑖)))
69	68	rabbidva 3407	. . 3 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → {𝑖 ∈ dom 𝐸 ∣ (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖)) ∨ (𝐸‘𝑖) = {𝑁})} = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)})
70	4, 69	eqtrid 2784	. 2 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → ({𝑖 ∈ dom 𝐸 ∣ ∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∪ {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}}) = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)})
71	3, 70	eqtrd 2772	1 ⊢ ((𝐺 ∈ UPGraph ∧ 𝑁 ∈ 𝑉) → (∪ 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸‘𝑖) ∧ 𝑣 ∈ (𝐸‘𝑖))} ∪ {𝑖 ∈ dom 𝐸 ∣ (𝐸‘𝑖) = {𝑁}}) = {𝑖 ∈ dom 𝐸 ∣ 𝑁 ∈ (𝐸‘𝑖)})

Syntax hints:   → wi 4   ∧ wa 395   ∨ wo 848   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∃wrex 3062  {crab 3401   ∖ cdif 3900   ∪ cun 3901  {csn 4582  {cpr 4584  ∪ ciun 4948  dom cdm 5632  Fun wfun 6494  ‘cfv 6500  Vtxcvtx 29085  iEdgciedg 29086  Edgcedg 29136  UHGraphcuhgr 29145  UPGraphcupgr 29169

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-1o 8407  df-2o 8408  df-oadd 8411  df-er 8645  df-en 8896  df-dom 8897  df-sdom 8898  df-fin 8899  df-dju 9825  df-card 9863  df-pnf 11180  df-mnf 11181  df-xr 11182  df-ltxr 11183  df-le 11184  df-sub 11378  df-neg 11379  df-nn 12158  df-2 12220  df-n0 12414  df-xnn0 12487  df-z 12501  df-uz 12764  df-fz 13436  df-hash 14266  df-edg 29137  df-uhgr 29147  df-upgr 29171

This theorem is referenced by:  numedglnl  29233