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

Theorem frgrncvvdeqlem1 28084
Description: Lemma 1 for frgrncvvdeq 28094. (Contributed by Alexander van der Vekens, 23-Dec-2017.) (Revised by AV, 8-May-2021.) (Proof shortened by AV, 12-Feb-2022.)
Hypotheses
Ref Expression
frgrncvvdeq.v1 𝑉 = (Vtx‘𝐺)
frgrncvvdeq.e 𝐸 = (Edg‘𝐺)
frgrncvvdeq.nx 𝐷 = (𝐺 NeighbVtx 𝑋)
frgrncvvdeq.ny 𝑁 = (𝐺 NeighbVtx 𝑌)
frgrncvvdeq.x (𝜑𝑋𝑉)
frgrncvvdeq.y (𝜑𝑌𝑉)
frgrncvvdeq.ne (𝜑𝑋𝑌)
frgrncvvdeq.xy (𝜑𝑌𝐷)
frgrncvvdeq.f (𝜑𝐺 ∈ FriendGraph )
frgrncvvdeq.a 𝐴 = (𝑥𝐷 ↦ (𝑦𝑁 {𝑥, 𝑦} ∈ 𝐸))
Assertion
Ref Expression
frgrncvvdeqlem1 (𝜑𝑋𝑁)

Proof of Theorem frgrncvvdeqlem1
StepHypRef Expression
1 frgrncvvdeq.xy . . . 4 (𝜑𝑌𝐷)
2 df-nel 3092 . . . . 5 (𝑌𝐷 ↔ ¬ 𝑌𝐷)
3 frgrncvvdeq.nx . . . . . 6 𝐷 = (𝐺 NeighbVtx 𝑋)
43eleq2i 2881 . . . . 5 (𝑌𝐷𝑌 ∈ (𝐺 NeighbVtx 𝑋))
52, 4xchbinx 337 . . . 4 (𝑌𝐷 ↔ ¬ 𝑌 ∈ (𝐺 NeighbVtx 𝑋))
61, 5sylib 221 . . 3 (𝜑 → ¬ 𝑌 ∈ (𝐺 NeighbVtx 𝑋))
7 nbgrsym 27153 . . 3 (𝑋 ∈ (𝐺 NeighbVtx 𝑌) ↔ 𝑌 ∈ (𝐺 NeighbVtx 𝑋))
86, 7sylnibr 332 . 2 (𝜑 → ¬ 𝑋 ∈ (𝐺 NeighbVtx 𝑌))
9 frgrncvvdeq.ny . . . 4 𝑁 = (𝐺 NeighbVtx 𝑌)
10 neleq2 3097 . . . 4 (𝑁 = (𝐺 NeighbVtx 𝑌) → (𝑋𝑁𝑋 ∉ (𝐺 NeighbVtx 𝑌)))
119, 10ax-mp 5 . . 3 (𝑋𝑁𝑋 ∉ (𝐺 NeighbVtx 𝑌))
12 df-nel 3092 . . 3 (𝑋 ∉ (𝐺 NeighbVtx 𝑌) ↔ ¬ 𝑋 ∈ (𝐺 NeighbVtx 𝑌))
1311, 12bitri 278 . 2 (𝑋𝑁 ↔ ¬ 𝑋 ∈ (𝐺 NeighbVtx 𝑌))
148, 13sylibr 237 1 (𝜑𝑋𝑁)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209   = wceq 1538  wcel 2111  wne 2987  wnel 3091  {cpr 4527  cmpt 5110  cfv 6324  crio 7092  (class class class)co 7135  Vtxcvtx 26789  Edgcedg 26840   NeighbVtx cnbgr 27122   FriendGraph cfrgr 28043
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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-1st 7671  df-2nd 7672  df-nbgr 27123
This theorem is referenced by:  frgrncvvdeqlem7  28090  frgrncvvdeqlem8  28091  frgrncvvdeqlem9  28092
  Copyright terms: Public domain W3C validator