Metamath Proof Explorer


Theorem nb3grpr2

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

Ref Expression
Hypotheses nb3grpr.v V=VtxG
nb3grpr.e E=EdgG
nb3grpr.g φGUSGraph
nb3grpr.t φV=ABC
nb3grpr.s φAXBYCZ
nb3grpr.n φABACBC
Assertion nb3grpr2 φABEBCECAEGNeighbVtxA=BCGNeighbVtxB=ACGNeighbVtxC=AB

Proof

Step Hyp Ref Expression
1 nb3grpr.v V=VtxG
2 nb3grpr.e E=EdgG
3 nb3grpr.g φGUSGraph
4 nb3grpr.t φV=ABC
5 nb3grpr.s φAXBYCZ
6 nb3grpr.n φABACBC
7 3anan32 ABEBCECAEABECAEBCE
8 7 a1i φABEBCECAEABECAEBCE
9 prcom CA=AC
10 9 eleq1i CAEACE
11 10 biimpi CAEACE
12 11 pm4.71i CAECAEACE
13 12 bianass ABECAEABECAEACE
14 13 anbi1i ABECAEBCEABECAEACEBCE
15 anass ABECAEACEBCEABECAEACEBCE
16 14 15 bitri ABECAEBCEABECAEACEBCE
17 8 16 bitrdi φABEBCECAEABECAEACEBCE
18 prcom AB=BA
19 18 eleq1i ABEBAE
20 19 biimpi ABEBAE
21 20 pm4.71i ABEABEBAE
22 21 anbi1i ABECAEABEBAECAE
23 df-3an ABEBAECAEABEBAECAE
24 22 23 bitr4i ABECAEABEBAECAE
25 prcom BC=CB
26 25 eleq1i BCECBE
27 26 biimpi BCECBE
28 27 pm4.71i BCEBCECBE
29 28 anbi2i ACEBCEACEBCECBE
30 3anass ACEBCECBEACEBCECBE
31 29 30 bitr4i ACEBCEACEBCECBE
32 24 31 anbi12i ABECAEACEBCEABEBAECAEACEBCECBE
33 an6 ABEBAECAEACEBCECBEABEACEBAEBCECAECBE
34 32 33 bitri ABECAEACEBCEABEACEBAEBCECAECBE
35 17 34 bitrdi φABEBCECAEABEACEBAEBCECAECBE
36 1 2 3 4 5 nb3grprlem1 φGNeighbVtxA=BCABEACE
37 tpcoma ABC=BAC
38 4 37 eqtrdi φV=BAC
39 3ancoma AXBYCZBYAXCZ
40 5 39 sylib φBYAXCZ
41 1 2 3 38 40 nb3grprlem1 φGNeighbVtxB=ACBAEBCE
42 tprot CAB=ABC
43 4 42 eqtr4di φV=CAB
44 3anrot CZAXBYAXBYCZ
45 5 44 sylibr φCZAXBY
46 1 2 3 43 45 nb3grprlem1 φGNeighbVtxC=ABCAECBE
47 36 41 46 3anbi123d φGNeighbVtxA=BCGNeighbVtxB=ACGNeighbVtxC=ABABEACEBAEBCECAECBE
48 35 47 bitr4d φABEBCECAEGNeighbVtxA=BCGNeighbVtxB=ACGNeighbVtxC=AB