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

Theorem nbupgrres 26464
 Description: The neighborhood of a vertex in a restricted pseudograph (not necessarily valid for a hypergraph, because 𝑁, 𝐾 and 𝑀 could be connected by one edge, so 𝑀 is a neighbor of 𝐾 in the original graph, but not in the restricted graph, because the edge between 𝑀 and 𝐾, also incident with 𝑁, was removed). (Contributed by Alexander van der Vekens, 2-Jan-2018.) (Revised by AV, 8-Nov-2020.)
Hypotheses
Ref Expression
nbupgrres.v 𝑉 = (Vtx‘𝐺)
nbupgrres.e 𝐸 = (Edg‘𝐺)
nbupgrres.f 𝐹 = {𝑒𝐸𝑁𝑒}
nbupgrres.s 𝑆 = ⟨(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)⟩
Assertion
Ref Expression
nbupgrres (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) → (𝑀 ∈ (𝐺 NeighbVtx 𝐾) → 𝑀 ∈ (𝑆 NeighbVtx 𝐾)))
Distinct variable groups:   𝑒,𝐸   𝑒,𝐺   𝑒,𝐾   𝑒,𝑁   𝑒,𝑀   𝑒,𝑉
Allowed substitution hints:   𝑆(𝑒)   𝐹(𝑒)

