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

Theorem brcolinear 29272
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 29271 . . . 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 1009 . . 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 466 . 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 461 . . . 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 2945 . . 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 5857 . . . . . . . 8  |-  ( n  =  N  ->  ( EE `  n )  =  ( EE `  N
) )
76eleq2d 2530 . . . . . . 7  |-  ( n  =  N  ->  ( A  e.  ( EE `  n )  <->  A  e.  ( EE `  N ) ) )
86eleq2d 2530 . . . . . . 7  |-  ( n  =  N  ->  ( B  e.  ( EE `  n )  <->  B  e.  ( EE `  N ) ) )
96eleq2d 2530 . . . . . . 7  |-  ( n  =  N  ->  ( C  e.  ( EE `  n )  <->  C  e.  ( EE `  N ) ) )
107, 8, 93anbi123d 1294 . . . . . 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 704 . . . . 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 3207 . . . 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 615 . . 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 967    /\ w3a 968    = wceq 1374    e. wcel 1762   E.wrex 2808   <.cop 4026   class class class wbr 4440   ` cfv 5579   NNcn 10525   EEcee 23860    Btwn cbtwn 23861    Colinear ccolin 29250
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 1714  ax-7 1734  ax-9 1766  ax-10 1781  ax-11 1786  ax-12 1798  ax-13 1961  ax-ext 2438  ax-sep 4561  ax-nul 4569  ax-pr 4679
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 969  df-3an 970  df-tru 1377  df-ex 1592  df-nf 1595  df-sb 1707  df-eu 2272  df-mo 2273  df-clab 2446  df-cleq 2452  df-clel 2455  df-nfc 2610  df-ne 2657  df-ral 2812  df-rex 2813  df-rab 2816  df-v 3108  df-dif 3472  df-un 3474  df-in 3476  df-ss 3483  df-nul 3779  df-if 3933  df-sn 4021  df-pr 4023  df-op 4027  df-uni 4239  df-br 4441  df-opab 4499  df-xp 4998  df-rel 4999  df-cnv 5000  df-iota 5542  df-fv 5587  df-oprab 6279  df-colinear 29252
This theorem is referenced by:  colinearperm1  29275  colinearperm3  29276  colineartriv1  29280  colineartriv2  29281  btwncolinear1  29282  colinearxfr  29288  lineext  29289  fscgr  29293  colinbtwnle  29331  broutsideof2  29335  lineunray  29360  lineelsb2  29361
  Copyright terms: Public domain W3C validator