Theorem frgr2wwlk1 30795

Description: In a friendship graph, there is exactly one walk of length 2 between two different vertices. (Contributed by Alexander van der Vekens, 19-Feb-2018.) (Revised by AV, 13-May-2021.) (Proof shortened by AV, 16-Mar-2022.)

Hypothesis

Ref	Expression
frgr2wwlkeu.v	⊢ 𝑉 = (Vtx‘𝐺)

Assertion

Ref	Expression
frgr2wwlk1	⊢ ((𝐺 ∈ FriendGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝐴 ≠ 𝐵) → (♯‘(𝐴(2 WWalksNOn 𝐺)𝐵)) = 1)

Proof of Theorem frgr2wwlk1

Dummy variables 𝑐 𝑑 𝑡 𝑤 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		frgr2wwlkeu.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝐺)
2	1	frgr2wwlkn0 30794	. . 3 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝐴 ≠ 𝐵) → (𝐴(2 WWalksNOn 𝐺)𝐵) ≠ ∅)
3	1	elwwlks2ons3 30409	. . . . . 6 ⊢ (𝑤 ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ↔ ∃𝑑 ∈ 𝑉 (𝑤 = ⟨“𝐴𝑑𝐵”⟩ ∧ ⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)))
4	1	elwwlks2ons3 30409	. . . . . 6 ⊢ (𝑡 ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ↔ ∃𝑐 ∈ 𝑉 (𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)))
5	3, 4	anbi12i 640	. . . . 5 ⊢ ((𝑤 ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ 𝑡 ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) ↔ (∃𝑑 ∈ 𝑉 (𝑤 = ⟨“𝐴𝑑𝐵”⟩ ∧ ⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) ∧ ∃𝑐 ∈ 𝑉 (𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵))))
6	1	frgr2wwlkeu 30793	. . . . . 6 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝐴 ≠ 𝐵) → ∃!𝑥 ∈ 𝑉 ⟨“𝐴𝑥𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵))
7		s3eq2 14943	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑦 → ⟨“𝐴𝑥𝐵”⟩ = ⟨“𝐴𝑦𝐵”⟩)
8	7	eleq1d 2847	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑦 → (⟨“𝐴𝑥𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ↔ ⟨“𝐴𝑦𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)))
9	8	reu4 3692	. . . . . . . . . . . 12 ⊢ (∃!𝑥 ∈ 𝑉 ⟨“𝐴𝑥𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ↔ (∃𝑥 ∈ 𝑉 ⟨“𝐴𝑥𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 ((⟨“𝐴𝑥𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑦𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑥 = 𝑦)))
10		s3eq2 14943	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑑 → ⟨“𝐴𝑥𝐵”⟩ = ⟨“𝐴𝑑𝐵”⟩)
11	10	eleq1d 2847	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑑 → (⟨“𝐴𝑥𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ↔ ⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)))
12	11	anbi1d 643	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑑 → ((⟨“𝐴𝑥𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑦𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) ↔ (⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑦𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵))))
13		equequ1 2058	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑑 → (𝑥 = 𝑦 ↔ 𝑑 = 𝑦))
14	12, 13	imbi12d 347	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑑 → (((⟨“𝐴𝑥𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑦𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑥 = 𝑦) ↔ ((⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑦𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑑 = 𝑦)))
15		s3eq2 14943	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 = 𝑐 → ⟨“𝐴𝑦𝐵”⟩ = ⟨“𝐴𝑐𝐵”⟩)
16	15	eleq1d 2847	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = 𝑐 → (⟨“𝐴𝑦𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ↔ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)))
17	16	anbi2d 642	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑐 → ((⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑦𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) ↔ (⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵))))
18		equequ2 2059	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑐 → (𝑑 = 𝑦 ↔ 𝑑 = 𝑐))
19	17, 18	imbi12d 347	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑐 → (((⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑦𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑑 = 𝑦) ↔ ((⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑑 = 𝑐)))
20	14, 19	rspc2va 3591	. . . . . . . . . . . . . 14 ⊢ (((𝑑 ∈ 𝑉 ∧ 𝑐 ∈ 𝑉) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 ((⟨“𝐴𝑥𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑦𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑥 = 𝑦)) → ((⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑑 = 𝑐))
21		pm3.35 815	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) ∧ ((⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑑 = 𝑐)) → 𝑑 = 𝑐)
22		s3eq2 14943	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑐 = 𝑑 → ⟨“𝐴𝑐𝐵”⟩ = ⟨“𝐴𝑑𝐵”⟩)
23	22	equcoms 2053	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑑 = 𝑐 → ⟨“𝐴𝑐𝐵”⟩ = ⟨“𝐴𝑑𝐵”⟩)
24	23	adantr 486	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑑 = 𝑐 ∧ (𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ 𝑤 = ⟨“𝐴𝑑𝐵”⟩)) → ⟨“𝐴𝑐𝐵”⟩ = ⟨“𝐴𝑑𝐵”⟩)
25		eqeq12 2779	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ ((𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ 𝑤 = ⟨“𝐴𝑑𝐵”⟩) → (𝑡 = 𝑤 ↔ ⟨“𝐴𝑐𝐵”⟩ = ⟨“𝐴𝑑𝐵”⟩))
26	25	adantl 487	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝑑 = 𝑐 ∧ (𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ 𝑤 = ⟨“𝐴𝑑𝐵”⟩)) → (𝑡 = 𝑤 ↔ ⟨“𝐴𝑐𝐵”⟩ = ⟨“𝐴𝑑𝐵”⟩))
27	24, 26	mpbird 260	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑑 = 𝑐 ∧ (𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ 𝑤 = ⟨“𝐴𝑑𝐵”⟩)) → 𝑡 = 𝑤)
28	27	equcomd 2052	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑑 = 𝑐 ∧ (𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ 𝑤 = ⟨“𝐴𝑑𝐵”⟩)) → 𝑤 = 𝑡)
29	28	ex 418	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑑 = 𝑐 → ((𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ 𝑤 = ⟨“𝐴𝑑𝐵”⟩) → 𝑤 = 𝑡))
30	21, 29	syl 18	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) ∧ ((⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑑 = 𝑐)) → ((𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ 𝑤 = ⟨“𝐴𝑑𝐵”⟩) → 𝑤 = 𝑡))
31	30	ex 418	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → (((⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑑 = 𝑐) → ((𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ 𝑤 = ⟨“𝐴𝑑𝐵”⟩) → 𝑤 = 𝑡)))
32	31	com23 87	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → ((𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ 𝑤 = ⟨“𝐴𝑑𝐵”⟩) → (((⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑑 = 𝑐) → 𝑤 = 𝑡)))
33	32	exp4b 436	. . . . . . . . . . . . . . . . . . 19 ⊢ (⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) → (⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) → (𝑡 = ⟨“𝐴𝑐𝐵”⟩ → (𝑤 = ⟨“𝐴𝑑𝐵”⟩ → (((⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑑 = 𝑐) → 𝑤 = 𝑡)))))
34	33	com13 89	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑡 = ⟨“𝐴𝑐𝐵”⟩ → (⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) → (⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) → (𝑤 = ⟨“𝐴𝑑𝐵”⟩ → (((⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑑 = 𝑐) → 𝑤 = 𝑡)))))
35	34	imp 412	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → (⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) → (𝑤 = ⟨“𝐴𝑑𝐵”⟩ → (((⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑑 = 𝑐) → 𝑤 = 𝑡))))
36	35	com13 89	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = ⟨“𝐴𝑑𝐵”⟩ → (⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) → ((𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → (((⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑑 = 𝑐) → 𝑤 = 𝑡))))
37	36	imp 412	. . . . . . . . . . . . . . 15 ⊢ ((𝑤 = ⟨“𝐴𝑑𝐵”⟩ ∧ ⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → ((𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → (((⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑑 = 𝑐) → 𝑤 = 𝑡)))
38	37	com13 89	. . . . . . . . . . . . . 14 ⊢ (((⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑑 = 𝑐) → ((𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → ((𝑤 = ⟨“𝐴𝑑𝐵”⟩ ∧ ⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑤 = 𝑡)))
39	20, 38	syl 18	. . . . . . . . . . . . 13 ⊢ (((𝑑 ∈ 𝑉 ∧ 𝑐 ∈ 𝑉) ∧ ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 ((⟨“𝐴𝑥𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑦𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑥 = 𝑦)) → ((𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → ((𝑤 = ⟨“𝐴𝑑𝐵”⟩ ∧ ⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑤 = 𝑡)))
40	39	expcom 419	. . . . . . . . . . . 12 ⊢ (∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 ((⟨“𝐴𝑥𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ ⟨“𝐴𝑦𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑥 = 𝑦) → ((𝑑 ∈ 𝑉 ∧ 𝑐 ∈ 𝑉) → ((𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → ((𝑤 = ⟨“𝐴𝑑𝐵”⟩ ∧ ⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑤 = 𝑡))))
41	9, 40	simplbiim 514	. . . . . . . . . . 11 ⊢ (∃!𝑥 ∈ 𝑉 ⟨“𝐴𝑥𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) → ((𝑑 ∈ 𝑉 ∧ 𝑐 ∈ 𝑉) → ((𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → ((𝑤 = ⟨“𝐴𝑑𝐵”⟩ ∧ ⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑤 = 𝑡))))
42	41	impl 461	. . . . . . . . . 10 ⊢ (((∃!𝑥 ∈ 𝑉 ⟨“𝐴𝑥𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ 𝑑 ∈ 𝑉) ∧ 𝑐 ∈ 𝑉) → ((𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → ((𝑤 = ⟨“𝐴𝑑𝐵”⟩ ∧ ⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑤 = 𝑡)))
43	42	rexlimdva 3165	. . . . . . . . 9 ⊢ ((∃!𝑥 ∈ 𝑉 ⟨“𝐴𝑥𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ 𝑑 ∈ 𝑉) → (∃𝑐 ∈ 𝑉 (𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → ((𝑤 = ⟨“𝐴𝑑𝐵”⟩ ∧ ⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑤 = 𝑡)))
44	43	com23 87	. . . . . . . 8 ⊢ ((∃!𝑥 ∈ 𝑉 ⟨“𝐴𝑥𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ 𝑑 ∈ 𝑉) → ((𝑤 = ⟨“𝐴𝑑𝐵”⟩ ∧ ⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → (∃𝑐 ∈ 𝑉 (𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑤 = 𝑡)))
45	44	rexlimdva 3165	. . . . . . 7 ⊢ (∃!𝑥 ∈ 𝑉 ⟨“𝐴𝑥𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) → (∃𝑑 ∈ 𝑉 (𝑤 = ⟨“𝐴𝑑𝐵”⟩ ∧ ⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → (∃𝑐 ∈ 𝑉 (𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑤 = 𝑡)))
46	45	impd 416	. . . . . 6 ⊢ (∃!𝑥 ∈ 𝑉 ⟨“𝐴𝑥𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) → ((∃𝑑 ∈ 𝑉 (𝑤 = ⟨“𝐴𝑑𝐵”⟩ ∧ ⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) ∧ ∃𝑐 ∈ 𝑉 (𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵))) → 𝑤 = 𝑡))
47	6, 46	syl 18	. . . . 5 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝐴 ≠ 𝐵) → ((∃𝑑 ∈ 𝑉 (𝑤 = ⟨“𝐴𝑑𝐵”⟩ ∧ ⟨“𝐴𝑑𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) ∧ ∃𝑐 ∈ 𝑉 (𝑡 = ⟨“𝐴𝑐𝐵”⟩ ∧ ⟨“𝐴𝑐𝐵”⟩ ∈ (𝐴(2 WWalksNOn 𝐺)𝐵))) → 𝑤 = 𝑡))
48	5, 47	biimtrid 245	. . . 4 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝐴 ≠ 𝐵) → ((𝑤 ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ 𝑡 ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑤 = 𝑡))
49	48	alrimivv 1961	. . 3 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝐴 ≠ 𝐵) → ∀𝑤∀𝑡((𝑤 ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ 𝑡 ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑤 = 𝑡))
50		eqeuel 4316	. . 3 ⊢ (((𝐴(2 WWalksNOn 𝐺)𝐵) ≠ ∅ ∧ ∀𝑤∀𝑡((𝑤 ∈ (𝐴(2 WWalksNOn 𝐺)𝐵) ∧ 𝑡 ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)) → 𝑤 = 𝑡)) → ∃!𝑤 𝑤 ∈ (𝐴(2 WWalksNOn 𝐺)𝐵))
51	2, 49, 50	syl2anc 596	. 2 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝐴 ≠ 𝐵) → ∃!𝑤 𝑤 ∈ (𝐴(2 WWalksNOn 𝐺)𝐵))
52		ovex 7449	. . 3 ⊢ (𝐴(2 WWalksNOn 𝐺)𝐵) ∈ V
53		euhash1 14487	. . 3 ⊢ ((𝐴(2 WWalksNOn 𝐺)𝐵) ∈ V → ((♯‘(𝐴(2 WWalksNOn 𝐺)𝐵)) = 1 ↔ ∃!𝑤 𝑤 ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)))
54	52, 53	mp1i 14	. 2 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝐴 ≠ 𝐵) → ((♯‘(𝐴(2 WWalksNOn 𝐺)𝐵)) = 1 ↔ ∃!𝑤 𝑤 ∈ (𝐴(2 WWalksNOn 𝐺)𝐵)))
55	51, 54	mpbird 260	1 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝐴 ≠ 𝐵) → (♯‘(𝐴(2 WWalksNOn 𝐺)𝐵)) = 1)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570   ∈ wcel 2145  ∃!weu 2595   ≠ wne 2957  ∀wral 3078  ∃wrex 3088  ∃!wreu 3365  Vcvv 3453  ∅c0 4282  ‘cfv 6537  (class class class)co 7416  1c1 11128  2c2 12322  ♯chash 14396  ⟨“cs3 14915  Vtxcvtx 29439   WWalksNOn cwwlksnon 30281   FriendGraph cfrgr 30724

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-cnex 11183  ax-resscn 11184  ax-1cn 11185  ax-icn 11186  ax-addcl 11187  ax-addrcl 11188  ax-mulcl 11189  ax-mulrcl 11190  ax-mulcom 11191  ax-addass 11192  ax-mulass 11193  ax-distr 11194  ax-i2m1 11195  ax-1ne0 11196  ax-1rid 11197  ax-rnegex 11198  ax-rrecex 11199  ax-cnre 11200  ax-pre-lttri 11201  ax-pre-lttrn 11202  ax-pre-ltadd 11203  ax-pre-mulgt0 11204

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-ifp 1079  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7866  df-1st 7989  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8458  df-2o 8459  df-oadd 8462  df-er 8699  df-map 8831  df-pm 8832  df-en 8956  df-dom 8957  df-sdom 8958  df-fin 8959  df-dju 9909  df-card 9947  df-pnf 11272  df-mnf 11273  df-xr 11274  df-ltxr 11275  df-le 11276  df-sub 11470  df-neg 11471  df-nn 12261  df-2 12330  df-3 12331  df-n0 12532  df-xnn0 12605  df-z 12619  df-uz 12891  df-fz 13564  df-fzo 13712  df-hash 14397  df-word 14581  df-concat 14638  df-s1 14665  df-s2 14921  df-s3 14922  df-edg 29491  df-uhgr 29501  df-upgr 29525  df-umgr 29526  df-uspgr 29596  df-usgr 29597  df-wlks 30045  df-wwlks 30284  df-wwlksn 30285  df-wwlksnon 30286  df-frgr 30725

This theorem is used by:  frgr2wsp1  30796