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

Theorem frgrncvvdeqlem1 30665
Description: Lemma 1 for frgrncvvdeq 30675. (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 3068 . . . . 5 (𝑌𝐷 ↔ ¬ 𝑌𝐷)
3 frgrncvvdeq.nx . . . . . 6 𝐷 = (𝐺 NeighbVtx 𝑋)
43eleq2i 2858 . . . . 5 (𝑌𝐷𝑌 ∈ (𝐺 NeighbVtx 𝑋))
52, 4xchbinx 337 . . . 4 (𝑌𝐷 ↔ ¬ 𝑌 ∈ (𝐺 NeighbVtx 𝑋))
61, 5sylib 221 . . 3 (𝜑 → ¬ 𝑌 ∈ (𝐺 NeighbVtx 𝑋))
7 nbgrsym 29728 . . 3 (𝑋 ∈ (𝐺 NeighbVtx 𝑌) ↔ 𝑌 ∈ (𝐺 NeighbVtx 𝑋))
86, 7sylnibr 332 . 2 (𝜑 → ¬ 𝑋 ∈ (𝐺 NeighbVtx 𝑌))
9 frgrncvvdeq.ny . . . 4 𝑁 = (𝐺 NeighbVtx 𝑌)
10 neleq2 3074 . . . 4 (𝑁 = (𝐺 NeighbVtx 𝑌) → (𝑋𝑁𝑋 ∉ (𝐺 NeighbVtx 𝑌)))
119, 10ax-mp 5 . . 3 (𝑋𝑁𝑋 ∉ (𝐺 NeighbVtx 𝑌))
12 df-nel 3068 . . 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 1570  wcel 2146  wne 2961  wnel 3067  {cpr 4594  cmpt 5195  cfv 6540  crio 7372  (class class class)co 7416  Vtxcvtx 29361  Edgcedg 29412   NeighbVtx cnbgr 29697   FriendGraph cfrgr 30624
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5260  ax-nul 5272  ax-pr 5407  ax-un 7738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-nel 3068  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4491  df-pw 4567  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4876  df-iun 4961  df-br 5113  df-opab 5177  df-mpt 5196  df-id 5559  df-xp 5670  df-rel 5671  df-cnv 5672  df-co 5673  df-dm 5674  df-rn 5675  df-res 5676  df-ima 5677  df-iota 6496  df-fun 6542  df-fv 6548  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7988  df-2nd 7989  df-nbgr 29698
This theorem is used by:  frgrncvvdeqlem7  30671  frgrncvvdeqlem8  30672  frgrncvvdeqlem9  30673
  Copyright terms: Public domain W3C validator