MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nb3grapr Structured version   Unicode version

Theorem nb3grapr 24244
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  |-  ( ( ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z
)  /\  ( V  =  { A ,  B ,  C }  /\  V USGrph  E )  /\  ( A  =/=  B  /\  A  =/=  C  /\  B  =/= 
C ) )  -> 
( ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E )  <->  A. x  e.  V  E. y  e.  V  E. z  e.  ( V  \  { y } ) ( <. V ,  E >. Neighbors  x )  =  {
y ,  z } ) )
Distinct variable groups:    x, A, y, z    x, B, y, z    x, C, y, z    x, E, y, z    x, V, y, z
Allowed substitution hints:    X( x, y, z)    Y( x, y, z)    Z( x, y, z)

Proof of Theorem nb3grapr
StepHypRef Expression
1 id 22 . . . . . 6  |-  ( ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E )  -> 
( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E ) )
2 prcom 4110 . . . . . . . . . 10  |-  { A ,  B }  =  { B ,  A }
32eleq1i 2544 . . . . . . . . 9  |-  ( { A ,  B }  e.  ran  E  <->  { B ,  A }  e.  ran  E )
4 prcom 4110 . . . . . . . . . 10  |-  { B ,  C }  =  { C ,  B }
54eleq1i 2544 . . . . . . . . 9  |-  ( { B ,  C }  e.  ran  E  <->  { C ,  B }  e.  ran  E )
6 prcom 4110 . . . . . . . . . 10  |-  { C ,  A }  =  { A ,  C }
76eleq1i 2544 . . . . . . . . 9  |-  ( { C ,  A }  e.  ran  E  <->  { A ,  C }  e.  ran  E )
83, 5, 73anbi123i 1185 . . . . . . . 8  |-  ( ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E )  <->  ( { B ,  A }  e.  ran  E  /\  { C ,  B }  e.  ran  E  /\  { A ,  C }  e.  ran  E ) )
9 3anrot 978 . . . . . . . 8  |-  ( ( { A ,  C }  e.  ran  E  /\  { B ,  A }  e.  ran  E  /\  { C ,  B }  e.  ran  E )  <->  ( { B ,  A }  e.  ran  E  /\  { C ,  B }  e.  ran  E  /\  { A ,  C }  e.  ran  E ) )
108, 9bitr4i 252 . . . . . . 7  |-  ( ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E )  <->  ( { A ,  C }  e.  ran  E  /\  { B ,  A }  e.  ran  E  /\  { C ,  B }  e.  ran  E ) )
1110a1i 11 . . . . . 6  |-  ( ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E )  -> 
( ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E )  <->  ( { A ,  C }  e.  ran  E  /\  { B ,  A }  e.  ran  E  /\  { C ,  B }  e.  ran  E ) ) )
121, 11biadan2 642 . . . . 5  |-  ( ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E )  <->  ( ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E )  /\  ( { A ,  C }  e.  ran  E  /\  { B ,  A }  e.  ran  E  /\  { C ,  B }  e.  ran  E ) ) )
13 an6 1308 . . . . 5  |-  ( ( ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E )  /\  ( { A ,  C }  e.  ran  E  /\  { B ,  A }  e.  ran  E  /\  { C ,  B }  e.  ran  E ) )  <-> 
( ( { A ,  B }  e.  ran  E  /\  { A ,  C }  e.  ran  E )  /\  ( { B ,  C }  e.  ran  E  /\  { B ,  A }  e.  ran  E )  /\  ( { C ,  A }  e.  ran  E  /\  { C ,  B }  e.  ran  E ) ) )
1412, 13bitri 249 . . . 4  |-  ( ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E )  <->  ( ( { A ,  B }  e.  ran  E  /\  { A ,  C }  e.  ran  E )  /\  ( { B ,  C }  e.  ran  E  /\  { B ,  A }  e.  ran  E )  /\  ( { C ,  A }  e.  ran  E  /\  { C ,  B }  e.  ran  E ) ) )
1514a1i 11 . . 3  |-  ( ( ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z
)  /\  ( V  =  { A ,  B ,  C }  /\  V USGrph  E )  /\  ( A  =/=  B  /\  A  =/=  C  /\  B  =/= 
C ) )  -> 
( ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E )  <->  ( ( { A ,  B }  e.  ran  E  /\  { A ,  C }  e.  ran  E )  /\  ( { B ,  C }  e.  ran  E  /\  { B ,  A }  e.  ran  E )  /\  ( { C ,  A }  e.  ran  E  /\  { C ,  B }  e.  ran  E ) ) ) )
16 nb3graprlem1 24242 . . . . 5  |-  ( ( ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z
)  /\  ( V  =  { A ,  B ,  C }  /\  V USGrph  E ) )  ->  (
( <. V ,  E >. Neighbors  A )  =  { B ,  C }  <->  ( { A ,  B }  e.  ran  E  /\  { A ,  C }  e.  ran  E ) ) )
17 3anrot 978 . . . . . . 7  |-  ( ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z )  <->  ( B  e.  Y  /\  C  e.  Z  /\  A  e.  X )
)
1817biimpi 194 . . . . . 6  |-  ( ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z )  ->  ( B  e.  Y  /\  C  e.  Z  /\  A  e.  X
) )
19 tprot 4127 . . . . . . . . 9  |-  { A ,  B ,  C }  =  { B ,  C ,  A }
2019eqeq2i 2485 . . . . . . . 8  |-  ( V  =  { A ,  B ,  C }  <->  V  =  { B ,  C ,  A }
)
2120biimpi 194 . . . . . . 7  |-  ( V  =  { A ,  B ,  C }  ->  V  =  { B ,  C ,  A }
)
2221anim1i 568 . . . . . 6  |-  ( ( V  =  { A ,  B ,  C }  /\  V USGrph  E )  -> 
( V  =  { B ,  C ,  A }  /\  V USGrph  E
) )
23 nb3graprlem1 24242 . . . . . 6  |-  ( ( ( B  e.  Y  /\  C  e.  Z  /\  A  e.  X
)  /\  ( V  =  { B ,  C ,  A }  /\  V USGrph  E ) )  ->  (
( <. V ,  E >. Neighbors  B )  =  { C ,  A }  <->  ( { B ,  C }  e.  ran  E  /\  { B ,  A }  e.  ran  E ) ) )
2418, 22, 23syl2an 477 . . . . 5  |-  ( ( ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z
)  /\  ( V  =  { A ,  B ,  C }  /\  V USGrph  E ) )  ->  (
( <. V ,  E >. Neighbors  B )  =  { C ,  A }  <->  ( { B ,  C }  e.  ran  E  /\  { B ,  A }  e.  ran  E ) ) )
25 3anrot 978 . . . . . . 7  |-  ( ( C  e.  Z  /\  A  e.  X  /\  B  e.  Y )  <->  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z )
)
2625biimpri 206 . . . . . 6  |-  ( ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z )  ->  ( C  e.  Z  /\  A  e.  X  /\  B  e.  Y
) )
27 tprot 4127 . . . . . . . . . 10  |-  { C ,  A ,  B }  =  { A ,  B ,  C }
2827eqcomi 2480 . . . . . . . . 9  |-  { A ,  B ,  C }  =  { C ,  A ,  B }
2928eqeq2i 2485 . . . . . . . 8  |-  ( V  =  { A ,  B ,  C }  <->  V  =  { C ,  A ,  B }
)
3029biimpi 194 . . . . . . 7  |-  ( V  =  { A ,  B ,  C }  ->  V  =  { C ,  A ,  B }
)
3130anim1i 568 . . . . . 6  |-  ( ( V  =  { A ,  B ,  C }  /\  V USGrph  E )  -> 
( V  =  { C ,  A ,  B }  /\  V USGrph  E
) )
32 nb3graprlem1 24242 . . . . . 6  |-  ( ( ( C  e.  Z  /\  A  e.  X  /\  B  e.  Y
)  /\  ( V  =  { C ,  A ,  B }  /\  V USGrph  E ) )  ->  (
( <. V ,  E >. Neighbors  C )  =  { A ,  B }  <->  ( { C ,  A }  e.  ran  E  /\  { C ,  B }  e.  ran  E ) ) )
3326, 31, 32syl2an 477 . . . . 5  |-  ( ( ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z
)  /\  ( V  =  { A ,  B ,  C }  /\  V USGrph  E ) )  ->  (
( <. V ,  E >. Neighbors  C )  =  { A ,  B }  <->  ( { C ,  A }  e.  ran  E  /\  { C ,  B }  e.  ran  E ) ) )
3416, 24, 333anbi123d 1299 . . . 4  |-  ( ( ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z
)  /\  ( V  =  { A ,  B ,  C }  /\  V USGrph  E ) )  ->  (
( ( <. V ,  E >. Neighbors  A )  =  { B ,  C }  /\  ( <. V ,  E >. Neighbors  B )  =  { C ,  A }  /\  ( <. V ,  E >. Neighbors  C )  =  { A ,  B }
)  <->  ( ( { A ,  B }  e.  ran  E  /\  { A ,  C }  e.  ran  E )  /\  ( { B ,  C }  e.  ran  E  /\  { B ,  A }  e.  ran  E )  /\  ( { C ,  A }  e.  ran  E  /\  { C ,  B }  e.  ran  E ) ) ) )
35343adant3 1016 . . 3  |-  ( ( ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z
)  /\  ( V  =  { A ,  B ,  C }  /\  V USGrph  E )  /\  ( A  =/=  B  /\  A  =/=  C  /\  B  =/= 
C ) )  -> 
( ( ( <. V ,  E >. Neighbors  A
)  =  { B ,  C }  /\  ( <. V ,  E >. Neighbors  B
)  =  { C ,  A }  /\  ( <. V ,  E >. Neighbors  C
)  =  { A ,  B } )  <->  ( ( { A ,  B }  e.  ran  E  /\  { A ,  C }  e.  ran  E )  /\  ( { B ,  C }  e.  ran  E  /\  { B ,  A }  e.  ran  E )  /\  ( { C ,  A }  e.  ran  E  /\  { C ,  B }  e.  ran  E ) ) ) )
36 nb3graprlem2 24243 . . . 4  |-  ( ( ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z
)  /\  ( V  =  { A ,  B ,  C }  /\  V USGrph  E )  /\  ( A  =/=  B  /\  A  =/=  C  /\  B  =/= 
C ) )  -> 
( ( <. V ,  E >. Neighbors  A )  =  { B ,  C }  <->  E. y  e.  V  E. z  e.  ( V  \  { y } ) ( <. V ,  E >. Neighbors  A )  =  {
y ,  z } ) )
3720anbi1i 695 . . . . 5  |-  ( ( V  =  { A ,  B ,  C }  /\  V USGrph  E )  <->  ( V  =  { B ,  C ,  A }  /\  V USGrph  E ) )
38 necom 2736 . . . . . . 7  |-  ( A  =/=  B  <->  B  =/=  A )
39 necom 2736 . . . . . . 7  |-  ( A  =/=  C  <->  C  =/=  A )
40 biid 236 . . . . . . 7  |-  ( B  =/=  C  <->  B  =/=  C )
4138, 39, 403anbi123i 1185 . . . . . 6  |-  ( ( A  =/=  B  /\  A  =/=  C  /\  B  =/=  C )  <->  ( B  =/=  A  /\  C  =/= 
A  /\  B  =/=  C ) )
42 3anrot 978 . . . . . 6  |-  ( ( B  =/=  C  /\  B  =/=  A  /\  C  =/=  A )  <->  ( B  =/=  A  /\  C  =/= 
A  /\  B  =/=  C ) )
4341, 42bitr4i 252 . . . . 5  |-  ( ( A  =/=  B  /\  A  =/=  C  /\  B  =/=  C )  <->  ( B  =/=  C  /\  B  =/= 
A  /\  C  =/=  A ) )
44 nb3graprlem2 24243 . . . . 5  |-  ( ( ( B  e.  Y  /\  C  e.  Z  /\  A  e.  X
)  /\  ( V  =  { B ,  C ,  A }  /\  V USGrph  E )  /\  ( B  =/=  C  /\  B  =/=  A  /\  C  =/= 
A ) )  -> 
( ( <. V ,  E >. Neighbors  B )  =  { C ,  A }  <->  E. y  e.  V  E. z  e.  ( V  \  { y } ) ( <. V ,  E >. Neighbors  B )  =  {
y ,  z } ) )
4517, 37, 43, 44syl3anb 1271 . . . 4  |-  ( ( ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z
)  /\  ( V  =  { A ,  B ,  C }  /\  V USGrph  E )  /\  ( A  =/=  B  /\  A  =/=  C  /\  B  =/= 
C ) )  -> 
( ( <. V ,  E >. Neighbors  B )  =  { C ,  A }  <->  E. y  e.  V  E. z  e.  ( V  \  { y } ) ( <. V ,  E >. Neighbors  B )  =  {
y ,  z } ) )
46 id 22 . . . . . . 7  |-  ( V  =  { A ,  B ,  C }  ->  V  =  { A ,  B ,  C }
)
4746, 28syl6eq 2524 . . . . . 6  |-  ( V  =  { A ,  B ,  C }  ->  V  =  { C ,  A ,  B }
)
4847anim1i 568 . . . . 5  |-  ( ( V  =  { A ,  B ,  C }  /\  V USGrph  E )  -> 
( V  =  { C ,  A ,  B }  /\  V USGrph  E
) )
49 3anrot 978 . . . . . . 7  |-  ( ( A  =/=  B  /\  A  =/=  C  /\  B  =/=  C )  <->  ( A  =/=  C  /\  B  =/= 
C  /\  A  =/=  B ) )
50 necom 2736 . . . . . . . 8  |-  ( B  =/=  C  <->  C  =/=  B )
51 biid 236 . . . . . . . 8  |-  ( A  =/=  B  <->  A  =/=  B )
5239, 50, 513anbi123i 1185 . . . . . . 7  |-  ( ( A  =/=  C  /\  B  =/=  C  /\  A  =/=  B )  <->  ( C  =/=  A  /\  C  =/= 
B  /\  A  =/=  B ) )
5349, 52bitri 249 . . . . . 6  |-  ( ( A  =/=  B  /\  A  =/=  C  /\  B  =/=  C )  <->  ( C  =/=  A  /\  C  =/= 
B  /\  A  =/=  B ) )
5453biimpi 194 . . . . 5  |-  ( ( A  =/=  B  /\  A  =/=  C  /\  B  =/=  C )  ->  ( C  =/=  A  /\  C  =/=  B  /\  A  =/= 
B ) )
55 nb3graprlem2 24243 . . . . 5  |-  ( ( ( C  e.  Z  /\  A  e.  X  /\  B  e.  Y
)  /\  ( V  =  { C ,  A ,  B }  /\  V USGrph  E )  /\  ( C  =/=  A  /\  C  =/=  B  /\  A  =/= 
B ) )  -> 
( ( <. V ,  E >. Neighbors  C )  =  { A ,  B }  <->  E. y  e.  V  E. z  e.  ( V  \  { y } ) ( <. V ,  E >. Neighbors  C )  =  {
y ,  z } ) )
5626, 48, 54, 55syl3an 1270 . . . 4  |-  ( ( ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z
)  /\  ( V  =  { A ,  B ,  C }  /\  V USGrph  E )  /\  ( A  =/=  B  /\  A  =/=  C  /\  B  =/= 
C ) )  -> 
( ( <. V ,  E >. Neighbors  C )  =  { A ,  B }  <->  E. y  e.  V  E. z  e.  ( V  \  { y } ) ( <. V ,  E >. Neighbors  C )  =  {
y ,  z } ) )
5736, 45, 563anbi123d 1299 . . 3  |-  ( ( ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z
)  /\  ( V  =  { A ,  B ,  C }  /\  V USGrph  E )  /\  ( A  =/=  B  /\  A  =/=  C  /\  B  =/= 
C ) )  -> 
( ( ( <. V ,  E >. Neighbors  A
)  =  { B ,  C }  /\  ( <. V ,  E >. Neighbors  B
)  =  { C ,  A }  /\  ( <. V ,  E >. Neighbors  C
)  =  { A ,  B } )  <->  ( E. y  e.  V  E. z  e.  ( V  \  { y } ) ( <. V ,  E >. Neighbors  A )  =  {
y ,  z }  /\  E. y  e.  V  E. z  e.  ( V  \  {
y } ) (
<. V ,  E >. Neighbors  B
)  =  { y ,  z }  /\  E. y  e.  V  E. z  e.  ( V  \  { y } ) ( <. V ,  E >. Neighbors  C )  =  {
y ,  z } ) ) )
5815, 35, 573bitr2d 281 . 2  |-  ( ( ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z
)  /\  ( V  =  { A ,  B ,  C }  /\  V USGrph  E )  /\  ( A  =/=  B  /\  A  =/=  C  /\  B  =/= 
C ) )  -> 
( ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E )  <->  ( E. y  e.  V  E. z  e.  ( V  \  {
y } ) (
<. V ,  E >. Neighbors  A
)  =  { y ,  z }  /\  E. y  e.  V  E. z  e.  ( V  \  { y } ) ( <. V ,  E >. Neighbors  B )  =  {
y ,  z }  /\  E. y  e.  V  E. z  e.  ( V  \  {
y } ) (
<. V ,  E >. Neighbors  C
)  =  { y ,  z } ) ) )
59 oveq2 6302 . . . . . 6  |-  ( x  =  A  ->  ( <. V ,  E >. Neighbors  x
)  =  ( <. V ,  E >. Neighbors  A
) )
6059eqeq1d 2469 . . . . 5  |-  ( x  =  A  ->  (
( <. V ,  E >. Neighbors  x )  =  {
y ,  z }  <-> 
( <. V ,  E >. Neighbors  A )  =  {
y ,  z } ) )
61602rexbidv 2985 . . . 4  |-  ( x  =  A  ->  ( E. y  e.  V  E. z  e.  ( V  \  { y } ) ( <. V ,  E >. Neighbors  x )  =  {
y ,  z }  <->  E. y  e.  V  E. z  e.  ( V  \  { y } ) ( <. V ,  E >. Neighbors  A )  =  {
y ,  z } ) )
62 oveq2 6302 . . . . . 6  |-  ( x  =  B  ->  ( <. V ,  E >. Neighbors  x
)  =  ( <. V ,  E >. Neighbors  B
) )
6362eqeq1d 2469 . . . . 5  |-  ( x  =  B  ->  (
( <. V ,  E >. Neighbors  x )  =  {
y ,  z }  <-> 
( <. V ,  E >. Neighbors  B )  =  {
y ,  z } ) )
64632rexbidv 2985 . . . 4  |-  ( x  =  B  ->  ( E. y  e.  V  E. z  e.  ( V  \  { y } ) ( <. V ,  E >. Neighbors  x )  =  {
y ,  z }  <->  E. y  e.  V  E. z  e.  ( V  \  { y } ) ( <. V ,  E >. Neighbors  B )  =  {
y ,  z } ) )
65 oveq2 6302 . . . . . 6  |-  ( x  =  C  ->  ( <. V ,  E >. Neighbors  x
)  =  ( <. V ,  E >. Neighbors  C
) )
6665eqeq1d 2469 . . . . 5  |-  ( x  =  C  ->  (
( <. V ,  E >. Neighbors  x )  =  {
y ,  z }  <-> 
( <. V ,  E >. Neighbors  C )  =  {
y ,  z } ) )
67662rexbidv 2985 . . . 4  |-  ( x  =  C  ->  ( E. y  e.  V  E. z  e.  ( V  \  { y } ) ( <. V ,  E >. Neighbors  x )  =  {
y ,  z }  <->  E. y  e.  V  E. z  e.  ( V  \  { y } ) ( <. V ,  E >. Neighbors  C )  =  {
y ,  z } ) )
6861, 64, 67raltpg 4083 . . 3  |-  ( ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z )  ->  ( A. x  e. 
{ A ,  B ,  C } E. y  e.  V  E. z  e.  ( V  \  {
y } ) (
<. V ,  E >. Neighbors  x
)  =  { y ,  z }  <->  ( E. y  e.  V  E. z  e.  ( V  \  { y } ) ( <. V ,  E >. Neighbors  A )  =  {
y ,  z }  /\  E. y  e.  V  E. z  e.  ( V  \  {
y } ) (
<. V ,  E >. Neighbors  B
)  =  { y ,  z }  /\  E. y  e.  V  E. z  e.  ( V  \  { y } ) ( <. V ,  E >. Neighbors  C )  =  {
y ,  z } ) ) )
69683ad2ant1 1017 . 2  |-  ( ( ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z
)  /\  ( V  =  { A ,  B ,  C }  /\  V USGrph  E )  /\  ( A  =/=  B  /\  A  =/=  C  /\  B  =/= 
C ) )  -> 
( A. x  e. 
{ A ,  B ,  C } E. y  e.  V  E. z  e.  ( V  \  {
y } ) (
<. V ,  E >. Neighbors  x
)  =  { y ,  z }  <->  ( E. y  e.  V  E. z  e.  ( V  \  { y } ) ( <. V ,  E >. Neighbors  A )  =  {
y ,  z }  /\  E. y  e.  V  E. z  e.  ( V  \  {
y } ) (
<. V ,  E >. Neighbors  B
)  =  { y ,  z }  /\  E. y  e.  V  E. z  e.  ( V  \  { y } ) ( <. V ,  E >. Neighbors  C )  =  {
y ,  z } ) ) )
70 raleq 3063 . . . . 5  |-  ( V  =  { A ,  B ,  C }  ->  ( A. x  e.  V  E. y  e.  V  E. z  e.  ( V  \  {
y } ) (
<. V ,  E >. Neighbors  x
)  =  { y ,  z }  <->  A. x  e.  { A ,  B ,  C } E. y  e.  V  E. z  e.  ( V  \  {
y } ) (
<. V ,  E >. Neighbors  x
)  =  { y ,  z } ) )
7170bicomd 201 . . . 4  |-  ( V  =  { A ,  B ,  C }  ->  ( A. x  e. 
{ A ,  B ,  C } E. y  e.  V  E. z  e.  ( V  \  {
y } ) (
<. V ,  E >. Neighbors  x
)  =  { y ,  z }  <->  A. x  e.  V  E. y  e.  V  E. z  e.  ( V  \  {
y } ) (
<. V ,  E >. Neighbors  x
)  =  { y ,  z } ) )
7271adantr 465 . . 3  |-  ( ( V  =  { A ,  B ,  C }  /\  V USGrph  E )  -> 
( A. x  e. 
{ A ,  B ,  C } E. y  e.  V  E. z  e.  ( V  \  {
y } ) (
<. V ,  E >. Neighbors  x
)  =  { y ,  z }  <->  A. x  e.  V  E. y  e.  V  E. z  e.  ( V  \  {
y } ) (
<. V ,  E >. Neighbors  x
)  =  { y ,  z } ) )
73723ad2ant2 1018 . 2  |-  ( ( ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z
)  /\  ( V  =  { A ,  B ,  C }  /\  V USGrph  E )  /\  ( A  =/=  B  /\  A  =/=  C  /\  B  =/= 
C ) )  -> 
( A. x  e. 
{ A ,  B ,  C } E. y  e.  V  E. z  e.  ( V  \  {
y } ) (
<. V ,  E >. Neighbors  x
)  =  { y ,  z }  <->  A. x  e.  V  E. y  e.  V  E. z  e.  ( V  \  {
y } ) (
<. V ,  E >. Neighbors  x
)  =  { y ,  z } ) )
7458, 69, 733bitr2d 281 1  |-  ( ( ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z
)  /\  ( V  =  { A ,  B ,  C }  /\  V USGrph  E )  /\  ( A  =/=  B  /\  A  =/=  C  /\  B  =/= 
C ) )  -> 
( ( { A ,  B }  e.  ran  E  /\  { B ,  C }  e.  ran  E  /\  { C ,  A }  e.  ran  E )  <->  A. x  e.  V  E. y  e.  V  E. z  e.  ( V  \  { y } ) ( <. V ,  E >. Neighbors  x )  =  {
y ,  z } ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    /\ w3a 973    = wceq 1379    e. wcel 1767    =/= wne 2662   A.wral 2817   E.wrex 2818    \ cdif 3478   {csn 4032   {cpr 4034   {ctp 4036   <.cop 4038   class class class wbr 4452   ran crn 5005  (class class class)co 6294   USGrph cusg 24121   Neighbors cnbgra 24208
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-8 1769  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-rep 4563  ax-sep 4573  ax-nul 4581  ax-pow 4630  ax-pr 4691  ax-un 6586  ax-cnex 9558  ax-resscn 9559  ax-1cn 9560  ax-icn 9561  ax-addcl 9562  ax-addrcl 9563  ax-mulcl 9564  ax-mulrcl 9565  ax-mulcom 9566  ax-addass 9567  ax-mulass 9568  ax-distr 9569  ax-i2m1 9570  ax-1ne0 9571  ax-1rid 9572  ax-rnegex 9573  ax-rrecex 9574  ax-cnre 9575  ax-pre-lttri 9576  ax-pre-lttrn 9577  ax-pre-ltadd 9578  ax-pre-mulgt0 9579
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 974  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-mo 2280  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-nel 2665  df-ral 2822  df-rex 2823  df-reu 2824  df-rmo 2825  df-rab 2826  df-v 3120  df-sbc 3337  df-csb 3441  df-dif 3484  df-un 3486  df-in 3488  df-ss 3495  df-pss 3497  df-nul 3791  df-if 3945  df-pw 4017  df-sn 4033  df-pr 4035  df-tp 4037  df-op 4039  df-uni 4251  df-int 4288  df-iun 4332  df-br 4453  df-opab 4511  df-mpt 4512  df-tr 4546  df-eprel 4796  df-id 4800  df-po 4805  df-so 4806  df-fr 4843  df-we 4845  df-ord 4886  df-on 4887  df-lim 4888  df-suc 4889  df-xp 5010  df-rel 5011  df-cnv 5012  df-co 5013  df-dm 5014  df-rn 5015  df-res 5016  df-ima 5017  df-iota 5556  df-fun 5595  df-fn 5596  df-f 5597  df-f1 5598  df-fo 5599  df-f1o 5600  df-fv 5601  df-riota 6255  df-ov 6297  df-oprab 6298  df-mpt2 6299  df-om 6695  df-1st 6794  df-2nd 6795  df-recs 7052  df-rdg 7086  df-1o 7140  df-oadd 7144  df-er 7321  df-en 7527  df-dom 7528  df-sdom 7529  df-fin 7530  df-card 8330  df-cda 8558  df-pnf 9640  df-mnf 9641  df-xr 9642  df-ltxr 9643  df-le 9644  df-sub 9817  df-neg 9818  df-nn 10547  df-2 10604  df-n0 10806  df-z 10875  df-uz 11093  df-fz 11683  df-hash 12384  df-usgra 24124  df-nbgra 24211
This theorem is referenced by:  cusgra3vnbpr  24256
  Copyright terms: Public domain W3C validator