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

Theorem brcolinear 28019
Description: The binary relationship 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 28018 . . . 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 1001 . . 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 463 . 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 458 . . . 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 2835 . . 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 5688 . . . . . . . 8  |-  ( n  =  N  ->  ( EE `  n )  =  ( EE `  N
) )
76eleq2d 2508 . . . . . . 7  |-  ( n  =  N  ->  ( A  e.  ( EE `  n )  <->  A  e.  ( EE `  N ) ) )
86eleq2d 2508 . . . . . . 7  |-  ( n  =  N  ->  ( B  e.  ( EE `  n )  <->  B  e.  ( EE `  N ) ) )
96eleq2d 2508 . . . . . . 7  |-  ( n  =  N  ->  ( C  e.  ( EE `  n )  <->  C  e.  ( EE `  N ) ) )
107, 8, 93anbi123d 1284 . . . . . 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 699 . . . . 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 3070 . . . 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 612 . . 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 204 . 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 253 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 184    /\ wa 369    \/ w3o 959    /\ w3a 960    = wceq 1364    e. wcel 1761   E.wrex 2714   <.cop 3880   class class class wbr 4289   ` cfv 5415   NNcn 10318   EEcee 23069    Btwn cbtwn 23070    Colinear ccolin 27997
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1713  ax-7 1733  ax-9 1765  ax-10 1780  ax-11 1785  ax-12 1797  ax-13 1948  ax-ext 2422  ax-sep 4410  ax-nul 4418  ax-pr 4528
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 961  df-3an 962  df-tru 1367  df-ex 1592  df-nf 1595  df-sb 1706  df-eu 2261  df-mo 2262  df-clab 2428  df-cleq 2434  df-clel 2437  df-nfc 2566  df-ne 2606  df-ral 2718  df-rex 2719  df-rab 2722  df-v 2972  df-dif 3328  df-un 3330  df-in 3332  df-ss 3339  df-nul 3635  df-if 3789  df-sn 3875  df-pr 3877  df-op 3881  df-uni 4089  df-br 4290  df-opab 4348  df-xp 4842  df-rel 4843  df-cnv 4844  df-iota 5378  df-fv 5423  df-oprab 6094  df-colinear 27999
This theorem is referenced by:  colinearperm1  28022  colinearperm3  28023  colineartriv1  28027  colineartriv2  28028  btwncolinear1  28029  colinearxfr  28035  lineext  28036  fscgr  28040  colinbtwnle  28078  broutsideof2  28082  lineunray  28107  lineelsb2  28108
  Copyright terms: Public domain W3C validator