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

Theorem axbtwnid 24911
Description: Points are indivisible. That is, if  A lies between  B and  B, then  A  =  B. Axiom A6 of [Schwabhauser] p. 11. (Contributed by Scott Fenton, 3-Jun-2013.)
Assertion
Ref Expression
axbtwnid  |-  ( ( N  e.  NN  /\  A  e.  ( EE `  N )  /\  B  e.  ( EE `  N
) )  ->  ( A  Btwn  <. B ,  B >.  ->  A  =  B ) )

Proof of Theorem axbtwnid
Dummy variables  t 
i are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simp2 1006 . . 3  |-  ( ( N  e.  NN  /\  A  e.  ( EE `  N )  /\  B  e.  ( EE `  N
) )  ->  A  e.  ( EE `  N
) )
2 simp3 1007 . . 3  |-  ( ( N  e.  NN  /\  A  e.  ( EE `  N )  /\  B  e.  ( EE `  N
) )  ->  B  e.  ( EE `  N
) )
3 brbtwn 24871 . . 3  |-  ( ( A  e.  ( EE
`  N )  /\  B  e.  ( EE `  N )  /\  B  e.  ( EE `  N
) )  ->  ( A  Btwn  <. B ,  B >.  <->  E. t  e.  (
0 [,] 1 ) A. i  e.  ( 1 ... N ) ( A `  i
)  =  ( ( ( 1  -  t
)  x.  ( B `
 i ) )  +  ( t  x.  ( B `  i
) ) ) ) )
41, 2, 2, 3syl3anc 1264 . 2  |-  ( ( N  e.  NN  /\  A  e.  ( EE `  N )  /\  B  e.  ( EE `  N
) )  ->  ( A  Btwn  <. B ,  B >.  <->  E. t  e.  (
0 [,] 1 ) A. i  e.  ( 1 ... N ) ( A `  i
)  =  ( ( ( 1  -  t
)  x.  ( B `
 i ) )  +  ( t  x.  ( B `  i
) ) ) ) )
5 0re 9594 . . . . . . 7  |-  0  e.  RR
6 1re 9593 . . . . . . 7  |-  1  e.  RR
75, 6elicc2i 11651 . . . . . 6  |-  ( t  e.  ( 0 [,] 1 )  <->  ( t  e.  RR  /\  0  <_ 
t  /\  t  <_  1 ) )
87simp1bi 1020 . . . . 5  |-  ( t  e.  ( 0 [,] 1 )  ->  t  e.  RR )
98recnd 9620 . . . 4  |-  ( t  e.  ( 0 [,] 1 )  ->  t  e.  CC )
10 eqeefv 24875 . . . . . . . 8  |-  ( ( A  e.  ( EE
`  N )  /\  B  e.  ( EE `  N ) )  -> 
( A  =  B  <->  A. i  e.  (
1 ... N ) ( A `  i )  =  ( B `  i ) ) )
11103adant1 1023 . . . . . . 7  |-  ( ( N  e.  NN  /\  A  e.  ( EE `  N )  /\  B  e.  ( EE `  N
) )  ->  ( A  =  B  <->  A. i  e.  ( 1 ... N
) ( A `  i )  =  ( B `  i ) ) )
1211adantr 466 . . . . . 6  |-  ( ( ( N  e.  NN  /\  A  e.  ( EE
`  N )  /\  B  e.  ( EE `  N ) )  /\  t  e.  CC )  ->  ( A  =  B  <->  A. i  e.  (
1 ... N ) ( A `  i )  =  ( B `  i ) ) )
13 ax-1cn 9548 . . . . . . . . . . . 12  |-  1  e.  CC
14 npcan 9835 . . . . . . . . . . . 12  |-  ( ( 1  e.  CC  /\  t  e.  CC )  ->  ( ( 1  -  t )  +  t )  =  1 )
1513, 14mpan 674 . . . . . . . . . . 11  |-  ( t  e.  CC  ->  (
( 1  -  t
)  +  t )  =  1 )
1615ad2antlr 731 . . . . . . . . . 10  |-  ( ( ( ( N  e.  NN  /\  A  e.  ( EE `  N
)  /\  B  e.  ( EE `  N ) )  /\  t  e.  CC )  /\  i  e.  ( 1 ... N
) )  ->  (
( 1  -  t
)  +  t )  =  1 )
1716oveq1d 6264 . . . . . . . . 9  |-  ( ( ( ( N  e.  NN  /\  A  e.  ( EE `  N
)  /\  B  e.  ( EE `  N ) )  /\  t  e.  CC )  /\  i  e.  ( 1 ... N
) )  ->  (
( ( 1  -  t )  +  t )  x.  ( B `
 i ) )  =  ( 1  x.  ( B `  i
) ) )
18 subcl 9825 . . . . . . . . . . . 12  |-  ( ( 1  e.  CC  /\  t  e.  CC )  ->  ( 1  -  t
)  e.  CC )
1913, 18mpan 674 . . . . . . . . . . 11  |-  ( t  e.  CC  ->  (
1  -  t )  e.  CC )
2019ad2antlr 731 . . . . . . . . . 10  |-  ( ( ( ( N  e.  NN  /\  A  e.  ( EE `  N
)  /\  B  e.  ( EE `  N ) )  /\  t  e.  CC )  /\  i  e.  ( 1 ... N
) )  ->  (
1  -  t )  e.  CC )
21 simplr 760 . . . . . . . . . 10  |-  ( ( ( ( N  e.  NN  /\  A  e.  ( EE `  N
)  /\  B  e.  ( EE `  N ) )  /\  t  e.  CC )  /\  i  e.  ( 1 ... N
) )  ->  t  e.  CC )
22 simpll3 1046 . . . . . . . . . . 11  |-  ( ( ( ( N  e.  NN  /\  A  e.  ( EE `  N
)  /\  B  e.  ( EE `  N ) )  /\  t  e.  CC )  /\  i  e.  ( 1 ... N
) )  ->  B  e.  ( EE `  N
) )
23 fveecn 24874 . . . . . . . . . . 11  |-  ( ( B  e.  ( EE
`  N )  /\  i  e.  ( 1 ... N ) )  ->  ( B `  i )  e.  CC )
2422, 23sylancom 671 . . . . . . . . . 10  |-  ( ( ( ( N  e.  NN  /\  A  e.  ( EE `  N
)  /\  B  e.  ( EE `  N ) )  /\  t  e.  CC )  /\  i  e.  ( 1 ... N
) )  ->  ( B `  i )  e.  CC )
2520, 21, 24adddird 9619 . . . . . . . . 9  |-  ( ( ( ( N  e.  NN  /\  A  e.  ( EE `  N
)  /\  B  e.  ( EE `  N ) )  /\  t  e.  CC )  /\  i  e.  ( 1 ... N
) )  ->  (
( ( 1  -  t )  +  t )  x.  ( B `
 i ) )  =  ( ( ( 1  -  t )  x.  ( B `  i ) )  +  ( t  x.  ( B `  i )
) ) )
2624mulid2d 9612 . . . . . . . . 9  |-  ( ( ( ( N  e.  NN  /\  A  e.  ( EE `  N
)  /\  B  e.  ( EE `  N ) )  /\  t  e.  CC )  /\  i  e.  ( 1 ... N
) )  ->  (
1  x.  ( B `
 i ) )  =  ( B `  i ) )
2717, 25, 263eqtr3rd 2471 . . . . . . . 8  |-  ( ( ( ( N  e.  NN  /\  A  e.  ( EE `  N
)  /\  B  e.  ( EE `  N ) )  /\  t  e.  CC )  /\  i  e.  ( 1 ... N
) )  ->  ( B `  i )  =  ( ( ( 1  -  t )  x.  ( B `  i ) )  +  ( t  x.  ( B `  i )
) ) )
2827eqeq2d 2438 . . . . . . 7  |-  ( ( ( ( N  e.  NN  /\  A  e.  ( EE `  N
)  /\  B  e.  ( EE `  N ) )  /\  t  e.  CC )  /\  i  e.  ( 1 ... N
) )  ->  (
( A `  i
)  =  ( B `
 i )  <->  ( A `  i )  =  ( ( ( 1  -  t )  x.  ( B `  i )
)  +  ( t  x.  ( B `  i ) ) ) ) )
2928ralbidva 2801 . . . . . 6  |-  ( ( ( N  e.  NN  /\  A  e.  ( EE
`  N )  /\  B  e.  ( EE `  N ) )  /\  t  e.  CC )  ->  ( A. i  e.  ( 1 ... N
) ( A `  i )  =  ( B `  i )  <->  A. i  e.  (
1 ... N ) ( A `  i )  =  ( ( ( 1  -  t )  x.  ( B `  i ) )  +  ( t  x.  ( B `  i )
) ) ) )
3012, 29bitrd 256 . . . . 5  |-  ( ( ( N  e.  NN  /\  A  e.  ( EE
`  N )  /\  B  e.  ( EE `  N ) )  /\  t  e.  CC )  ->  ( A  =  B  <->  A. i  e.  (
1 ... N ) ( A `  i )  =  ( ( ( 1  -  t )  x.  ( B `  i ) )  +  ( t  x.  ( B `  i )
) ) ) )
3130biimprd 226 . . . 4  |-  ( ( ( N  e.  NN  /\  A  e.  ( EE
`  N )  /\  B  e.  ( EE `  N ) )  /\  t  e.  CC )  ->  ( A. i  e.  ( 1 ... N
) ( A `  i )  =  ( ( ( 1  -  t )  x.  ( B `  i )
)  +  ( t  x.  ( B `  i ) ) )  ->  A  =  B ) )
329, 31sylan2 476 . . 3  |-  ( ( ( N  e.  NN  /\  A  e.  ( EE
`  N )  /\  B  e.  ( EE `  N ) )  /\  t  e.  ( 0 [,] 1 ) )  ->  ( A. i  e.  ( 1 ... N
) ( A `  i )  =  ( ( ( 1  -  t )  x.  ( B `  i )
)  +  ( t  x.  ( B `  i ) ) )  ->  A  =  B ) )
3332rexlimdva 2856 . 2  |-  ( ( N  e.  NN  /\  A  e.  ( EE `  N )  /\  B  e.  ( EE `  N
) )  ->  ( E. t  e.  (
0 [,] 1 ) A. i  e.  ( 1 ... N ) ( A `  i
)  =  ( ( ( 1  -  t
)  x.  ( B `
 i ) )  +  ( t  x.  ( B `  i
) ) )  ->  A  =  B )
)
344, 33sylbid 218 1  |-  ( ( N  e.  NN  /\  A  e.  ( EE `  N )  /\  B  e.  ( EE `  N
) )  ->  ( A  Btwn  <. B ,  B >.  ->  A  =  B ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 187    /\ wa 370    /\ w3a 982    = wceq 1437    e. wcel 1872   A.wral 2714   E.wrex 2715   <.cop 3947   class class class wbr 4366   ` cfv 5544  (class class class)co 6249   CCcc 9488   RRcr 9489   0cc0 9490   1c1 9491    + caddc 9493    x. cmul 9495    <_ cle 9627    - cmin 9811   NNcn 10560   [,]cicc 11589   ...cfz 11735   EEcee 24860    Btwn cbtwn 24861
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1663  ax-4 1676  ax-5 1752  ax-6 1798  ax-7 1843  ax-8 1874  ax-9 1876  ax-10 1891  ax-11 1896  ax-12 1909  ax-13 2063  ax-ext 2408  ax-sep 4489  ax-nul 4498  ax-pow 4545  ax-pr 4603  ax-un 6541  ax-cnex 9546  ax-resscn 9547  ax-1cn 9548  ax-icn 9549  ax-addcl 9550  ax-addrcl 9551  ax-mulcl 9552  ax-mulrcl 9553  ax-mulcom 9554  ax-addass 9555  ax-mulass 9556  ax-distr 9557  ax-i2m1 9558  ax-1ne0 9559  ax-1rid 9560  ax-rnegex 9561  ax-rrecex 9562  ax-cnre 9563  ax-pre-lttri 9564  ax-pre-lttrn 9565  ax-pre-ltadd 9566  ax-pre-mulgt0 9567
This theorem depends on definitions:  df-bi 188  df-or 371  df-an 372  df-3or 983  df-3an 984  df-tru 1440  df-ex 1658  df-nf 1662  df-sb 1791  df-eu 2280  df-mo 2281  df-clab 2415  df-cleq 2421  df-clel 2424  df-nfc 2558  df-ne 2601  df-nel 2602  df-ral 2719  df-rex 2720  df-reu 2721  df-rab 2723  df-v 3024  df-sbc 3243  df-csb 3339  df-dif 3382  df-un 3384  df-in 3386  df-ss 3393  df-pss 3395  df-nul 3705  df-if 3855  df-pw 3926  df-sn 3942  df-pr 3944  df-tp 3946  df-op 3948  df-uni 4163  df-iun 4244  df-br 4367  df-opab 4426  df-mpt 4427  df-tr 4462  df-eprel 4707  df-id 4711  df-po 4717  df-so 4718  df-fr 4755  df-we 4757  df-xp 4802  df-rel 4803  df-cnv 4804  df-co 4805  df-dm 4806  df-rn 4807  df-res 4808  df-ima 4809  df-pred 5342  df-ord 5388  df-on 5389  df-lim 5390  df-suc 5391  df-iota 5508  df-fun 5546  df-fn 5547  df-f 5548  df-f1 5549  df-fo 5550  df-f1o 5551  df-fv 5552  df-riota 6211  df-ov 6252  df-oprab 6253  df-mpt2 6254  df-om 6651  df-1st 6751  df-2nd 6752  df-wrecs 6983  df-recs 7045  df-rdg 7083  df-er 7318  df-map 7429  df-en 7525  df-dom 7526  df-sdom 7527  df-pnf 9628  df-mnf 9629  df-xr 9630  df-ltxr 9631  df-le 9632  df-sub 9813  df-neg 9814  df-nn 10561  df-z 10889  df-uz 11111  df-icc 11593  df-fz 11736  df-ee 24863  df-btwn 24864
This theorem is referenced by:  eengtrkg  24957  btwncomim  30729  btwnswapid  30733  btwnintr  30735  btwnexch3  30736  ifscgr  30760  idinside  30800  btwnconn1lem12  30814  outsideofrflx  30843
  Copyright terms: Public domain W3C validator