Proof of Theorem nbupgrres
StepHypRef Expression
1 simp1l 1240 . . . . . 6 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) → 𝐺 ∈ UPGraph)
2 eldifi 3875 . . . . . . 7 (𝐾 ∈ (𝑉 ∖ {𝑁}) → 𝐾𝑉)
323ad2ant2 1129 . . . . . 6 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) → 𝐾𝑉)
4 eldifsn 4462 . . . . . . . . 9 (𝑀 ∈ ((𝑉 ∖ {𝑁}) ∖ {𝐾}) ↔ (𝑀 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀𝐾))
5 eldifi 3875 . . . . . . . . . 10 (𝑀 ∈ (𝑉 ∖ {𝑁}) → 𝑀𝑉)
65anim1i 593 . . . . . . . . 9 ((𝑀 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀𝐾) → (𝑀𝑉𝑀𝐾))
74, 6sylbi 207 . . . . . . . 8 (𝑀 ∈ ((𝑉 ∖ {𝑁}) ∖ {𝐾}) → (𝑀𝑉𝑀𝐾))
8 difpr 4479 . . . . . . . 8 (𝑉 ∖ {𝑁, 𝐾}) = ((𝑉 ∖ {𝑁}) ∖ {𝐾})
97, 8eleq2s 2857 . . . . . . 7 (𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾}) → (𝑀𝑉𝑀𝐾))
1093ad2ant3 1130 . . . . . 6 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) → (𝑀𝑉𝑀𝐾))
11 nbupgrres.v . . . . . . 7 𝑉 = (Vtx‘𝐺)
12 nbupgrres.e . . . . . . 7 𝐸 = (Edg‘𝐺)
1311, 12nbupgrel 26440 . . . . . 6 (((𝐺 ∈ UPGraph ∧ 𝐾𝑉) ∧ (𝑀𝑉𝑀𝐾)) → (𝑀 ∈ (𝐺 NeighbVtx 𝐾) ↔ {𝑀, 𝐾} ∈ 𝐸))
141, 3, 10, 13syl21anc 1476 . . . . 5 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) → (𝑀 ∈ (𝐺 NeighbVtx 𝐾) ↔ {𝑀, 𝐾} ∈ 𝐸))
1514biimpa 502 . . . 4 ((((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) ∧ 𝑀 ∈ (𝐺 NeighbVtx 𝐾)) → {𝑀, 𝐾} ∈ 𝐸)
168eleq2i 2831 . . . . . . . . . 10 (𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾}) ↔ 𝑀 ∈ ((𝑉 ∖ {𝑁}) ∖ {𝐾}))
17 eldifsn 4462 . . . . . . . . . . 11 (𝑀 ∈ (𝑉 ∖ {𝑁}) ↔ (𝑀𝑉𝑀𝑁))
1817anbi1i 733 . . . . . . . . . 10 ((𝑀 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀𝐾) ↔ ((𝑀𝑉𝑀𝑁) ∧ 𝑀𝐾))
1916, 4, 183bitri 286 . . . . . . . . 9 (𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾}) ↔ ((𝑀𝑉𝑀𝑁) ∧ 𝑀𝐾))
20 simpr 479 . . . . . . . . . . 11 ((𝑀𝑉𝑀𝑁) → 𝑀𝑁)
2120necomd 2987 . . . . . . . . . 10 ((𝑀𝑉𝑀𝑁) → 𝑁𝑀)
2221adantr 472 . . . . . . . . 9 (((𝑀𝑉𝑀𝑁) ∧ 𝑀𝐾) → 𝑁𝑀)
2319, 22sylbi 207 . . . . . . . 8 (𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾}) → 𝑁𝑀)
24233ad2ant3 1130 . . . . . . 7 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) → 𝑁𝑀)
25 eldifsn 4462 . . . . . . . . 9 (𝐾 ∈ (𝑉 ∖ {𝑁}) ↔ (𝐾𝑉𝐾𝑁))
26 simpr 479 . . . . . . . . . 10 ((𝐾𝑉𝐾𝑁) → 𝐾𝑁)
2726necomd 2987 . . . . . . . . 9 ((𝐾𝑉𝐾𝑁) → 𝑁𝐾)
2825, 27sylbi 207 . . . . . . . 8 (𝐾 ∈ (𝑉 ∖ {𝑁}) → 𝑁𝐾)
29283ad2ant2 1129 . . . . . . 7 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) → 𝑁𝐾)
3024, 29nelprd 4348 . . . . . 6 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) → ¬ 𝑁 ∈ {𝑀, 𝐾})
31 df-nel 3036 . . . . . 6 (𝑁 ∉ {𝑀, 𝐾} ↔ ¬ 𝑁 ∈ {𝑀, 𝐾})
3230, 31sylibr 224 . . . . 5 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) → 𝑁 ∉ {𝑀, 𝐾})
3332adantr 472 . . . 4 ((((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) ∧ 𝑀 ∈ (𝐺 NeighbVtx 𝐾)) → 𝑁 ∉ {𝑀, 𝐾})
34 neleq2 3041 . . . . 5 (𝑒 = {𝑀, 𝐾} → (𝑁𝑒𝑁 ∉ {𝑀, 𝐾}))
35 nbupgrres.f . . . . 5 𝐹 = {𝑒𝐸𝑁𝑒}
3634, 35elrab2 3507 . . . 4 ({𝑀, 𝐾} ∈ 𝐹 ↔ ({𝑀, 𝐾} ∈ 𝐸𝑁 ∉ {𝑀, 𝐾}))
3715, 33, 36sylanbrc 701 . . 3 ((((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) ∧ 𝑀 ∈ (𝐺 NeighbVtx 𝐾)) → {𝑀, 𝐾} ∈ 𝐹)
38 nbupgrres.s . . . . . . . 8 𝑆 = ⟨(𝑉 ∖ {𝑁}), ( I ↾ 𝐹)⟩
3911, 12, 35, 38upgrres1 26404 . . . . . . 7 ((𝐺 ∈ UPGraph ∧ 𝑁𝑉) → 𝑆 ∈ UPGraph)
40393ad2ant1 1128 . . . . . 6 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) → 𝑆 ∈ UPGraph)
41 simp2 1132 . . . . . 6 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) → 𝐾 ∈ (𝑉 ∖ {𝑁}))
4216, 4sylbb 209 . . . . . . 7 (𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾}) → (𝑀 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀𝐾))
43423ad2ant3 1130 . . . . . 6 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) → (𝑀 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀𝐾))
4440, 41, 43jca31 558 . . . . 5 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) → ((𝑆 ∈ UPGraph ∧ 𝐾 ∈ (𝑉 ∖ {𝑁})) ∧ (𝑀 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀𝐾)))
4544adantr 472 . . . 4 ((((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) ∧ 𝑀 ∈ (𝐺 NeighbVtx 𝐾)) → ((𝑆 ∈ UPGraph ∧ 𝐾 ∈ (𝑉 ∖ {𝑁})) ∧ (𝑀 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀𝐾)))
4611, 12, 35, 38upgrres1lem2 26402 . . . . . 6 (Vtx‘𝑆) = (𝑉 ∖ {𝑁})
4746eqcomi 2769 . . . . 5 (𝑉 ∖ {𝑁}) = (Vtx‘𝑆)
48 edgval 26140 . . . . . 6 (Edg‘𝑆) = ran (iEdg‘𝑆)
4911, 12, 35, 38upgrres1lem3 26403 . . . . . . 7 (iEdg‘𝑆) = ( I ↾ 𝐹)
5049rneqi 5507 . . . . . 6 ran (iEdg‘𝑆) = ran ( I ↾ 𝐹)
51 rnresi 5637 . . . . . 6 ran ( I ↾ 𝐹) = 𝐹
5248, 50, 513eqtrri 2787 . . . . 5 𝐹 = (Edg‘𝑆)
5347, 52nbupgrel 26440 . . . 4 (((𝑆 ∈ UPGraph ∧ 𝐾 ∈ (𝑉 ∖ {𝑁})) ∧ (𝑀 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀𝐾)) → (𝑀 ∈ (𝑆 NeighbVtx 𝐾) ↔ {𝑀, 𝐾} ∈ 𝐹))
5445, 53syl 17 . . 3 ((((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) ∧ 𝑀 ∈ (𝐺 NeighbVtx 𝐾)) → (𝑀 ∈ (𝑆 NeighbVtx 𝐾) ↔ {𝑀, 𝐾} ∈ 𝐹))
5537, 54mpbird 247 . 2 ((((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) ∧ 𝑀 ∈ (𝐺 NeighbVtx 𝐾)) → 𝑀 ∈ (𝑆 NeighbVtx 𝐾))
5655ex 449 1 (((𝐺 ∈ UPGraph ∧ 𝑁𝑉) ∧ 𝐾 ∈ (𝑉 ∖ {𝑁}) ∧ 𝑀 ∈ (𝑉 ∖ {𝑁, 𝐾})) → (𝑀 ∈ (𝐺 NeighbVtx 𝐾) → 𝑀 ∈ (𝑆 NeighbVtx 𝐾)))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196   ∧ wa 383   ∧ w3a 1072   = wceq 1632   ∈ wcel 2139   ≠ wne 2932   ∉ wnel 3035  {crab 3054   ∖ cdif 3712  {csn 4321  {cpr 4323  ⟨cop 4327   I cid 5173  ran crn 5267   ↾ cres 5268  ‘cfv 6049  (class class class)co 6813  Vtxcvtx 26073  iEdgciedg 26074  Edgcedg 26138  UPGraphcupgr 26174   NeighbVtx cnbgr 26423 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-rep 4923  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055  ax-un 7114  ax-cnex 10184  ax-resscn 10185  ax-1cn 10186  ax-icn 10187  ax-addcl 10188  ax-addrcl 10189  ax-mulcl 10190  ax-mulrcl 10191  ax-mulcom 10192  ax-addass 10193  ax-mulass 10194  ax-distr 10195  ax-i2m1 10196  ax-1ne0 10197  ax-1rid 10198  ax-rnegex 10199  ax-rrecex 10200  ax-cnre 10201  ax-pre-lttri 10202  ax-pre-lttrn 10203  ax-pre-ltadd 10204  ax-pre-mulgt0 10205 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-nel 3036  df-ral 3055  df-rex 3056  df-reu 3057  df-rmo 3058  df-rab 3059  df-v 3342  df-sbc 3577  df-csb 3675  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-pss 3731  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-tp 4326  df-op 4328  df-uni 4589  df-int 4628  df-iun 4674  df-br 4805  df-opab 4865  df-mpt 4882  df-tr 4905  df-id 5174  df-eprel 5179  df-po 5187  df-so 5188  df-fr 5225  df-we 5227  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-pred 5841  df-ord 5887  df-on 5888  df-lim 5889  df-suc 5890  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-f1 6054  df-fo 6055  df-f1o 6056  df-fv 6057  df-riota 6774  df-ov 6816  df-oprab 6817  df-mpt2 6818  df-om 7231  df-1st 7333  df-2nd 7334  df-wrecs 7576  df-recs 7637  df-rdg 7675  df-1o 7729  df-2o 7730  df-oadd 7733  df-er 7911  df-en 8122  df-dom 8123  df-sdom 8124  df-fin 8125  df-card 8955  df-cda 9182  df-pnf 10268  df-mnf 10269  df-xr 10270  df-ltxr 10271  df-le 10272  df-sub 10460  df-neg 10461  df-nn 11213  df-2 11271  df-n0 11485  df-xnn0 11556  df-z 11570  df-uz 11880  df-fz 12520  df-hash 13312  df-vtx 26075  df-iedg 26076  df-edg 26139  df-upgr 26176  df-nbgr 26424 This theorem is referenced by:  nbupgruvtxres  26512
 Copyright terms: Public domain W3C validator