Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  brcolinear Structured version   Visualization version   Unicode version

Theorem brcolinear 32166
Description: The binary relation form of the colinearity predicate. (Contributed by Scott Fenton, 5-Oct-2013.)
Assertion
Ref Expression
brcolinear  |-  ( ( N  e.  NN  /\  ( A  e.  ( EE `  N )  /\  B  e.  ( EE `  N )  /\  C  e.  ( EE `  N
) ) )  -> 
( A  Colinear  <. B ,  C >. 
<->  ( A  Btwn  <. B ,  C >.  \/  B  Btwn  <. C ,  A >.  \/  C  Btwn  <. A ,  B >. ) ) )

Proof of Theorem brcolinear
Dummy variable  n is distinct from all other variables.
StepHypRef Expression
1 brcolinear2 32165 . . . 4  |-  ( ( B  e.  ( EE
`  N )  /\  C  e.  ( EE `  N ) )  -> 
( A  Colinear  <. B ,  C >. 
<->  E. n  e.  NN  ( ( A  e.  ( EE `  n
)  /\  B  e.  ( EE `  n )  /\  C  e.  ( EE `  n ) )  /\  ( A 
Btwn  <. B ,  C >.  \/  B  Btwn  <. C ,  A >.  \/  C  Btwn  <. A ,  B >. ) ) ) )
213adant1 1079 . . 3  |-  ( ( A  e.  ( EE
`  N )  /\  B  e.  ( EE `  N )  /\  C  e.  ( EE `  N
) )  ->  ( A  Colinear  <. B ,  C >.  <->  E. n  e.  NN  ( ( A  e.  ( EE `  n
)  /\  B  e.  ( EE `  n )  /\  C  e.  ( EE `  n ) )  /\  ( A 
Btwn  <. B ,  C >.  \/  B  Btwn  <. C ,  A >.  \/  C  Btwn  <. A ,  B >. ) ) ) )
32adantl 482 . 2  |-  ( ( N  e.  NN  /\  ( A  e.  ( EE `  N )  /\  B  e.  ( EE `  N )  /\  C  e.  ( EE `  N
) ) )  -> 
( A  Colinear  <. B ,  C >. 
<->  E. n  e.  NN  ( ( A  e.  ( EE `  n
)  /\  B  e.  ( EE `  n )  /\  C  e.  ( EE `  n ) )  /\  ( A 
Btwn  <. B ,  C >.  \/  B  Btwn  <. C ,  A >.  \/  C  Btwn  <. A ,  B >. ) ) ) )
4 simpr 477 . . . 4  |-  ( ( ( A  e.  ( EE `  n )  /\  B  e.  ( EE `  n )  /\  C  e.  ( EE `  n ) )  /\  ( A 
Btwn  <. B ,  C >.  \/  B  Btwn  <. C ,  A >.  \/  C  Btwn  <. A ,  B >. ) )  ->  ( A  Btwn  <. B ,  C >.  \/  B  Btwn  <. C ,  A >.  \/  C  Btwn  <. A ,  B >. ) )
54rexlimivw 3029 . . 3  |-  ( E. n  e.  NN  (
( A  e.  ( EE `  n )  /\  B  e.  ( EE `  n )  /\  C  e.  ( EE `  n ) )  /\  ( A 
Btwn  <. B ,  C >.  \/  B  Btwn  <. C ,  A >.  \/  C  Btwn  <. A ,  B >. ) )  ->  ( A  Btwn  <. B ,  C >.  \/  B  Btwn  <. C ,  A >.  \/  C  Btwn  <. A ,  B >. ) )
6 fveq2 6191 . . . . . . . 8  |-  ( n  =  N  ->  ( EE `  n )  =  ( EE `  N
) )
76eleq2d 2687 . . . . . . 7  |-  ( n  =  N  ->  ( A  e.  ( EE `  n )  <->  A  e.  ( EE `  N ) ) )
86eleq2d 2687 . . . . . . 7  |-  ( n  =  N  ->  ( B  e.  ( EE `  n )  <->  B  e.  ( EE `  N ) ) )
96eleq2d 2687 . . . . . . 7  |-  ( n  =  N  ->  ( C  e.  ( EE `  n )  <->  C  e.  ( EE `  N ) ) )
107, 8, 93anbi123d 1399 . . . . . 6  |-  ( n  =  N  ->  (
( A  e.  ( EE `  n )  /\  B  e.  ( EE `  n )  /\  C  e.  ( EE `  n ) )  <->  ( A  e.  ( EE `  N
)  /\  B  e.  ( EE `  N )  /\  C  e.  ( EE `  N ) ) ) )
1110anbi1d 741 . . . . 5  |-  ( n  =  N  ->  (
( ( A  e.  ( EE `  n
)  /\  B  e.  ( EE `  n )  /\  C  e.  ( EE `  n ) )  /\  ( A 
Btwn  <. B ,  C >.  \/  B  Btwn  <. C ,  A >.  \/  C  Btwn  <. A ,  B >. ) )  <->  ( ( A  e.  ( EE `  N )  /\  B  e.  ( EE `  N
)  /\  C  e.  ( EE `  N ) )  /\  ( A 
Btwn  <. B ,  C >.  \/  B  Btwn  <. C ,  A >.  \/  C  Btwn  <. A ,  B >. ) ) ) )
1211rspcev 3309 . . . 4  |-  ( ( N  e.  NN  /\  ( ( A  e.  ( EE `  N
)  /\  B  e.  ( EE `  N )  /\  C  e.  ( EE `  N ) )  /\  ( A 
Btwn  <. B ,  C >.  \/  B  Btwn  <. C ,  A >.  \/  C  Btwn  <. A ,  B >. ) ) )  ->  E. n  e.  NN  ( ( A  e.  ( EE `  n )  /\  B  e.  ( EE `  n
)  /\  C  e.  ( EE `  n ) )  /\  ( A 
Btwn  <. B ,  C >.  \/  B  Btwn  <. C ,  A >.  \/  C  Btwn  <. A ,  B >. ) ) )
1312expr 643 . . 3  |-  ( ( N  e.  NN  /\  ( A  e.  ( EE `  N )  /\  B  e.  ( EE `  N )  /\  C  e.  ( EE `  N
) ) )  -> 
( ( A  Btwn  <. B ,  C >.  \/  B  Btwn  <. C ,  A >.  \/  C  Btwn  <. A ,  B >. )  ->  E. n  e.  NN  ( ( A  e.  ( EE `  n
)  /\  B  e.  ( EE `  n )  /\  C  e.  ( EE `  n ) )  /\  ( A 
Btwn  <. B ,  C >.  \/  B  Btwn  <. C ,  A >.  \/  C  Btwn  <. A ,  B >. ) ) ) )
145, 13impbid2 216 . 2  |-  ( ( N  e.  NN  /\  ( A  e.  ( EE `  N )  /\  B  e.  ( EE `  N )  /\  C  e.  ( EE `  N
) ) )  -> 
( E. n  e.  NN  ( ( A  e.  ( EE `  n )  /\  B  e.  ( EE `  n
)  /\  C  e.  ( EE `  n ) )  /\  ( A 
Btwn  <. B ,  C >.  \/  B  Btwn  <. C ,  A >.  \/  C  Btwn  <. A ,  B >. ) )  <->  ( A  Btwn  <. B ,  C >.  \/  B  Btwn  <. C ,  A >.  \/  C  Btwn  <. A ,  B >. ) ) )
153, 14bitrd 268 1  |-  ( ( N  e.  NN  /\  ( A  e.  ( EE `  N )  /\  B  e.  ( EE `  N )  /\  C  e.  ( EE `  N
) ) )  -> 
( A  Colinear  <. B ,  C >. 
<->  ( A  Btwn  <. B ,  C >.  \/  B  Btwn  <. C ,  A >.  \/  C  Btwn  <. A ,  B >. ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    \/ w3o 1036    /\ w3a 1037    = wceq 1483    e. wcel 1990   E.wrex 2913   <.cop 4183   class class class wbr 4653   ` cfv 5888   NNcn 11020   EEcee 25768    Btwn cbtwn 25769    Colinear ccolin 32144
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-xp 5120  df-rel 5121  df-cnv 5122  df-iota 5851  df-fv 5896  df-oprab 6654  df-colinear 32146
This theorem is referenced by:  colinearperm1  32169  colinearperm3  32170  colineartriv1  32174  colineartriv2  32175  btwncolinear1  32176  colinearxfr  32182  lineext  32183  fscgr  32187  colinbtwnle  32225  broutsideof2  32229  lineunray  32254  lineelsb2  32255
  Copyright terms: Public domain W3C validator