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

Theorem frgrncvvdeqlem1 30900
Description: Lemma 1 for frgrncvvdeq 30910. (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 3062 . . . . 5 (𝑌 ∉ 𝐷 ↔ ¬ 𝑌 ∈ 𝐷)
3 frgrncvvdeq.nx . . . . . 6 𝐷 = (𝐺 NeighbVtx 𝑋)
43eleq2i 2852 . . . . 5 (𝑌 ∈ 𝐷 ↔ 𝑌 ∈ (𝐺 NeighbVtx 𝑋))
52, 4xchbinx 337 . . . 4 (𝑌 ∉ 𝐷 ↔ ¬ 𝑌 ∈ (𝐺 NeighbVtx 𝑋))
61, 5sylib 221 . . 3 (𝜑 → ¬ 𝑌 ∈ (𝐺 NeighbVtx 𝑋))
7 nbgrsym 29944 . . 3 (𝑋 ∈ (𝐺 NeighbVtx 𝑌) ↔ 𝑌 ∈ (𝐺 NeighbVtx 𝑋))
86, 7sylnibr 332 . 2 (𝜑 → ¬ 𝑋 ∈ (𝐺 NeighbVtx 𝑌))
9 frgrncvvdeq.ny . . . 4 𝑁 = (𝐺 NeighbVtx 𝑌)
10 neleq2 3068 . . . 4 (𝑁 = (𝐺 NeighbVtx 𝑌) → (𝑋 ∉ 𝑁 ↔ 𝑋 ∉ (𝐺 NeighbVtx 𝑌)))
119, 10ax-mp 5 . . 3 (𝑋 ∉ 𝑁 ↔ 𝑋 ∉ (𝐺 NeighbVtx 𝑌))
12 df-nel 3062 . . 3 (𝑋 ∉ (𝐺 NeighbVtx 𝑌) ↔ ¬ 𝑋 ∈ (𝐺 NeighbVtx 𝑌))
1311, 12bitri 278 . 2 (𝑋 ∉ 𝑁 ↔ ¬ 𝑋 ∈ (𝐺 NeighbVtx 𝑌))
148, 13sylibr 237 1 (𝜑 → 𝑋 ∉ 𝑁)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   = wceq 1569   ∈ wcel 2144   ≠ wne 2955   ∉ wnel 3061  {cpr 4585   ↦ cmpt 5185  ‘cfv 6538  ℩crio 7376  (class class class)co 7420  Vtxcvtx 29574  Edgcedg 29625   NeighbVtx cnbgr 29913   FriendGraph cfrgr 30859
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-nbgr 29914
This theorem is used by:  frgrncvvdeqlem7  30906  frgrncvvdeqlem8  30907  frgrncvvdeqlem9  30908
  Copyright terms: Public domain W3C validator