3cyclfrgrrn1 - Metamath Proof Explorer

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

Theorem 3cyclfrgrrn1 29527

Description: Every vertex in a friendship graph (with more than 1 vertex) is part of a 3-cycle. (Contributed by Alexander van der Vekens, 16-Nov-2017.) (Revised by AV, 2-Apr-2021.)

**Hypotheses**
Ref	Expression
3cyclfrgrrn1.v	⊢ 𝑉 = (Vtx‘𝐺)
3cyclfrgrrn1.e	⊢ 𝐸 = (Edg‘𝐺)

**Assertion**
Ref	Expression
3cyclfrgrrn1	⊢ ((𝐺 ∈ FriendGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ 𝐴 ≠ 𝐶) → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸))

Distinct variable groups: 𝐴,𝑏,𝑐 𝐸,𝑏,𝑐 𝑉,𝑏,𝑐 Allowed substitution hints: 𝐶(𝑏,𝑐) 𝐺(𝑏,𝑐)

Proof of Theorem 3cyclfrgrrn1 Dummy variables 𝑎 𝑥 𝑧 𝑦 𝑢 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		3cyclfrgrrn1.v	. . . 4 ⊢ 𝑉 = (Vtx‘𝐺)
2		3cyclfrgrrn1.e	. . . 4 ⊢ 𝐸 = (Edg‘𝐺)
3	1, 2	2pthfrgrrn2 29525	. . 3 ⊢ (𝐺 ∈ FriendGraph → ∀𝑎 ∈ 𝑉 ∀𝑧 ∈ (𝑉 ∖ {𝑎})∃𝑥 ∈ 𝑉 (({𝑎, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ∧ (𝑎 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧)))
4		necom 2994	. . . . . . . . . . . 12 ⊢ (𝐴 ≠ 𝐶 ↔ 𝐶 ≠ 𝐴)
5		eldifsn 4789	. . . . . . . . . . . . 13 ⊢ (𝐶 ∈ (𝑉 ∖ {𝐴}) ↔ (𝐶 ∈ 𝑉 ∧ 𝐶 ≠ 𝐴))
6	5	simplbi2com 503	. . . . . . . . . . . 12 ⊢ (𝐶 ≠ 𝐴 → (𝐶 ∈ 𝑉 → 𝐶 ∈ (𝑉 ∖ {𝐴})))
7	4, 6	sylbi 216	. . . . . . . . . . 11 ⊢ (𝐴 ≠ 𝐶 → (𝐶 ∈ 𝑉 → 𝐶 ∈ (𝑉 ∖ {𝐴})))
8	7	com12 32	. . . . . . . . . 10 ⊢ (𝐶 ∈ 𝑉 → (𝐴 ≠ 𝐶 → 𝐶 ∈ (𝑉 ∖ {𝐴})))
9	8	adantl 482	. . . . . . . . 9 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (𝐴 ≠ 𝐶 → 𝐶 ∈ (𝑉 ∖ {𝐴})))
10	9	imp 407	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ 𝐴 ≠ 𝐶) → 𝐶 ∈ (𝑉 ∖ {𝐴}))
11		sneq 4637	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝐴 → {𝑎} = {𝐴})
12	11	difeq2d 4121	. . . . . . . . . . 11 ⊢ (𝑎 = 𝐴 → (𝑉 ∖ {𝑎}) = (𝑉 ∖ {𝐴}))
13		preq1 4736	. . . . . . . . . . . . . . 15 ⊢ (𝑎 = 𝐴 → {𝑎, 𝑥} = {𝐴, 𝑥})
14	13	eleq1d 2818	. . . . . . . . . . . . . 14 ⊢ (𝑎 = 𝐴 → ({𝑎, 𝑥} ∈ 𝐸 ↔ {𝐴, 𝑥} ∈ 𝐸))
15	14	anbi1d 630	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝐴 → (({𝑎, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ↔ ({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸)))
16		neeq1 3003	. . . . . . . . . . . . . 14 ⊢ (𝑎 = 𝐴 → (𝑎 ≠ 𝑥 ↔ 𝐴 ≠ 𝑥))
17	16	anbi1d 630	. . . . . . . . . . . . 13 ⊢ (𝑎 = 𝐴 → ((𝑎 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧) ↔ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧)))
18	15, 17	anbi12d 631	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝐴 → ((({𝑎, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ∧ (𝑎 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧)) ↔ (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧))))
19	18	rexbidv 3178	. . . . . . . . . . 11 ⊢ (𝑎 = 𝐴 → (∃𝑥 ∈ 𝑉 (({𝑎, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ∧ (𝑎 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧)) ↔ ∃𝑥 ∈ 𝑉 (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧))))
20	12, 19	raleqbidv 3342	. . . . . . . . . 10 ⊢ (𝑎 = 𝐴 → (∀𝑧 ∈ (𝑉 ∖ {𝑎})∃𝑥 ∈ 𝑉 (({𝑎, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ∧ (𝑎 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧)) ↔ ∀𝑧 ∈ (𝑉 ∖ {𝐴})∃𝑥 ∈ 𝑉 (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧))))
21	20	rspcv 3608	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑉 → (∀𝑎 ∈ 𝑉 ∀𝑧 ∈ (𝑉 ∖ {𝑎})∃𝑥 ∈ 𝑉 (({𝑎, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ∧ (𝑎 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧)) → ∀𝑧 ∈ (𝑉 ∖ {𝐴})∃𝑥 ∈ 𝑉 (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧))))
22	21	ad2antrr 724	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ 𝐴 ≠ 𝐶) → (∀𝑎 ∈ 𝑉 ∀𝑧 ∈ (𝑉 ∖ {𝑎})∃𝑥 ∈ 𝑉 (({𝑎, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ∧ (𝑎 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧)) → ∀𝑧 ∈ (𝑉 ∖ {𝐴})∃𝑥 ∈ 𝑉 (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧))))
23		preq2 4737	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝐶 → {𝑥, 𝑧} = {𝑥, 𝐶})
24	23	eleq1d 2818	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝐶 → ({𝑥, 𝑧} ∈ 𝐸 ↔ {𝑥, 𝐶} ∈ 𝐸))
25	24	anbi2d 629	. . . . . . . . . . 11 ⊢ (𝑧 = 𝐶 → (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ↔ ({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸)))
26		neeq2 3004	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝐶 → (𝑥 ≠ 𝑧 ↔ 𝑥 ≠ 𝐶))
27	26	anbi2d 629	. . . . . . . . . . 11 ⊢ (𝑧 = 𝐶 → ((𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧) ↔ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝐶)))
28	25, 27	anbi12d 631	. . . . . . . . . 10 ⊢ (𝑧 = 𝐶 → ((({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧)) ↔ (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝐶))))
29	28	rexbidv 3178	. . . . . . . . 9 ⊢ (𝑧 = 𝐶 → (∃𝑥 ∈ 𝑉 (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧)) ↔ ∃𝑥 ∈ 𝑉 (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝐶))))
30	29	rspcv 3608	. . . . . . . 8 ⊢ (𝐶 ∈ (𝑉 ∖ {𝐴}) → (∀𝑧 ∈ (𝑉 ∖ {𝐴})∃𝑥 ∈ 𝑉 (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧)) → ∃𝑥 ∈ 𝑉 (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝐶))))
31	10, 22, 30	sylsyld 61	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ 𝐴 ≠ 𝐶) → (∀𝑎 ∈ 𝑉 ∀𝑧 ∈ (𝑉 ∖ {𝑎})∃𝑥 ∈ 𝑉 (({𝑎, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ∧ (𝑎 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧)) → ∃𝑥 ∈ 𝑉 (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝐶))))
32	1, 2	2pthfrgrrn 29524	. . . . . . . . . 10 ⊢ (𝐺 ∈ FriendGraph → ∀𝑢 ∈ 𝑉 ∀𝑣 ∈ (𝑉 ∖ {𝑢})∃𝑦 ∈ 𝑉 ({𝑢, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸))
33		necom 2994	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝐴 ≠ 𝑥 ↔ 𝑥 ≠ 𝐴)
34		eldifsn 4789	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑥 ∈ (𝑉 ∖ {𝐴}) ↔ (𝑥 ∈ 𝑉 ∧ 𝑥 ≠ 𝐴))
35	34	simplbi2com 503	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑥 ≠ 𝐴 → (𝑥 ∈ 𝑉 → 𝑥 ∈ (𝑉 ∖ {𝐴})))
36	33, 35	sylbi 216	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝐴 ≠ 𝑥 → (𝑥 ∈ 𝑉 → 𝑥 ∈ (𝑉 ∖ {𝐴})))
37	36	adantr 481	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐴 ≠ 𝑥 ∧ 𝐴 ∈ 𝑉) → (𝑥 ∈ 𝑉 → 𝑥 ∈ (𝑉 ∖ {𝐴})))
38	37	imp 407	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐴 ≠ 𝑥 ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉) → 𝑥 ∈ (𝑉 ∖ {𝐴}))
39		sneq 4637	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑢 = 𝐴 → {𝑢} = {𝐴})
40	39	difeq2d 4121	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑢 = 𝐴 → (𝑉 ∖ {𝑢}) = (𝑉 ∖ {𝐴}))
41		preq1 4736	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑢 = 𝐴 → {𝑢, 𝑦} = {𝐴, 𝑦})
42	41	eleq1d 2818	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑢 = 𝐴 → ({𝑢, 𝑦} ∈ 𝐸 ↔ {𝐴, 𝑦} ∈ 𝐸))
43	42	anbi1d 630	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝑢 = 𝐴 → (({𝑢, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸) ↔ ({𝐴, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸)))
44	43	rexbidv 3178	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑢 = 𝐴 → (∃𝑦 ∈ 𝑉 ({𝑢, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸) ↔ ∃𝑦 ∈ 𝑉 ({𝐴, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸)))
45	40, 44	raleqbidv 3342	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑢 = 𝐴 → (∀𝑣 ∈ (𝑉 ∖ {𝑢})∃𝑦 ∈ 𝑉 ({𝑢, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸) ↔ ∀𝑣 ∈ (𝑉 ∖ {𝐴})∃𝑦 ∈ 𝑉 ({𝐴, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸)))
46	45	rspcv 3608	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝐴 ∈ 𝑉 → (∀𝑢 ∈ 𝑉 ∀𝑣 ∈ (𝑉 ∖ {𝑢})∃𝑦 ∈ 𝑉 ({𝑢, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸) → ∀𝑣 ∈ (𝑉 ∖ {𝐴})∃𝑦 ∈ 𝑉 ({𝐴, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸)))
47	46	adantl 482	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐴 ≠ 𝑥 ∧ 𝐴 ∈ 𝑉) → (∀𝑢 ∈ 𝑉 ∀𝑣 ∈ (𝑉 ∖ {𝑢})∃𝑦 ∈ 𝑉 ({𝑢, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸) → ∀𝑣 ∈ (𝑉 ∖ {𝐴})∃𝑦 ∈ 𝑉 ({𝐴, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸)))
48	47	adantr 481	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐴 ≠ 𝑥 ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉) → (∀𝑢 ∈ 𝑉 ∀𝑣 ∈ (𝑉 ∖ {𝑢})∃𝑦 ∈ 𝑉 ({𝑢, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸) → ∀𝑣 ∈ (𝑉 ∖ {𝐴})∃𝑦 ∈ 𝑉 ({𝐴, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸)))
49		preq2 4737	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝑣 = 𝑥 → {𝑦, 𝑣} = {𝑦, 𝑥})
50	49	eleq1d 2818	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑣 = 𝑥 → ({𝑦, 𝑣} ∈ 𝐸 ↔ {𝑦, 𝑥} ∈ 𝐸))
51	50	anbi2d 629	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑣 = 𝑥 → (({𝐴, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸) ↔ ({𝐴, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑥} ∈ 𝐸)))
52	51	rexbidv 3178	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑣 = 𝑥 → (∃𝑦 ∈ 𝑉 ({𝐴, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸) ↔ ∃𝑦 ∈ 𝑉 ({𝐴, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑥} ∈ 𝐸)))
53	52	rspcv 3608	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 ∈ (𝑉 ∖ {𝐴}) → (∀𝑣 ∈ (𝑉 ∖ {𝐴})∃𝑦 ∈ 𝑉 ({𝐴, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸) → ∃𝑦 ∈ 𝑉 ({𝐴, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑥} ∈ 𝐸)))
54	38, 48, 53	sylsyld 61	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐴 ≠ 𝑥 ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉) → (∀𝑢 ∈ 𝑉 ∀𝑣 ∈ (𝑉 ∖ {𝑢})∃𝑦 ∈ 𝑉 ({𝑢, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸) → ∃𝑦 ∈ 𝑉 ({𝐴, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑥} ∈ 𝐸)))
55		prcom 4735	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ {𝐴, 𝑦} = {𝑦, 𝐴}
56	55	eleq1i 2824	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ({𝐴, 𝑦} ∈ 𝐸 ↔ {𝑦, 𝐴} ∈ 𝐸)
57		prcom 4735	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ {𝑦, 𝑥} = {𝑥, 𝑦}
58	57	eleq1i 2824	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ({𝑦, 𝑥} ∈ 𝐸 ↔ {𝑥, 𝑦} ∈ 𝐸)
59	56, 58	anbi12ci 628	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (({𝐴, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑥} ∈ 𝐸) ↔ ({𝑥, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐴} ∈ 𝐸))
60		preq2 4737	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑏 = 𝑥 → {𝐴, 𝑏} = {𝐴, 𝑥})
61	60	eleq1d 2818	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑏 = 𝑥 → ({𝐴, 𝑏} ∈ 𝐸 ↔ {𝐴, 𝑥} ∈ 𝐸))
62		preq1 4736	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑏 = 𝑥 → {𝑏, 𝑐} = {𝑥, 𝑐})
63	62	eleq1d 2818	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑏 = 𝑥 → ({𝑏, 𝑐} ∈ 𝐸 ↔ {𝑥, 𝑐} ∈ 𝐸))
64		biidd 261	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑏 = 𝑥 → ({𝑐, 𝐴} ∈ 𝐸 ↔ {𝑐, 𝐴} ∈ 𝐸))
65	61, 63, 64	3anbi123d 1436	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑏 = 𝑥 → (({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸) ↔ ({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸)))
66		biidd 261	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑐 = 𝑦 → ({𝐴, 𝑥} ∈ 𝐸 ↔ {𝐴, 𝑥} ∈ 𝐸))
67		preq2 4737	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑐 = 𝑦 → {𝑥, 𝑐} = {𝑥, 𝑦})
68	67	eleq1d 2818	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑐 = 𝑦 → ({𝑥, 𝑐} ∈ 𝐸 ↔ {𝑥, 𝑦} ∈ 𝐸))
69		preq1 4736	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 ⊢ (𝑐 = 𝑦 → {𝑐, 𝐴} = {𝑦, 𝐴})
70	69	eleq1d 2818	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (𝑐 = 𝑦 → ({𝑐, 𝐴} ∈ 𝐸 ↔ {𝑦, 𝐴} ∈ 𝐸))
71	66, 68, 70	3anbi123d 1436	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑐 = 𝑦 → (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸) ↔ ({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐴} ∈ 𝐸)))
72	65, 71	rspc2ev 3623	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ ({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐴} ∈ 𝐸)) → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸))
73	72	3expa 1118	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) ∧ ({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐴} ∈ 𝐸)) → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸))
74	73	expcom 414	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐴} ∈ 𝐸) → ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸)))
75	74	3expib 1122	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ({𝐴, 𝑥} ∈ 𝐸 → (({𝑥, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝐴} ∈ 𝐸) → ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸))))
76	59, 75	biimtrid 241	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ({𝐴, 𝑥} ∈ 𝐸 → (({𝐴, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑥} ∈ 𝐸) → ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸))))
77	76	adantr 481	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) → (({𝐴, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑥} ∈ 𝐸) → ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸))))
78	77	com13 88	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → (({𝐴, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑥} ∈ 𝐸) → (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸))))
79	78	rexlimdva 3155	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 ∈ 𝑉 → (∃𝑦 ∈ 𝑉 ({𝐴, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑥} ∈ 𝐸) → (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸))))
80	79	com13 88	. . . . . . . . . . . . . . . . . . . 20 ⊢ (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) → (∃𝑦 ∈ 𝑉 ({𝐴, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑥} ∈ 𝐸) → (𝑥 ∈ 𝑉 → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸))))
81	54, 80	syl9 77	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐴 ≠ 𝑥 ∧ 𝐴 ∈ 𝑉) ∧ 𝑥 ∈ 𝑉) → (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) → (∀𝑢 ∈ 𝑉 ∀𝑣 ∈ (𝑉 ∖ {𝑢})∃𝑦 ∈ 𝑉 ({𝑢, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸) → (𝑥 ∈ 𝑉 → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸)))))
82	81	exp31 420	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ≠ 𝑥 → (𝐴 ∈ 𝑉 → (𝑥 ∈ 𝑉 → (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) → (∀𝑢 ∈ 𝑉 ∀𝑣 ∈ (𝑉 ∖ {𝑢})∃𝑦 ∈ 𝑉 ({𝑢, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸) → (𝑥 ∈ 𝑉 → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸)))))))
83	82	com24 95	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ≠ 𝑥 → (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) → (𝑥 ∈ 𝑉 → (𝐴 ∈ 𝑉 → (∀𝑢 ∈ 𝑉 ∀𝑣 ∈ (𝑉 ∖ {𝑢})∃𝑦 ∈ 𝑉 ({𝑢, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸) → (𝑥 ∈ 𝑉 → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸)))))))
84	83	adantr 481	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝐶) → (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) → (𝑥 ∈ 𝑉 → (𝐴 ∈ 𝑉 → (∀𝑢 ∈ 𝑉 ∀𝑣 ∈ (𝑉 ∖ {𝑢})∃𝑦 ∈ 𝑉 ({𝑢, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸) → (𝑥 ∈ 𝑉 → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸)))))))
85	84	impcom 408	. . . . . . . . . . . . . . 15 ⊢ ((({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝐶)) → (𝑥 ∈ 𝑉 → (𝐴 ∈ 𝑉 → (∀𝑢 ∈ 𝑉 ∀𝑣 ∈ (𝑉 ∖ {𝑢})∃𝑦 ∈ 𝑉 ({𝑢, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸) → (𝑥 ∈ 𝑉 → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸))))))
86	85	com15 101	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ 𝑉 → (𝑥 ∈ 𝑉 → (𝐴 ∈ 𝑉 → (∀𝑢 ∈ 𝑉 ∀𝑣 ∈ (𝑉 ∖ {𝑢})∃𝑦 ∈ 𝑉 ({𝑢, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸) → ((({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝐶)) → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸))))))
87	86	pm2.43i 52	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝑉 → (𝐴 ∈ 𝑉 → (∀𝑢 ∈ 𝑉 ∀𝑣 ∈ (𝑉 ∖ {𝑢})∃𝑦 ∈ 𝑉 ({𝑢, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸) → ((({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝐶)) → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸)))))
88	87	com12 32	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ∈ 𝑉 → (∀𝑢 ∈ 𝑉 ∀𝑣 ∈ (𝑉 ∖ {𝑢})∃𝑦 ∈ 𝑉 ({𝑢, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸) → ((({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝐶)) → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸)))))
89	88	ad2antrr 724	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ 𝐴 ≠ 𝐶) → (𝑥 ∈ 𝑉 → (∀𝑢 ∈ 𝑉 ∀𝑣 ∈ (𝑉 ∖ {𝑢})∃𝑦 ∈ 𝑉 ({𝑢, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸) → ((({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝐶)) → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸)))))
90	89	com4t 93	. . . . . . . . . 10 ⊢ (∀𝑢 ∈ 𝑉 ∀𝑣 ∈ (𝑉 ∖ {𝑢})∃𝑦 ∈ 𝑉 ({𝑢, 𝑦} ∈ 𝐸 ∧ {𝑦, 𝑣} ∈ 𝐸) → ((({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝐶)) → (((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ 𝐴 ≠ 𝐶) → (𝑥 ∈ 𝑉 → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸)))))
91	32, 90	syl 17	. . . . . . . . 9 ⊢ (𝐺 ∈ FriendGraph → ((({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝐶)) → (((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ 𝐴 ≠ 𝐶) → (𝑥 ∈ 𝑉 → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸)))))
92	91	com14 96	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑉 → ((({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝐶)) → (((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ 𝐴 ≠ 𝐶) → (𝐺 ∈ FriendGraph → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸)))))
93	92	rexlimiv 3148	. . . . . . 7 ⊢ (∃𝑥 ∈ 𝑉 (({𝐴, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝐶} ∈ 𝐸) ∧ (𝐴 ≠ 𝑥 ∧ 𝑥 ≠ 𝐶)) → (((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ 𝐴 ≠ 𝐶) → (𝐺 ∈ FriendGraph → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸))))
94	31, 93	syl6 35	. . . . . 6 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ 𝐴 ≠ 𝐶) → (∀𝑎 ∈ 𝑉 ∀𝑧 ∈ (𝑉 ∖ {𝑎})∃𝑥 ∈ 𝑉 (({𝑎, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ∧ (𝑎 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧)) → (((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ 𝐴 ≠ 𝐶) → (𝐺 ∈ FriendGraph → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸)))))
95	94	pm2.43a 54	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ 𝐴 ≠ 𝐶) → (∀𝑎 ∈ 𝑉 ∀𝑧 ∈ (𝑉 ∖ {𝑎})∃𝑥 ∈ 𝑉 (({𝑎, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ∧ (𝑎 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧)) → (𝐺 ∈ FriendGraph → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸))))
96	95	ex 413	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (𝐴 ≠ 𝐶 → (∀𝑎 ∈ 𝑉 ∀𝑧 ∈ (𝑉 ∖ {𝑎})∃𝑥 ∈ 𝑉 (({𝑎, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ∧ (𝑎 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧)) → (𝐺 ∈ FriendGraph → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸)))))
97	96	com4t 93	. . 3 ⊢ (∀𝑎 ∈ 𝑉 ∀𝑧 ∈ (𝑉 ∖ {𝑎})∃𝑥 ∈ 𝑉 (({𝑎, 𝑥} ∈ 𝐸 ∧ {𝑥, 𝑧} ∈ 𝐸) ∧ (𝑎 ≠ 𝑥 ∧ 𝑥 ≠ 𝑧)) → (𝐺 ∈ FriendGraph → ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (𝐴 ≠ 𝐶 → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸)))))
98	3, 97	mpcom 38	. 2 ⊢ (𝐺 ∈ FriendGraph → ((𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) → (𝐴 ≠ 𝐶 → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸))))
99	98	3imp 1111	1 ⊢ ((𝐺 ∈ FriendGraph ∧ (𝐴 ∈ 𝑉 ∧ 𝐶 ∈ 𝑉) ∧ 𝐴 ≠ 𝐶) → ∃𝑏 ∈ 𝑉 ∃𝑐 ∈ 𝑉 ({𝐴, 𝑏} ∈ 𝐸 ∧ {𝑏, 𝑐} ∈ 𝐸 ∧ {𝑐, 𝐴} ∈ 𝐸))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 ∀wral 3061 ∃wrex 3070 ∖ cdif 3944 {csn 4627 {cpr 4629 ‘cfv 6540 Vtxcvtx 28245 Edgcedg 28296 FriendGraph cfrgr 29500

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-oadd 8466 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-dju 9892 df-card 9930 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-nn 12209 df-2 12271 df-n0 12469 df-z 12555 df-uz 12819 df-fz 13481 df-hash 14287 df-edg 28297 df-umgr 28332 df-usgr 28400 df-frgr 29501

This theorem is referenced by: 3cyclfrgrrn 29528

W3C validator