Theorem frcond1 30355

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.

Step	Hyp	Ref	Expression
1		frcond1.v	. . 3 ⊢ 𝑉 = (Vtx‘𝐺)
2		frcond1.e	. . 3 ⊢ 𝐸 = (Edg‘𝐺)
3	1, 2	isfrgr 30349	. 2 ⊢ (𝐺 ∈ FriendGraph ↔ (𝐺 ∈ USGraph ∧ ∀𝑘 ∈ 𝑉 ∀𝑙 ∈ (𝑉 ∖ {𝑘})∃!𝑏 ∈ 𝑉 {{𝑏, 𝑘}, {𝑏, 𝑙}} ⊆ 𝐸))
4		preq2 4679	. . . . . . 7 ⊢ (𝑘 = 𝐴 → {𝑏, 𝑘} = {𝑏, 𝐴})
5	4	preq1d 4684	. . . . . 6 ⊢ (𝑘 = 𝐴 → {{𝑏, 𝑘}, {𝑏, 𝑙}} = {{𝑏, 𝐴}, {𝑏, 𝑙}})
6	5	sseq1d 3954	. . . . 5 ⊢ (𝑘 = 𝐴 → ({{𝑏, 𝑘}, {𝑏, 𝑙}} ⊆ 𝐸 ↔ {{𝑏, 𝐴}, {𝑏, 𝑙}} ⊆ 𝐸))
7	6	reubidv 3359	. . . 4 ⊢ (𝑘 = 𝐴 → (∃!𝑏 ∈ 𝑉 {{𝑏, 𝑘}, {𝑏, 𝑙}} ⊆ 𝐸 ↔ ∃!𝑏 ∈ 𝑉 {{𝑏, 𝐴}, {𝑏, 𝑙}} ⊆ 𝐸))
8		preq2 4679	. . . . . . 7 ⊢ (𝑙 = 𝐶 → {𝑏, 𝑙} = {𝑏, 𝐶})
9	8	preq2d 4685	. . . . . 6 ⊢ (𝑙 = 𝐶 → {{𝑏, 𝐴}, {𝑏, 𝑙}} = {{𝑏, 𝐴}, {𝑏, 𝐶}})
10	9	sseq1d 3954	. . . . 5 ⊢ (𝑙 = 𝐶 → ({{𝑏, 𝐴}, {𝑏, 𝑙}} ⊆ 𝐸 ↔ {{𝑏, 𝐴}, {𝑏, 𝐶}} ⊆ 𝐸))
11	10	reubidv 3359	. . . 4 ⊢ (𝑙 = 𝐶 → (∃!𝑏 ∈ 𝑉 {{𝑏, 𝐴}, {𝑏, 𝑙}} ⊆ 𝐸 ↔ ∃!𝑏 ∈ 𝑉 {{𝑏, 𝐴}, {𝑏, 𝐶}} ⊆ 𝐸))
12		simp1 1137	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐴 ≠ 𝐶) → 𝐴 ∈ 𝑉)
13		sneq 4578	. . . . . 6 ⊢ (𝑘 = 𝐴 → {𝑘} = {𝐴})
14	13	difeq2d 4067	. . . . 5 ⊢ (𝑘 = 𝐴 → (𝑉 ∖ {𝑘}) = (𝑉 ∖ {𝐴}))
15	14	adantl 481	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐴 ≠ 𝐶) ∧ 𝑘 = 𝐴) → (𝑉 ∖ {𝑘}) = (𝑉 ∖ {𝐴}))
16		necom 2986	. . . . . . . 8 ⊢ (𝐴 ≠ 𝐶 ↔ 𝐶 ≠ 𝐴)
17	16	biimpi 216	. . . . . . 7 ⊢ (𝐴 ≠ 𝐶 → 𝐶 ≠ 𝐴)
18	17	anim2i 618	. . . . . 6 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐴 ≠ 𝐶) → (𝐶 ∈ 𝑉 ∧ 𝐶 ≠ 𝐴))
19	18	3adant1 1131	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐴 ≠ 𝐶) → (𝐶 ∈ 𝑉 ∧ 𝐶 ≠ 𝐴))
20		eldifsn 4730	. . . . 5 ⊢ (𝐶 ∈ (𝑉 ∖ {𝐴}) ↔ (𝐶 ∈ 𝑉 ∧ 𝐶 ≠ 𝐴))
21	19, 20	sylibr 234	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐴 ≠ 𝐶) → 𝐶 ∈ (𝑉 ∖ {𝐴}))
22	7, 11, 12, 15, 21	rspc2vd 3886	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐴 ≠ 𝐶) → (∀𝑘 ∈ 𝑉 ∀𝑙 ∈ (𝑉 ∖ {𝑘})∃!𝑏 ∈ 𝑉 {{𝑏, 𝑘}, {𝑏, 𝑙}} ⊆ 𝐸 → ∃!𝑏 ∈ 𝑉 {{𝑏, 𝐴}, {𝑏, 𝐶}} ⊆ 𝐸))
23		prcom 4677	. . . . . . 7 ⊢ {𝑏, 𝐴} = {𝐴, 𝑏}
24	23	preq1i 4681	. . . . . 6 ⊢ {{𝑏, 𝐴}, {𝑏, 𝐶}} = {{𝐴, 𝑏}, {𝑏, 𝐶}}
25	24	sseq1i 3951	. . . . 5 ⊢ ({{𝑏, 𝐴}, {𝑏, 𝐶}} ⊆ 𝐸 ↔ {{𝐴, 𝑏}, {𝑏, 𝐶}} ⊆ 𝐸)
26	25	reubii 3352	. . . 4 ⊢ (∃!𝑏 ∈ 𝑉 {{𝑏, 𝐴}, {𝑏, 𝐶}} ⊆ 𝐸 ↔ ∃!𝑏 ∈ 𝑉 {{𝐴, 𝑏}, {𝑏, 𝐶}} ⊆ 𝐸)
27	26	biimpi 216	. . 3 ⊢ (∃!𝑏 ∈ 𝑉 {{𝑏, 𝐴}, {𝑏, 𝐶}} ⊆ 𝐸 → ∃!𝑏 ∈ 𝑉 {{𝐴, 𝑏}, {𝑏, 𝐶}} ⊆ 𝐸)
28	22, 27	syl6com 37	. 2 ⊢ (∀𝑘 ∈ 𝑉 ∀𝑙 ∈ (𝑉 ∖ {𝑘})∃!𝑏 ∈ 𝑉 {{𝑏, 𝑘}, {𝑏, 𝑙}} ⊆ 𝐸 → ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐴 ≠ 𝐶) → ∃!𝑏 ∈ 𝑉 {{𝐴, 𝑏}, {𝑏, 𝐶}} ⊆ 𝐸))
29	3, 28	simplbiim 504	1 ⊢ (𝐺 ∈ FriendGraph → ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉 ∧ 𝐴 ≠ 𝐶) → ∃!𝑏 ∈ 𝑉 {{𝐴, 𝑏}, {𝑏, 𝐶}} ⊆ 𝐸))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  ∃!wreu 3341   ∖ cdif 3887   ⊆ wss 3890  {csn 4568  {cpr 4570  ‘cfv 6494  Vtxcvtx 29083  Edgcedg 29134  USGraphcusgr 29236   FriendGraph cfrgr 30347

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 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-nul 5242

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-iota 6450  df-fv 6502  df-frgr 30348

This theorem is referenced by:  frcond2  30356  frcond3  30358  4cyclusnfrgr  30381  frgrncvvdeqlem2  30389