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

Theorem nbumgrvtx 26136
 Description: The set of neighbors of a vertex in a multigraph. (Contributed by AV, 27-Nov-2020.) (Proof shortened by AV, 30-Dec-2020.)
Hypotheses
Ref Expression
nbgrel.v 𝑉 = (Vtx‘𝐺)
nbgrel.e 𝐸 = (Edg‘𝐺)
Assertion
Ref Expression
nbumgrvtx ((𝐺 ∈ UMGraph ∧ 𝑁𝑉) → (𝐺 NeighbVtx 𝑁) = {𝑛𝑉 ∣ {𝑁, 𝑛} ∈ 𝐸})
Distinct variable groups:   𝑛,𝐺   𝑛,𝑁   𝑛,𝑉   𝑛,𝐸

Proof of Theorem nbumgrvtx
Dummy variables 𝑒 𝑣 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nbgrel.v . . . 4 𝑉 = (Vtx‘𝐺)
2 nbgrel.e . . . 4 𝐸 = (Edg‘𝐺)
31, 2nbgrval 26128 . . 3 (𝑁𝑉 → (𝐺 NeighbVtx 𝑁) = {𝑣 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒𝐸 {𝑁, 𝑣} ⊆ 𝑒})
43adantl 482 . 2 ((𝐺 ∈ UMGraph ∧ 𝑁𝑉) → (𝐺 NeighbVtx 𝑁) = {𝑣 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒𝐸 {𝑁, 𝑣} ⊆ 𝑒})
5 eldifi 3712 . . . . . . . . . 10 (𝑥 ∈ (𝑉 ∖ {𝑁}) → 𝑥𝑉)
65adantl 482 . . . . . . . . 9 (((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) → 𝑥𝑉)
76adantr 481 . . . . . . . 8 ((((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) ∧ (𝑒𝐸 ∧ {𝑁, 𝑥} ⊆ 𝑒)) → 𝑥𝑉)
8 umgrupgr 25900 . . . . . . . . . . . . 13 (𝐺 ∈ UMGraph → 𝐺 ∈ UPGraph )
98ad4antr 767 . . . . . . . . . . . 12 (((((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) ∧ 𝑒𝐸) ∧ {𝑁, 𝑥} ⊆ 𝑒) → 𝐺 ∈ UPGraph )
10 simpr 477 . . . . . . . . . . . . 13 ((((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) ∧ 𝑒𝐸) → 𝑒𝐸)
1110adantr 481 . . . . . . . . . . . 12 (((((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) ∧ 𝑒𝐸) ∧ {𝑁, 𝑥} ⊆ 𝑒) → 𝑒𝐸)
12 simpr 477 . . . . . . . . . . . 12 (((((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) ∧ 𝑒𝐸) ∧ {𝑁, 𝑥} ⊆ 𝑒) → {𝑁, 𝑥} ⊆ 𝑒)
13 simpr 477 . . . . . . . . . . . . . . . 16 ((𝐺 ∈ UMGraph ∧ 𝑁𝑉) → 𝑁𝑉)
1413adantr 481 . . . . . . . . . . . . . . 15 (((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) → 𝑁𝑉)
15 vex 3189 . . . . . . . . . . . . . . . 16 𝑥 ∈ V
1615a1i 11 . . . . . . . . . . . . . . 15 (((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) → 𝑥 ∈ V)
17 eldifsn 4289 . . . . . . . . . . . . . . . . 17 (𝑥 ∈ (𝑉 ∖ {𝑁}) ↔ (𝑥𝑉𝑥𝑁))
18 simpr 477 . . . . . . . . . . . . . . . . . 18 ((𝑥𝑉𝑥𝑁) → 𝑥𝑁)
1918necomd 2845 . . . . . . . . . . . . . . . . 17 ((𝑥𝑉𝑥𝑁) → 𝑁𝑥)
2017, 19sylbi 207 . . . . . . . . . . . . . . . 16 (𝑥 ∈ (𝑉 ∖ {𝑁}) → 𝑁𝑥)
2120adantl 482 . . . . . . . . . . . . . . 15 (((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) → 𝑁𝑥)
2214, 16, 213jca 1240 . . . . . . . . . . . . . 14 (((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) → (𝑁𝑉𝑥 ∈ V ∧ 𝑁𝑥))
2322adantr 481 . . . . . . . . . . . . 13 ((((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) ∧ 𝑒𝐸) → (𝑁𝑉𝑥 ∈ V ∧ 𝑁𝑥))
2423adantr 481 . . . . . . . . . . . 12 (((((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) ∧ 𝑒𝐸) ∧ {𝑁, 𝑥} ⊆ 𝑒) → (𝑁𝑉𝑥 ∈ V ∧ 𝑁𝑥))
251, 2upgredgpr 25939 . . . . . . . . . . . 12 (((𝐺 ∈ UPGraph ∧ 𝑒𝐸 ∧ {𝑁, 𝑥} ⊆ 𝑒) ∧ (𝑁𝑉𝑥 ∈ V ∧ 𝑁𝑥)) → {𝑁, 𝑥} = 𝑒)
269, 11, 12, 24, 25syl31anc 1326 . . . . . . . . . . 11 (((((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) ∧ 𝑒𝐸) ∧ {𝑁, 𝑥} ⊆ 𝑒) → {𝑁, 𝑥} = 𝑒)
2726ex 450 . . . . . . . . . 10 ((((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) ∧ 𝑒𝐸) → ({𝑁, 𝑥} ⊆ 𝑒 → {𝑁, 𝑥} = 𝑒))
28 eleq1 2686 . . . . . . . . . . 11 ({𝑁, 𝑥} = 𝑒 → ({𝑁, 𝑥} ∈ 𝐸𝑒𝐸))
2928biimprd 238 . . . . . . . . . 10 ({𝑁, 𝑥} = 𝑒 → (𝑒𝐸 → {𝑁, 𝑥} ∈ 𝐸))
3027, 10, 29syl6ci 71 . . . . . . . . 9 ((((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) ∧ 𝑒𝐸) → ({𝑁, 𝑥} ⊆ 𝑒 → {𝑁, 𝑥} ∈ 𝐸))
3130impr 648 . . . . . . . 8 ((((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) ∧ (𝑒𝐸 ∧ {𝑁, 𝑥} ⊆ 𝑒)) → {𝑁, 𝑥} ∈ 𝐸)
327, 31jca 554 . . . . . . 7 ((((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) ∧ (𝑒𝐸 ∧ {𝑁, 𝑥} ⊆ 𝑒)) → (𝑥𝑉 ∧ {𝑁, 𝑥} ∈ 𝐸))
3332rexlimdvaa 3025 . . . . . 6 (((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ 𝑥 ∈ (𝑉 ∖ {𝑁})) → (∃𝑒𝐸 {𝑁, 𝑥} ⊆ 𝑒 → (𝑥𝑉 ∧ {𝑁, 𝑥} ∈ 𝐸)))
3433expimpd 628 . . . . 5 ((𝐺 ∈ UMGraph ∧ 𝑁𝑉) → ((𝑥 ∈ (𝑉 ∖ {𝑁}) ∧ ∃𝑒𝐸 {𝑁, 𝑥} ⊆ 𝑒) → (𝑥𝑉 ∧ {𝑁, 𝑥} ∈ 𝐸)))
35 simprl 793 . . . . . . . 8 (((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ (𝑥𝑉 ∧ {𝑁, 𝑥} ∈ 𝐸)) → 𝑥𝑉)
362umgredgne 25940 . . . . . . . . . 10 ((𝐺 ∈ UMGraph ∧ {𝑁, 𝑥} ∈ 𝐸) → 𝑁𝑥)
3736ad2ant2rl 784 . . . . . . . . 9 (((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ (𝑥𝑉 ∧ {𝑁, 𝑥} ∈ 𝐸)) → 𝑁𝑥)
3837necomd 2845 . . . . . . . 8 (((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ (𝑥𝑉 ∧ {𝑁, 𝑥} ∈ 𝐸)) → 𝑥𝑁)
3935, 38, 17sylanbrc 697 . . . . . . 7 (((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ (𝑥𝑉 ∧ {𝑁, 𝑥} ∈ 𝐸)) → 𝑥 ∈ (𝑉 ∖ {𝑁}))
40 simpr 477 . . . . . . . . 9 ((𝑥𝑉 ∧ {𝑁, 𝑥} ∈ 𝐸) → {𝑁, 𝑥} ∈ 𝐸)
4140adantl 482 . . . . . . . 8 (((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ (𝑥𝑉 ∧ {𝑁, 𝑥} ∈ 𝐸)) → {𝑁, 𝑥} ∈ 𝐸)
42 sseq2 3608 . . . . . . . . 9 (𝑒 = {𝑁, 𝑥} → ({𝑁, 𝑥} ⊆ 𝑒 ↔ {𝑁, 𝑥} ⊆ {𝑁, 𝑥}))
4342adantl 482 . . . . . . . 8 ((((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ (𝑥𝑉 ∧ {𝑁, 𝑥} ∈ 𝐸)) ∧ 𝑒 = {𝑁, 𝑥}) → ({𝑁, 𝑥} ⊆ 𝑒 ↔ {𝑁, 𝑥} ⊆ {𝑁, 𝑥}))
44 ssid 3605 . . . . . . . . 9 {𝑁, 𝑥} ⊆ {𝑁, 𝑥}
4544a1i 11 . . . . . . . 8 (((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ (𝑥𝑉 ∧ {𝑁, 𝑥} ∈ 𝐸)) → {𝑁, 𝑥} ⊆ {𝑁, 𝑥})
4641, 43, 45rspcedvd 3302 . . . . . . 7 (((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ (𝑥𝑉 ∧ {𝑁, 𝑥} ∈ 𝐸)) → ∃𝑒𝐸 {𝑁, 𝑥} ⊆ 𝑒)
4739, 46jca 554 . . . . . 6 (((𝐺 ∈ UMGraph ∧ 𝑁𝑉) ∧ (𝑥𝑉 ∧ {𝑁, 𝑥} ∈ 𝐸)) → (𝑥 ∈ (𝑉 ∖ {𝑁}) ∧ ∃𝑒𝐸 {𝑁, 𝑥} ⊆ 𝑒))
4847ex 450 . . . . 5 ((𝐺 ∈ UMGraph ∧ 𝑁𝑉) → ((𝑥𝑉 ∧ {𝑁, 𝑥} ∈ 𝐸) → (𝑥 ∈ (𝑉 ∖ {𝑁}) ∧ ∃𝑒𝐸 {𝑁, 𝑥} ⊆ 𝑒)))
4934, 48impbid 202 . . . 4 ((𝐺 ∈ UMGraph ∧ 𝑁𝑉) → ((𝑥 ∈ (𝑉 ∖ {𝑁}) ∧ ∃𝑒𝐸 {𝑁, 𝑥} ⊆ 𝑒) ↔ (𝑥𝑉 ∧ {𝑁, 𝑥} ∈ 𝐸)))
50 preq2 4241 . . . . . . 7 (𝑣 = 𝑥 → {𝑁, 𝑣} = {𝑁, 𝑥})
5150sseq1d 3613 . . . . . 6 (𝑣 = 𝑥 → ({𝑁, 𝑣} ⊆ 𝑒 ↔ {𝑁, 𝑥} ⊆ 𝑒))
5251rexbidv 3045 . . . . 5 (𝑣 = 𝑥 → (∃𝑒𝐸 {𝑁, 𝑣} ⊆ 𝑒 ↔ ∃𝑒𝐸 {𝑁, 𝑥} ⊆ 𝑒))
5352elrab 3347 . . . 4 (𝑥 ∈ {𝑣 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒𝐸 {𝑁, 𝑣} ⊆ 𝑒} ↔ (𝑥 ∈ (𝑉 ∖ {𝑁}) ∧ ∃𝑒𝐸 {𝑁, 𝑥} ⊆ 𝑒))
54 preq2 4241 . . . . . 6 (𝑛 = 𝑥 → {𝑁, 𝑛} = {𝑁, 𝑥})
5554eleq1d 2683 . . . . 5 (𝑛 = 𝑥 → ({𝑁, 𝑛} ∈ 𝐸 ↔ {𝑁, 𝑥} ∈ 𝐸))
5655elrab 3347 . . . 4 (𝑥 ∈ {𝑛𝑉 ∣ {𝑁, 𝑛} ∈ 𝐸} ↔ (𝑥𝑉 ∧ {𝑁, 𝑥} ∈ 𝐸))
5749, 53, 563bitr4g 303 . . 3 ((𝐺 ∈ UMGraph ∧ 𝑁𝑉) → (𝑥 ∈ {𝑣 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒𝐸 {𝑁, 𝑣} ⊆ 𝑒} ↔ 𝑥 ∈ {𝑛𝑉 ∣ {𝑁, 𝑛} ∈ 𝐸}))
5857eqrdv 2619 . 2 ((𝐺 ∈ UMGraph ∧ 𝑁𝑉) → {𝑣 ∈ (𝑉 ∖ {𝑁}) ∣ ∃𝑒𝐸 {𝑁, 𝑣} ⊆ 𝑒} = {𝑛𝑉 ∣ {𝑁, 𝑛} ∈ 𝐸})
594, 58eqtrd 2655 1 ((𝐺 ∈ UMGraph ∧ 𝑁𝑉) → (𝐺 NeighbVtx 𝑁) = {𝑛𝑉 ∣ {𝑁, 𝑛} ∈ 𝐸})
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   ∧ w3a 1036   = wceq 1480   ∈ wcel 1987   ≠ wne 2790  ∃wrex 2908  {crab 2911  Vcvv 3186   ∖ cdif 3553   ⊆ wss 3556  {csn 4150  {cpr 4152  ‘cfv 5849  (class class class)co 6607  Vtxcvtx 25781  Edgcedg 25846   UPGraph cupgr 25878   UMGraph cumgr 25879   NeighbVtx cnbgr 26118 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4733  ax-sep 4743  ax-nul 4751  ax-pow 4805  ax-pr 4869  ax-un 6905  ax-cnex 9939  ax-resscn 9940  ax-1cn 9941  ax-icn 9942  ax-addcl 9943  ax-addrcl 9944  ax-mulcl 9945  ax-mulrcl 9946  ax-mulcom 9947  ax-addass 9948  ax-mulass 9949  ax-distr 9950  ax-i2m1 9951  ax-1ne0 9952  ax-1rid 9953  ax-rnegex 9954  ax-rrecex 9955  ax-cnre 9956  ax-pre-lttri 9957  ax-pre-lttrn 9958  ax-pre-ltadd 9959  ax-pre-mulgt0 9960 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-nel 2894  df-ral 2912  df-rex 2913  df-reu 2914  df-rmo 2915  df-rab 2916  df-v 3188  df-sbc 3419  df-csb 3516  df-dif 3559  df-un 3561  df-in 3563  df-ss 3570  df-pss 3572  df-nul 3894  df-if 4061  df-pw 4134  df-sn 4151  df-pr 4153  df-tp 4155  df-op 4157  df-uni 4405  df-int 4443  df-iun 4489  df-br 4616  df-opab 4676  df-mpt 4677  df-tr 4715  df-eprel 4987  df-id 4991  df-po 4997  df-so 4998  df-fr 5035  df-we 5037  df-xp 5082  df-rel 5083  df-cnv 5084  df-co 5085  df-dm 5086  df-rn 5087  df-res 5088  df-ima 5089  df-pred 5641  df-ord 5687  df-on 5688  df-lim 5689  df-suc 5690  df-iota 5812  df-fun 5851  df-fn 5852  df-f 5853  df-f1 5854  df-fo 5855  df-f1o 5856  df-fv 5857  df-riota 6568  df-ov 6610  df-oprab 6611  df-mpt2 6612  df-om 7016  df-1st 7116  df-2nd 7117  df-wrecs 7355  df-recs 7416  df-rdg 7454  df-1o 7508  df-2o 7509  df-oadd 7512  df-er 7690  df-en 7903  df-dom 7904  df-sdom 7905  df-fin 7906  df-card 8712  df-cda 8937  df-pnf 10023  df-mnf 10024  df-xr 10025  df-ltxr 10026  df-le 10027  df-sub 10215  df-neg 10216  df-nn 10968  df-2 11026  df-n0 11240  df-xnn0 11311  df-z 11325  df-uz 11635  df-fz 12272  df-hash 13061  df-edg 25847  df-upgr 25880  df-umgr 25881  df-nbgr 26122 This theorem is referenced by:  nbumgr  26137  nbusgrvtx  26138  umgr2v2enb1  26315
 Copyright terms: Public domain W3C validator