Theorem nb3grapr 25982

Description: The neighbors of a vertex in a graph with three elements are an unordered pair of the other vertices if and only if all vertices are connected with each other. (Contributed by Alexander van der Vekens, 18-Oct-2017.)

Assertion

Ref	Expression
nb3grapr	⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝑉 USGrph 𝐸) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) → (({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸) ↔ ∀𝑥 ∈ 𝑉 ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝑥) = {𝑦, 𝑧}))

Distinct variable groups:   𝑥,𝐴,𝑦,𝑧   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝑥,𝐸,𝑦,𝑧   𝑥,𝑉,𝑦,𝑧

Allowed substitution hints:   𝑋(𝑥,𝑦,𝑧)   𝑌(𝑥,𝑦,𝑧)   𝑍(𝑥,𝑦,𝑧)

Proof of Theorem nb3grapr

Step	Hyp	Ref	Expression
1		id 22	. . . . . 6 ⊢ (({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸) → ({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸))
2		prcom 4211	. . . . . . . . . 10 ⊢ {𝐴, 𝐵} = {𝐵, 𝐴}
3	2	eleq1i 2679	. . . . . . . . 9 ⊢ ({𝐴, 𝐵} ∈ ran 𝐸 ↔ {𝐵, 𝐴} ∈ ran 𝐸)
4		prcom 4211	. . . . . . . . . 10 ⊢ {𝐵, 𝐶} = {𝐶, 𝐵}
5	4	eleq1i 2679	. . . . . . . . 9 ⊢ ({𝐵, 𝐶} ∈ ran 𝐸 ↔ {𝐶, 𝐵} ∈ ran 𝐸)
6		prcom 4211	. . . . . . . . . 10 ⊢ {𝐶, 𝐴} = {𝐴, 𝐶}
7	6	eleq1i 2679	. . . . . . . . 9 ⊢ ({𝐶, 𝐴} ∈ ran 𝐸 ↔ {𝐴, 𝐶} ∈ ran 𝐸)
8	3, 5, 7	3anbi123i 1244	. . . . . . . 8 ⊢ (({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸) ↔ ({𝐵, 𝐴} ∈ ran 𝐸 ∧ {𝐶, 𝐵} ∈ ran 𝐸 ∧ {𝐴, 𝐶} ∈ ran 𝐸))
9		3anrot 1036	. . . . . . . 8 ⊢ (({𝐴, 𝐶} ∈ ran 𝐸 ∧ {𝐵, 𝐴} ∈ ran 𝐸 ∧ {𝐶, 𝐵} ∈ ran 𝐸) ↔ ({𝐵, 𝐴} ∈ ran 𝐸 ∧ {𝐶, 𝐵} ∈ ran 𝐸 ∧ {𝐴, 𝐶} ∈ ran 𝐸))
10	8, 9	bitr4i 266	. . . . . . 7 ⊢ (({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸) ↔ ({𝐴, 𝐶} ∈ ran 𝐸 ∧ {𝐵, 𝐴} ∈ ran 𝐸 ∧ {𝐶, 𝐵} ∈ ran 𝐸))
11	10	a1i 11	. . . . . 6 ⊢ (({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸) → (({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸) ↔ ({𝐴, 𝐶} ∈ ran 𝐸 ∧ {𝐵, 𝐴} ∈ ran 𝐸 ∧ {𝐶, 𝐵} ∈ ran 𝐸)))
12	1, 11	biadan2 672	. . . . 5 ⊢ (({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸) ↔ (({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸) ∧ ({𝐴, 𝐶} ∈ ran 𝐸 ∧ {𝐵, 𝐴} ∈ ran 𝐸 ∧ {𝐶, 𝐵} ∈ ran 𝐸)))
13		an6 1400	. . . . 5 ⊢ ((({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸) ∧ ({𝐴, 𝐶} ∈ ran 𝐸 ∧ {𝐵, 𝐴} ∈ ran 𝐸 ∧ {𝐶, 𝐵} ∈ ran 𝐸)) ↔ (({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐴, 𝐶} ∈ ran 𝐸) ∧ ({𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐵, 𝐴} ∈ ran 𝐸) ∧ ({𝐶, 𝐴} ∈ ran 𝐸 ∧ {𝐶, 𝐵} ∈ ran 𝐸)))
14	12, 13	bitri 263	. . . 4 ⊢ (({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸) ↔ (({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐴, 𝐶} ∈ ran 𝐸) ∧ ({𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐵, 𝐴} ∈ ran 𝐸) ∧ ({𝐶, 𝐴} ∈ ran 𝐸 ∧ {𝐶, 𝐵} ∈ ran 𝐸)))
15	14	a1i 11	. . 3 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝑉 USGrph 𝐸) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) → (({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸) ↔ (({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐴, 𝐶} ∈ ran 𝐸) ∧ ({𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐵, 𝐴} ∈ ran 𝐸) ∧ ({𝐶, 𝐴} ∈ ran 𝐸 ∧ {𝐶, 𝐵} ∈ ran 𝐸))))
16		nb3graprlem1 25980	. . . . 5 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝑉 USGrph 𝐸)) → ((⟨𝑉, 𝐸⟩ Neighbors 𝐴) = {𝐵, 𝐶} ↔ ({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐴, 𝐶} ∈ ran 𝐸)))
17		3anrot 1036	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ↔ (𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍 ∧ 𝐴 ∈ 𝑋))
18	17	biimpi 205	. . . . . 6 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) → (𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍 ∧ 𝐴 ∈ 𝑋))
19		tprot 4228	. . . . . . . . 9 ⊢ {𝐴, 𝐵, 𝐶} = {𝐵, 𝐶, 𝐴}
20	19	eqeq2i 2622	. . . . . . . 8 ⊢ (𝑉 = {𝐴, 𝐵, 𝐶} ↔ 𝑉 = {𝐵, 𝐶, 𝐴})
21	20	biimpi 205	. . . . . . 7 ⊢ (𝑉 = {𝐴, 𝐵, 𝐶} → 𝑉 = {𝐵, 𝐶, 𝐴})
22	21	anim1i 590	. . . . . 6 ⊢ ((𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝑉 USGrph 𝐸) → (𝑉 = {𝐵, 𝐶, 𝐴} ∧ 𝑉 USGrph 𝐸))
23		nb3graprlem1 25980	. . . . . 6 ⊢ (((𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍 ∧ 𝐴 ∈ 𝑋) ∧ (𝑉 = {𝐵, 𝐶, 𝐴} ∧ 𝑉 USGrph 𝐸)) → ((⟨𝑉, 𝐸⟩ Neighbors 𝐵) = {𝐶, 𝐴} ↔ ({𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐵, 𝐴} ∈ ran 𝐸)))
24	18, 22, 23	syl2an 493	. . . . 5 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝑉 USGrph 𝐸)) → ((⟨𝑉, 𝐸⟩ Neighbors 𝐵) = {𝐶, 𝐴} ↔ ({𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐵, 𝐴} ∈ ran 𝐸)))
25		3anrot 1036	. . . . . . 7 ⊢ ((𝐶 ∈ 𝑍 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ↔ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍))
26	25	biimpri 217	. . . . . 6 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) → (𝐶 ∈ 𝑍 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌))
27		tprot 4228	. . . . . . . . . 10 ⊢ {𝐶, 𝐴, 𝐵} = {𝐴, 𝐵, 𝐶}
28	27	eqcomi 2619	. . . . . . . . 9 ⊢ {𝐴, 𝐵, 𝐶} = {𝐶, 𝐴, 𝐵}
29	28	eqeq2i 2622	. . . . . . . 8 ⊢ (𝑉 = {𝐴, 𝐵, 𝐶} ↔ 𝑉 = {𝐶, 𝐴, 𝐵})
30	29	biimpi 205	. . . . . . 7 ⊢ (𝑉 = {𝐴, 𝐵, 𝐶} → 𝑉 = {𝐶, 𝐴, 𝐵})
31	30	anim1i 590	. . . . . 6 ⊢ ((𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝑉 USGrph 𝐸) → (𝑉 = {𝐶, 𝐴, 𝐵} ∧ 𝑉 USGrph 𝐸))
32		nb3graprlem1 25980	. . . . . 6 ⊢ (((𝐶 ∈ 𝑍 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ∧ (𝑉 = {𝐶, 𝐴, 𝐵} ∧ 𝑉 USGrph 𝐸)) → ((⟨𝑉, 𝐸⟩ Neighbors 𝐶) = {𝐴, 𝐵} ↔ ({𝐶, 𝐴} ∈ ran 𝐸 ∧ {𝐶, 𝐵} ∈ ran 𝐸)))
33	26, 31, 32	syl2an 493	. . . . 5 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝑉 USGrph 𝐸)) → ((⟨𝑉, 𝐸⟩ Neighbors 𝐶) = {𝐴, 𝐵} ↔ ({𝐶, 𝐴} ∈ ran 𝐸 ∧ {𝐶, 𝐵} ∈ ran 𝐸)))
34	16, 24, 33	3anbi123d 1391	. . . 4 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝑉 USGrph 𝐸)) → (((⟨𝑉, 𝐸⟩ Neighbors 𝐴) = {𝐵, 𝐶} ∧ (⟨𝑉, 𝐸⟩ Neighbors 𝐵) = {𝐶, 𝐴} ∧ (⟨𝑉, 𝐸⟩ Neighbors 𝐶) = {𝐴, 𝐵}) ↔ (({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐴, 𝐶} ∈ ran 𝐸) ∧ ({𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐵, 𝐴} ∈ ran 𝐸) ∧ ({𝐶, 𝐴} ∈ ran 𝐸 ∧ {𝐶, 𝐵} ∈ ran 𝐸))))
35	34	3adant3 1074	. . 3 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝑉 USGrph 𝐸) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) → (((⟨𝑉, 𝐸⟩ Neighbors 𝐴) = {𝐵, 𝐶} ∧ (⟨𝑉, 𝐸⟩ Neighbors 𝐵) = {𝐶, 𝐴} ∧ (⟨𝑉, 𝐸⟩ Neighbors 𝐶) = {𝐴, 𝐵}) ↔ (({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐴, 𝐶} ∈ ran 𝐸) ∧ ({𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐵, 𝐴} ∈ ran 𝐸) ∧ ({𝐶, 𝐴} ∈ ran 𝐸 ∧ {𝐶, 𝐵} ∈ ran 𝐸))))
36		nb3graprlem2 25981	. . . 4 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝑉 USGrph 𝐸) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) → ((⟨𝑉, 𝐸⟩ Neighbors 𝐴) = {𝐵, 𝐶} ↔ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝐴) = {𝑦, 𝑧}))
37	20	anbi1i 727	. . . . 5 ⊢ ((𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝑉 USGrph 𝐸) ↔ (𝑉 = {𝐵, 𝐶, 𝐴} ∧ 𝑉 USGrph 𝐸))
38		necom 2835	. . . . . . 7 ⊢ (𝐴 ≠ 𝐵 ↔ 𝐵 ≠ 𝐴)
39		necom 2835	. . . . . . 7 ⊢ (𝐴 ≠ 𝐶 ↔ 𝐶 ≠ 𝐴)
40		biid 250	. . . . . . 7 ⊢ (𝐵 ≠ 𝐶 ↔ 𝐵 ≠ 𝐶)
41	38, 39, 40	3anbi123i 1244	. . . . . 6 ⊢ ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶) ↔ (𝐵 ≠ 𝐴 ∧ 𝐶 ≠ 𝐴 ∧ 𝐵 ≠ 𝐶))
42		3anrot 1036	. . . . . 6 ⊢ ((𝐵 ≠ 𝐶 ∧ 𝐵 ≠ 𝐴 ∧ 𝐶 ≠ 𝐴) ↔ (𝐵 ≠ 𝐴 ∧ 𝐶 ≠ 𝐴 ∧ 𝐵 ≠ 𝐶))
43	41, 42	bitr4i 266	. . . . 5 ⊢ ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶) ↔ (𝐵 ≠ 𝐶 ∧ 𝐵 ≠ 𝐴 ∧ 𝐶 ≠ 𝐴))
44		nb3graprlem2 25981	. . . . 5 ⊢ (((𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍 ∧ 𝐴 ∈ 𝑋) ∧ (𝑉 = {𝐵, 𝐶, 𝐴} ∧ 𝑉 USGrph 𝐸) ∧ (𝐵 ≠ 𝐶 ∧ 𝐵 ≠ 𝐴 ∧ 𝐶 ≠ 𝐴)) → ((⟨𝑉, 𝐸⟩ Neighbors 𝐵) = {𝐶, 𝐴} ↔ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝐵) = {𝑦, 𝑧}))
45	17, 37, 43, 44	syl3anb 1361	. . . 4 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝑉 USGrph 𝐸) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) → ((⟨𝑉, 𝐸⟩ Neighbors 𝐵) = {𝐶, 𝐴} ↔ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝐵) = {𝑦, 𝑧}))
46		id 22	. . . . . . 7 ⊢ (𝑉 = {𝐴, 𝐵, 𝐶} → 𝑉 = {𝐴, 𝐵, 𝐶})
47	46, 28	syl6eq 2660	. . . . . 6 ⊢ (𝑉 = {𝐴, 𝐵, 𝐶} → 𝑉 = {𝐶, 𝐴, 𝐵})
48	47	anim1i 590	. . . . 5 ⊢ ((𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝑉 USGrph 𝐸) → (𝑉 = {𝐶, 𝐴, 𝐵} ∧ 𝑉 USGrph 𝐸))
49		3anrot 1036	. . . . . . 7 ⊢ ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶) ↔ (𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶 ∧ 𝐴 ≠ 𝐵))
50		necom 2835	. . . . . . . 8 ⊢ (𝐵 ≠ 𝐶 ↔ 𝐶 ≠ 𝐵)
51		biid 250	. . . . . . . 8 ⊢ (𝐴 ≠ 𝐵 ↔ 𝐴 ≠ 𝐵)
52	39, 50, 51	3anbi123i 1244	. . . . . . 7 ⊢ ((𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶 ∧ 𝐴 ≠ 𝐵) ↔ (𝐶 ≠ 𝐴 ∧ 𝐶 ≠ 𝐵 ∧ 𝐴 ≠ 𝐵))
53	49, 52	bitri 263	. . . . . 6 ⊢ ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶) ↔ (𝐶 ≠ 𝐴 ∧ 𝐶 ≠ 𝐵 ∧ 𝐴 ≠ 𝐵))
54	53	biimpi 205	. . . . 5 ⊢ ((𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶) → (𝐶 ≠ 𝐴 ∧ 𝐶 ≠ 𝐵 ∧ 𝐴 ≠ 𝐵))
55		nb3graprlem2 25981	. . . . 5 ⊢ (((𝐶 ∈ 𝑍 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌) ∧ (𝑉 = {𝐶, 𝐴, 𝐵} ∧ 𝑉 USGrph 𝐸) ∧ (𝐶 ≠ 𝐴 ∧ 𝐶 ≠ 𝐵 ∧ 𝐴 ≠ 𝐵)) → ((⟨𝑉, 𝐸⟩ Neighbors 𝐶) = {𝐴, 𝐵} ↔ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝐶) = {𝑦, 𝑧}))
56	26, 48, 54, 55	syl3an 1360	. . . 4 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝑉 USGrph 𝐸) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) → ((⟨𝑉, 𝐸⟩ Neighbors 𝐶) = {𝐴, 𝐵} ↔ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝐶) = {𝑦, 𝑧}))
57	36, 45, 56	3anbi123d 1391	. . 3 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝑉 USGrph 𝐸) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) → (((⟨𝑉, 𝐸⟩ Neighbors 𝐴) = {𝐵, 𝐶} ∧ (⟨𝑉, 𝐸⟩ Neighbors 𝐵) = {𝐶, 𝐴} ∧ (⟨𝑉, 𝐸⟩ Neighbors 𝐶) = {𝐴, 𝐵}) ↔ (∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝐴) = {𝑦, 𝑧} ∧ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝐵) = {𝑦, 𝑧} ∧ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝐶) = {𝑦, 𝑧})))
58	15, 35, 57	3bitr2d 295	. 2 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝑉 USGrph 𝐸) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) → (({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸) ↔ (∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝐴) = {𝑦, 𝑧} ∧ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝐵) = {𝑦, 𝑧} ∧ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝐶) = {𝑦, 𝑧})))
59		oveq2 6557	. . . . . 6 ⊢ (𝑥 = 𝐴 → (⟨𝑉, 𝐸⟩ Neighbors 𝑥) = (⟨𝑉, 𝐸⟩ Neighbors 𝐴))
60	59	eqeq1d 2612	. . . . 5 ⊢ (𝑥 = 𝐴 → ((⟨𝑉, 𝐸⟩ Neighbors 𝑥) = {𝑦, 𝑧} ↔ (⟨𝑉, 𝐸⟩ Neighbors 𝐴) = {𝑦, 𝑧}))
61	60	2rexbidv 3039	. . . 4 ⊢ (𝑥 = 𝐴 → (∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝑥) = {𝑦, 𝑧} ↔ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝐴) = {𝑦, 𝑧}))
62		oveq2 6557	. . . . . 6 ⊢ (𝑥 = 𝐵 → (⟨𝑉, 𝐸⟩ Neighbors 𝑥) = (⟨𝑉, 𝐸⟩ Neighbors 𝐵))
63	62	eqeq1d 2612	. . . . 5 ⊢ (𝑥 = 𝐵 → ((⟨𝑉, 𝐸⟩ Neighbors 𝑥) = {𝑦, 𝑧} ↔ (⟨𝑉, 𝐸⟩ Neighbors 𝐵) = {𝑦, 𝑧}))
64	63	2rexbidv 3039	. . . 4 ⊢ (𝑥 = 𝐵 → (∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝑥) = {𝑦, 𝑧} ↔ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝐵) = {𝑦, 𝑧}))
65		oveq2 6557	. . . . . 6 ⊢ (𝑥 = 𝐶 → (⟨𝑉, 𝐸⟩ Neighbors 𝑥) = (⟨𝑉, 𝐸⟩ Neighbors 𝐶))
66	65	eqeq1d 2612	. . . . 5 ⊢ (𝑥 = 𝐶 → ((⟨𝑉, 𝐸⟩ Neighbors 𝑥) = {𝑦, 𝑧} ↔ (⟨𝑉, 𝐸⟩ Neighbors 𝐶) = {𝑦, 𝑧}))
67	66	2rexbidv 3039	. . . 4 ⊢ (𝑥 = 𝐶 → (∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝑥) = {𝑦, 𝑧} ↔ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝐶) = {𝑦, 𝑧}))
68	61, 64, 67	raltpg 4183	. . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) → (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝑥) = {𝑦, 𝑧} ↔ (∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝐴) = {𝑦, 𝑧} ∧ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝐵) = {𝑦, 𝑧} ∧ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝐶) = {𝑦, 𝑧})))
69	68	3ad2ant1 1075	. 2 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝑉 USGrph 𝐸) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) → (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝑥) = {𝑦, 𝑧} ↔ (∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝐴) = {𝑦, 𝑧} ∧ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝐵) = {𝑦, 𝑧} ∧ ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝐶) = {𝑦, 𝑧})))
70		raleq 3115	. . . . 5 ⊢ (𝑉 = {𝐴, 𝐵, 𝐶} → (∀𝑥 ∈ 𝑉 ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝑥) = {𝑦, 𝑧} ↔ ∀𝑥 ∈ {𝐴, 𝐵, 𝐶}∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝑥) = {𝑦, 𝑧}))
71	70	bicomd 212	. . . 4 ⊢ (𝑉 = {𝐴, 𝐵, 𝐶} → (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝑥) = {𝑦, 𝑧} ↔ ∀𝑥 ∈ 𝑉 ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝑥) = {𝑦, 𝑧}))
72	71	adantr 480	. . 3 ⊢ ((𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝑉 USGrph 𝐸) → (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝑥) = {𝑦, 𝑧} ↔ ∀𝑥 ∈ 𝑉 ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝑥) = {𝑦, 𝑧}))
73	72	3ad2ant2 1076	. 2 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝑉 USGrph 𝐸) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) → (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝑥) = {𝑦, 𝑧} ↔ ∀𝑥 ∈ 𝑉 ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝑥) = {𝑦, 𝑧}))
74	58, 69, 73	3bitr2d 295	1 ⊢ (((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑌 ∧ 𝐶 ∈ 𝑍) ∧ (𝑉 = {𝐴, 𝐵, 𝐶} ∧ 𝑉 USGrph 𝐸) ∧ (𝐴 ≠ 𝐵 ∧ 𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶)) → (({𝐴, 𝐵} ∈ ran 𝐸 ∧ {𝐵, 𝐶} ∈ ran 𝐸 ∧ {𝐶, 𝐴} ∈ ran 𝐸) ↔ ∀𝑥 ∈ 𝑉 ∃𝑦 ∈ 𝑉 ∃𝑧 ∈ (𝑉 ∖ {𝑦})(⟨𝑉, 𝐸⟩ Neighbors 𝑥) = {𝑦, 𝑧}))

Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977   ≠ wne 2780  ∀wral 2896  ∃wrex 2897   ∖ cdif 3537  {csn 4125  {cpr 4127  {ctp 4129  ⟨cop 4131   class class class wbr 4583  ran crn 5039  (class class class)co 6549   USGrph cusg 25859   Neighbors cnbgra 25946

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-cnex 9871  ax-resscn 9872  ax-1cn 9873  ax-icn 9874  ax-addcl 9875  ax-addrcl 9876  ax-mulcl 9877  ax-mulrcl 9878  ax-mulcom 9879  ax-addass 9880  ax-mulass 9881  ax-distr 9882  ax-i2m1 9883  ax-1ne0 9884  ax-1rid 9885  ax-rnegex 9886  ax-rrecex 9887  ax-cnre 9888  ax-pre-lttri 9889  ax-pre-lttrn 9890  ax-pre-ltadd 9891  ax-pre-mulgt0 9892

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-tr 4681  df-eprel 4949  df-id 4953  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-pred 5597  df-ord 5643  df-on 5644  df-lim 5645  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-om 6958  df-1st 7059  df-2nd 7060  df-wrecs 7294  df-recs 7355  df-rdg 7393  df-1o 7447  df-oadd 7451  df-er 7629  df-en 7842  df-dom 7843  df-sdom 7844  df-fin 7845  df-card 8648  df-cda 8873  df-pnf 9955  df-mnf 9956  df-xr 9957  df-ltxr 9958  df-le 9959  df-sub 10147  df-neg 10148  df-nn 10898  df-2 10956  df-n0 11170  df-z 11255  df-uz 11564  df-fz 12198  df-hash 12980  df-usgra 25862  df-nbgra 25949

This theorem is referenced by:  cusgra3vnbpr  25994