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

Theorem frcond1 28029
Description: The friendship condition: any two (different) vertices in a friendship graph have a unique common neighbor. (Contributed by Alexander van der Vekens, 19-Dec-2017.) (Revised by AV, 29-Mar-2021.)
Hypotheses
Ref Expression
frcond1.v 𝑉 = (Vtx‘𝐺)
frcond1.e 𝐸 = (Edg‘𝐺)
Assertion
Ref Expression
frcond1 (𝐺 ∈ FriendGraph → ((𝐴𝑉𝐶𝑉𝐴𝐶) → ∃!𝑏𝑉 {{𝐴, 𝑏}, {𝑏, 𝐶}} ⊆ 𝐸))
Distinct variable groups:   𝐴,𝑏   𝐶,𝑏   𝐸,𝑏   𝐺,𝑏   𝑉,𝑏

Proof of Theorem frcond1
Dummy variables 𝑘 𝑙 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 frcond1.v . . 3 𝑉 = (Vtx‘𝐺)
2 frcond1.e . . 3 𝐸 = (Edg‘𝐺)
31, 2isfrgr 28023 . 2 (𝐺 ∈ FriendGraph ↔ (𝐺 ∈ USGraph ∧ ∀𝑘𝑉𝑙 ∈ (𝑉 ∖ {𝑘})∃!𝑏𝑉 {{𝑏, 𝑘}, {𝑏, 𝑙}} ⊆ 𝐸))
4 preq2 4643 . . . . . . 7 (𝑘 = 𝐴 → {𝑏, 𝑘} = {𝑏, 𝐴})
54preq1d 4648 . . . . . 6 (𝑘 = 𝐴 → {{𝑏, 𝑘}, {𝑏, 𝑙}} = {{𝑏, 𝐴}, {𝑏, 𝑙}})
65sseq1d 3974 . . . . 5 (𝑘 = 𝐴 → ({{𝑏, 𝑘}, {𝑏, 𝑙}} ⊆ 𝐸 ↔ {{𝑏, 𝐴}, {𝑏, 𝑙}} ⊆ 𝐸))
76reubidv 3374 . . . 4 (𝑘 = 𝐴 → (∃!𝑏𝑉 {{𝑏, 𝑘}, {𝑏, 𝑙}} ⊆ 𝐸 ↔ ∃!𝑏𝑉 {{𝑏, 𝐴}, {𝑏, 𝑙}} ⊆ 𝐸))
8 preq2 4643 . . . . . . 7 (𝑙 = 𝐶 → {𝑏, 𝑙} = {𝑏, 𝐶})
98preq2d 4649 . . . . . 6 (𝑙 = 𝐶 → {{𝑏, 𝐴}, {𝑏, 𝑙}} = {{𝑏, 𝐴}, {𝑏, 𝐶}})
109sseq1d 3974 . . . . 5 (𝑙 = 𝐶 → ({{𝑏, 𝐴}, {𝑏, 𝑙}} ⊆ 𝐸 ↔ {{𝑏, 𝐴}, {𝑏, 𝐶}} ⊆ 𝐸))
1110reubidv 3374 . . . 4 (𝑙 = 𝐶 → (∃!𝑏𝑉 {{𝑏, 𝐴}, {𝑏, 𝑙}} ⊆ 𝐸 ↔ ∃!𝑏𝑉 {{𝑏, 𝐴}, {𝑏, 𝐶}} ⊆ 𝐸))
12 simp1 1133 . . . 4 ((𝐴𝑉𝐶𝑉𝐴𝐶) → 𝐴𝑉)
13 sneq 4550 . . . . . 6 (𝑘 = 𝐴 → {𝑘} = {𝐴})
1413difeq2d 4075 . . . . 5 (𝑘 = 𝐴 → (𝑉 ∖ {𝑘}) = (𝑉 ∖ {𝐴}))
1514adantl 485 . . . 4 (((𝐴𝑉𝐶𝑉𝐴𝐶) ∧ 𝑘 = 𝐴) → (𝑉 ∖ {𝑘}) = (𝑉 ∖ {𝐴}))
16 necom 3060 . . . . . . . 8 (𝐴𝐶𝐶𝐴)
1716biimpi 219 . . . . . . 7 (𝐴𝐶𝐶𝐴)
1817anim2i 619 . . . . . 6 ((𝐶𝑉𝐴𝐶) → (𝐶𝑉𝐶𝐴))
19183adant1 1127 . . . . 5 ((𝐴𝑉𝐶𝑉𝐴𝐶) → (𝐶𝑉𝐶𝐴))
20 eldifsn 4692 . . . . 5 (𝐶 ∈ (𝑉 ∖ {𝐴}) ↔ (𝐶𝑉𝐶𝐴))
2119, 20sylibr 237 . . . 4 ((𝐴𝑉𝐶𝑉𝐴𝐶) → 𝐶 ∈ (𝑉 ∖ {𝐴}))
227, 11, 12, 15, 21rspc2vd 3906 . . 3 ((𝐴𝑉𝐶𝑉𝐴𝐶) → (∀𝑘𝑉𝑙 ∈ (𝑉 ∖ {𝑘})∃!𝑏𝑉 {{𝑏, 𝑘}, {𝑏, 𝑙}} ⊆ 𝐸 → ∃!𝑏𝑉 {{𝑏, 𝐴}, {𝑏, 𝐶}} ⊆ 𝐸))
23 prcom 4641 . . . . . . 7 {𝑏, 𝐴} = {𝐴, 𝑏}
2423preq1i 4645 . . . . . 6 {{𝑏, 𝐴}, {𝑏, 𝐶}} = {{𝐴, 𝑏}, {𝑏, 𝐶}}
2524sseq1i 3971 . . . . 5 ({{𝑏, 𝐴}, {𝑏, 𝐶}} ⊆ 𝐸 ↔ {{𝐴, 𝑏}, {𝑏, 𝐶}} ⊆ 𝐸)
2625reubii 3376 . . . 4 (∃!𝑏𝑉 {{𝑏, 𝐴}, {𝑏, 𝐶}} ⊆ 𝐸 ↔ ∃!𝑏𝑉 {{𝐴, 𝑏}, {𝑏, 𝐶}} ⊆ 𝐸)
2726biimpi 219 . . 3 (∃!𝑏𝑉 {{𝑏, 𝐴}, {𝑏, 𝐶}} ⊆ 𝐸 → ∃!𝑏𝑉 {{𝐴, 𝑏}, {𝑏, 𝐶}} ⊆ 𝐸)
2822, 27syl6com 37 . 2 (∀𝑘𝑉𝑙 ∈ (𝑉 ∖ {𝑘})∃!𝑏𝑉 {{𝑏, 𝑘}, {𝑏, 𝑙}} ⊆ 𝐸 → ((𝐴𝑉𝐶𝑉𝐴𝐶) → ∃!𝑏𝑉 {{𝐴, 𝑏}, {𝑏, 𝐶}} ⊆ 𝐸))
293, 28simplbiim 508 1 (𝐺 ∈ FriendGraph → ((𝐴𝑉𝐶𝑉𝐴𝐶) → ∃!𝑏𝑉 {{𝐴, 𝑏}, {𝑏, 𝐶}} ⊆ 𝐸))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  w3a 1084   = wceq 1538  wcel 2115  wne 3007  wral 3126  ∃!wreu 3128  cdif 3907  wss 3910  {csn 4540  {cpr 4542  cfv 6328  Vtxcvtx 26767  Edgcedg 26818  USGraphcusgr 26920   FriendGraph cfrgr 28021
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 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2178  ax-ext 2793  ax-nul 5183
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2623  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2892  df-nfc 2960  df-ne 3008  df-ral 3131  df-rex 3132  df-reu 3133  df-rab 3135  df-v 3473  df-sbc 3750  df-csb 3858  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4267  df-if 4441  df-sn 4541  df-pr 4543  df-op 4547  df-uni 4812  df-br 5040  df-iota 6287  df-fv 6336  df-frgr 28022
This theorem is referenced by:  frcond2  28030  frcond3  28032  4cyclusnfrgr  28055  frgrncvvdeqlem2  28063
  Copyright terms: Public domain W3C validator