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

Theorem edglnl 26083
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.
StepHypRef Expression
1 iunrab 4599 . . . 4 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖))} = {𝑖 ∈ dom 𝐸 ∣ ∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖))}
21a1i 11 . . 3 ((𝐺 ∈ UPGraph ∧ 𝑁𝑉) → 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖))} = {𝑖 ∈ dom 𝐸 ∣ ∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖))})
32uneq1d 3799 . 2 ((𝐺 ∈ UPGraph ∧ 𝑁𝑉) → ( 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖))} ∪ {𝑖 ∈ dom 𝐸 ∣ (𝐸𝑖) = {𝑁}}) = ({𝑖 ∈ dom 𝐸 ∣ ∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖))} ∪ {𝑖 ∈ dom 𝐸 ∣ (𝐸𝑖) = {𝑁}}))
4 unrab 3931 . . 3 ({𝑖 ∈ dom 𝐸 ∣ ∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖))} ∪ {𝑖 ∈ dom 𝐸 ∣ (𝐸𝑖) = {𝑁}}) = {𝑖 ∈ dom 𝐸 ∣ (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖)) ∨ (𝐸𝑖) = {𝑁})}
5 simpl 472 . . . . . . . 8 ((𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖)) → 𝑁 ∈ (𝐸𝑖))
65rexlimivw 3058 . . . . . . 7 (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖)) → 𝑁 ∈ (𝐸𝑖))
76a1i 11 . . . . . 6 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝑖 ∈ dom 𝐸) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖)) → 𝑁 ∈ (𝐸𝑖)))
8 snidg 4239 . . . . . . . 8 (𝑁𝑉𝑁 ∈ {𝑁})
98ad2antlr 763 . . . . . . 7 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝑖 ∈ dom 𝐸) → 𝑁 ∈ {𝑁})
10 eleq2 2719 . . . . . . 7 ((𝐸𝑖) = {𝑁} → (𝑁 ∈ (𝐸𝑖) ↔ 𝑁 ∈ {𝑁}))
119, 10syl5ibrcom 237 . . . . . 6 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝑖 ∈ dom 𝐸) → ((𝐸𝑖) = {𝑁} → 𝑁 ∈ (𝐸𝑖)))
127, 11jaod 394 . . . . 5 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝑖 ∈ dom 𝐸) → ((∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖)) ∨ (𝐸𝑖) = {𝑁}) → 𝑁 ∈ (𝐸𝑖)))
13 upgruhgr 26042 . . . . . . . . 9 (𝐺 ∈ UPGraph → 𝐺 ∈ UHGraph)
14 edglnl.e . . . . . . . . . 10 𝐸 = (iEdg‘𝐺)
1514uhgrfun 26006 . . . . . . . . 9 (𝐺 ∈ UHGraph → Fun 𝐸)
1613, 15syl 17 . . . . . . . 8 (𝐺 ∈ UPGraph → Fun 𝐸)
1716adantr 480 . . . . . . 7 ((𝐺 ∈ UPGraph ∧ 𝑁𝑉) → Fun 𝐸)
1814iedgedg 25988 . . . . . . 7 ((Fun 𝐸𝑖 ∈ dom 𝐸) → (𝐸𝑖) ∈ (Edg‘𝐺))
1917, 18sylan 487 . . . . . 6 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝑖 ∈ dom 𝐸) → (𝐸𝑖) ∈ (Edg‘𝐺))
20 edglnl.v . . . . . . . . . 10 𝑉 = (Vtx‘𝐺)
21 eqid 2651 . . . . . . . . . 10 (Edg‘𝐺) = (Edg‘𝐺)
2220, 21upgredg 26077 . . . . . . . . 9 ((𝐺 ∈ UPGraph ∧ (𝐸𝑖) ∈ (Edg‘𝐺)) → ∃𝑛𝑉𝑚𝑉 (𝐸𝑖) = {𝑛, 𝑚})
2322ex 449 . . . . . . . 8 (𝐺 ∈ UPGraph → ((𝐸𝑖) ∈ (Edg‘𝐺) → ∃𝑛𝑉𝑚𝑉 (𝐸𝑖) = {𝑛, 𝑚}))
2423ad2antrr 762 . . . . . . 7 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝑖 ∈ dom 𝐸) → ((𝐸𝑖) ∈ (Edg‘𝐺) → ∃𝑛𝑉𝑚𝑉 (𝐸𝑖) = {𝑛, 𝑚}))
25 dfsn2 4223 . . . . . . . . . . . . . . . . . . . . . 22 {𝑛} = {𝑛, 𝑛}
2625eqcomi 2660 . . . . . . . . . . . . . . . . . . . . 21 {𝑛, 𝑛} = {𝑛}
27 elsni 4227 . . . . . . . . . . . . . . . . . . . . . 22 (𝑁 ∈ {𝑛} → 𝑁 = 𝑛)
28 sneq 4220 . . . . . . . . . . . . . . . . . . . . . . 23 (𝑁 = 𝑛 → {𝑁} = {𝑛})
2928eqcomd 2657 . . . . . . . . . . . . . . . . . . . . . 22 (𝑁 = 𝑛 → {𝑛} = {𝑁})
3027, 29syl 17 . . . . . . . . . . . . . . . . . . . . 21 (𝑁 ∈ {𝑛} → {𝑛} = {𝑁})
3126, 30syl5eq 2697 . . . . . . . . . . . . . . . . . . . 20 (𝑁 ∈ {𝑛} → {𝑛, 𝑛} = {𝑁})
3231, 26eleq2s 2748 . . . . . . . . . . . . . . . . . . 19 (𝑁 ∈ {𝑛, 𝑛} → {𝑛, 𝑛} = {𝑁})
33 preq2 4301 . . . . . . . . . . . . . . . . . . . . 21 (𝑚 = 𝑛 → {𝑛, 𝑚} = {𝑛, 𝑛})
3433eleq2d 2716 . . . . . . . . . . . . . . . . . . . 20 (𝑚 = 𝑛 → (𝑁 ∈ {𝑛, 𝑚} ↔ 𝑁 ∈ {𝑛, 𝑛}))
3533eqeq1d 2653 . . . . . . . . . . . . . . . . . . . 20 (𝑚 = 𝑛 → ({𝑛, 𝑚} = {𝑁} ↔ {𝑛, 𝑛} = {𝑁}))
3634, 35imbi12d 333 . . . . . . . . . . . . . . . . . . 19 (𝑚 = 𝑛 → ((𝑁 ∈ {𝑛, 𝑚} → {𝑛, 𝑚} = {𝑁}) ↔ (𝑁 ∈ {𝑛, 𝑛} → {𝑛, 𝑛} = {𝑁})))
3732, 36mpbiri 248 . . . . . . . . . . . . . . . . . 18 (𝑚 = 𝑛 → (𝑁 ∈ {𝑛, 𝑚} → {𝑛, 𝑚} = {𝑁}))
3837imp 444 . . . . . . . . . . . . . . . . 17 ((𝑚 = 𝑛𝑁 ∈ {𝑛, 𝑚}) → {𝑛, 𝑚} = {𝑁})
3938olcd 407 . . . . . . . . . . . . . . . 16 ((𝑚 = 𝑛𝑁 ∈ {𝑛, 𝑚}) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁}))
4039expcom 450 . . . . . . . . . . . . . . 15 (𝑁 ∈ {𝑛, 𝑚} → (𝑚 = 𝑛 → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁})))
41403ad2ant3 1104 . . . . . . . . . . . . . 14 ((𝑁𝑉 ∧ (𝑛𝑉𝑚𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚}) → (𝑚 = 𝑛 → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁})))
4241com12 32 . . . . . . . . . . . . 13 (𝑚 = 𝑛 → ((𝑁𝑉 ∧ (𝑛𝑉𝑚𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚}) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁})))
43 simpr3 1089 . . . . . . . . . . . . . . . 16 ((𝑚𝑛 ∧ (𝑁𝑉 ∧ (𝑛𝑉𝑚𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚})) → 𝑁 ∈ {𝑛, 𝑚})
44 simpl 472 . . . . . . . . . . . . . . . . . 18 ((𝑚𝑛 ∧ (𝑁𝑉 ∧ (𝑛𝑉𝑚𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚})) → 𝑚𝑛)
4544necomd 2878 . . . . . . . . . . . . . . . . 17 ((𝑚𝑛 ∧ (𝑁𝑉 ∧ (𝑛𝑉𝑚𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚})) → 𝑛𝑚)
46 simpr2 1088 . . . . . . . . . . . . . . . . 17 ((𝑚𝑛 ∧ (𝑁𝑉 ∧ (𝑛𝑉𝑚𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚})) → (𝑛𝑉𝑚𝑉))
47 prproe 4466 . . . . . . . . . . . . . . . . 17 ((𝑁 ∈ {𝑛, 𝑚} ∧ 𝑛𝑚 ∧ (𝑛𝑉𝑚𝑉)) → ∃𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ {𝑛, 𝑚})
4843, 45, 46, 47syl3anc 1366 . . . . . . . . . . . . . . . 16 ((𝑚𝑛 ∧ (𝑁𝑉 ∧ (𝑛𝑉𝑚𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚})) → ∃𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ {𝑛, 𝑚})
49 r19.42v 3121 . . . . . . . . . . . . . . . 16 (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ↔ (𝑁 ∈ {𝑛, 𝑚} ∧ ∃𝑣 ∈ (𝑉 ∖ {𝑁})𝑣 ∈ {𝑛, 𝑚}))
5043, 48, 49sylanbrc 699 . . . . . . . . . . . . . . 15 ((𝑚𝑛 ∧ (𝑁𝑉 ∧ (𝑛𝑉𝑚𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚})) → ∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}))
5150orcd 406 . . . . . . . . . . . . . 14 ((𝑚𝑛 ∧ (𝑁𝑉 ∧ (𝑛𝑉𝑚𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚})) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁}))
5251ex 449 . . . . . . . . . . . . 13 (𝑚𝑛 → ((𝑁𝑉 ∧ (𝑛𝑉𝑚𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚}) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁})))
5342, 52pm2.61ine 2906 . . . . . . . . . . . 12 ((𝑁𝑉 ∧ (𝑛𝑉𝑚𝑉) ∧ 𝑁 ∈ {𝑛, 𝑚}) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁}))
54533exp 1283 . . . . . . . . . . 11 (𝑁𝑉 → ((𝑛𝑉𝑚𝑉) → (𝑁 ∈ {𝑛, 𝑚} → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁}))))
5554ad2antlr 763 . . . . . . . . . 10 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝑖 ∈ dom 𝐸) → ((𝑛𝑉𝑚𝑉) → (𝑁 ∈ {𝑛, 𝑚} → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁}))))
5655imp 444 . . . . . . . . 9 ((((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝑖 ∈ dom 𝐸) ∧ (𝑛𝑉𝑚𝑉)) → (𝑁 ∈ {𝑛, 𝑚} → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁})))
57 eleq2 2719 . . . . . . . . . 10 ((𝐸𝑖) = {𝑛, 𝑚} → (𝑁 ∈ (𝐸𝑖) ↔ 𝑁 ∈ {𝑛, 𝑚}))
58 eleq2 2719 . . . . . . . . . . . . 13 ((𝐸𝑖) = {𝑛, 𝑚} → (𝑣 ∈ (𝐸𝑖) ↔ 𝑣 ∈ {𝑛, 𝑚}))
5957, 58anbi12d 747 . . . . . . . . . . . 12 ((𝐸𝑖) = {𝑛, 𝑚} → ((𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖)) ↔ (𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚})))
6059rexbidv 3081 . . . . . . . . . . 11 ((𝐸𝑖) = {𝑛, 𝑚} → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖)) ↔ ∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚})))
61 eqeq1 2655 . . . . . . . . . . 11 ((𝐸𝑖) = {𝑛, 𝑚} → ((𝐸𝑖) = {𝑁} ↔ {𝑛, 𝑚} = {𝑁}))
6260, 61orbi12d 746 . . . . . . . . . 10 ((𝐸𝑖) = {𝑛, 𝑚} → ((∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖)) ∨ (𝐸𝑖) = {𝑁}) ↔ (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁})))
6357, 62imbi12d 333 . . . . . . . . 9 ((𝐸𝑖) = {𝑛, 𝑚} → ((𝑁 ∈ (𝐸𝑖) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖)) ∨ (𝐸𝑖) = {𝑁})) ↔ (𝑁 ∈ {𝑛, 𝑚} → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ {𝑛, 𝑚} ∧ 𝑣 ∈ {𝑛, 𝑚}) ∨ {𝑛, 𝑚} = {𝑁}))))
6456, 63syl5ibrcom 237 . . . . . . . 8 ((((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝑖 ∈ dom 𝐸) ∧ (𝑛𝑉𝑚𝑉)) → ((𝐸𝑖) = {𝑛, 𝑚} → (𝑁 ∈ (𝐸𝑖) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖)) ∨ (𝐸𝑖) = {𝑁}))))
6564rexlimdvva 3067 . . . . . . 7 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝑖 ∈ dom 𝐸) → (∃𝑛𝑉𝑚𝑉 (𝐸𝑖) = {𝑛, 𝑚} → (𝑁 ∈ (𝐸𝑖) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖)) ∨ (𝐸𝑖) = {𝑁}))))
6624, 65syld 47 . . . . . 6 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝑖 ∈ dom 𝐸) → ((𝐸𝑖) ∈ (Edg‘𝐺) → (𝑁 ∈ (𝐸𝑖) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖)) ∨ (𝐸𝑖) = {𝑁}))))
6719, 66mpd 15 . . . . 5 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝑖 ∈ dom 𝐸) → (𝑁 ∈ (𝐸𝑖) → (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖)) ∨ (𝐸𝑖) = {𝑁})))
6812, 67impbid 202 . . . 4 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝑖 ∈ dom 𝐸) → ((∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖)) ∨ (𝐸𝑖) = {𝑁}) ↔ 𝑁 ∈ (𝐸𝑖)))
6968rabbidva 3219 . . 3 ((𝐺 ∈ UPGraph ∧ 𝑁𝑉) → {𝑖 ∈ dom 𝐸 ∣ (∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖)) ∨ (𝐸𝑖) = {𝑁})} = {𝑖 ∈ dom 𝐸𝑁 ∈ (𝐸𝑖)})
704, 69syl5eq 2697 . 2 ((𝐺 ∈ UPGraph ∧ 𝑁𝑉) → ({𝑖 ∈ dom 𝐸 ∣ ∃𝑣 ∈ (𝑉 ∖ {𝑁})(𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖))} ∪ {𝑖 ∈ dom 𝐸 ∣ (𝐸𝑖) = {𝑁}}) = {𝑖 ∈ dom 𝐸𝑁 ∈ (𝐸𝑖)})
713, 70eqtrd 2685 1 ((𝐺 ∈ UPGraph ∧ 𝑁𝑉) → ( 𝑣 ∈ (𝑉 ∖ {𝑁}){𝑖 ∈ dom 𝐸 ∣ (𝑁 ∈ (𝐸𝑖) ∧ 𝑣 ∈ (𝐸𝑖))} ∪ {𝑖 ∈ dom 𝐸 ∣ (𝐸𝑖) = {𝑁}}) = {𝑖 ∈ dom 𝐸𝑁 ∈ (𝐸𝑖)})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wo 382  wa 383  w3a 1054   = wceq 1523  wcel 2030  wne 2823  wrex 2942  {crab 2945  cdif 3604  cun 3605  {csn 4210  {cpr 4212   ciun 4552  dom cdm 5143  Fun wfun 5920  cfv 5926  Vtxcvtx 25919  iEdgciedg 25920  Edgcedg 25984  UHGraphcuhgr 25996  UPGraphcupgr 26020
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-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
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1055  df-3an 1056  df-tru 1526  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-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-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-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-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-nn 11059  df-2 11117  df-n0 11331  df-xnn0 11402  df-z 11416  df-uz 11726  df-fz 12365  df-hash 13158  df-edg 25985  df-uhgr 25998  df-upgr 26022
This theorem is referenced by:  numedglnl  26084
  Copyright terms: Public domain W3C validator