ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ivthdich Unicode version

Theorem ivthdich 15754
Description: The intermediate value theorem implies real number dichotomy. Because real number dichotomy (also known as analytic LLPO) is a constructive taboo, this means we will be unable to prove the intermediate value theorem as stated here (although versions with additional conditions, such as ivthinc 15744 for strictly monotonic functions, can be proved).

The proof is via a function which we call the hover function and which is also described in Section 5.1 of [Bauer], p. 493. Consider any real number  z. We want to show that  z  <_  0  \/  0  <_  z. Because of hovercncf 15747, hovera 15748, and hoverb 15749, we are able to apply the intermediate value theorem to get a value  c such that the hover function at  c equals  z. By axltwlin 8393,  c  <  1 or  0  <  c, and that leads to  z  <_  0 by hoverlt1 15750 or 
0  <_  z by hovergt0 15751. (Contributed by Jim Kingdon and Mario Carneiro, 22-Jul-2025.)

Assertion
Ref Expression
ivthdich  |-  ( A. f ( f  e.  ( RR -cn-> RR )  ->  A. a  e.  RR  A. b  e.  RR  (
( a  <  b  /\  ( f `  a
)  <  0  /\  0  <  ( f `  b ) )  ->  E. x  e.  RR  ( a  <  x  /\  x  <  b  /\  ( f `  x
)  =  0 ) ) )  ->  A. r  e.  RR  A. s  e.  RR  ( r  <_ 
s  \/  s  <_ 
r ) )
Distinct variable groups:    a, b, f, x    s, r

Proof of Theorem ivthdich
Dummy variables  q  t  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq2 4134 . . . . . . . . . 10  |-  ( x  =  q  ->  (
a  <  x  <->  a  <  q ) )
2 breq1 4133 . . . . . . . . . 10  |-  ( x  =  q  ->  (
x  <  b  <->  q  <  b ) )
3 fveqeq2 5704 . . . . . . . . . 10  |-  ( x  =  q  ->  (
( f `  x
)  =  0  <->  (
f `  q )  =  0 ) )
41, 2, 33anbi123d 1353 . . . . . . . . 9  |-  ( x  =  q  ->  (
( a  <  x  /\  x  <  b  /\  ( f `  x
)  =  0 )  <-> 
( a  <  q  /\  q  <  b  /\  ( f `  q
)  =  0 ) ) )
54cbvrexv 2787 . . . . . . . 8  |-  ( E. x  e.  RR  (
a  <  x  /\  x  <  b  /\  (
f `  x )  =  0 )  <->  E. q  e.  RR  ( a  < 
q  /\  q  <  b  /\  ( f `  q )  =  0 ) )
65imbi2i 226 . . . . . . 7  |-  ( ( ( a  <  b  /\  ( f `  a
)  <  0  /\  0  <  ( f `  b ) )  ->  E. x  e.  RR  ( a  <  x  /\  x  <  b  /\  ( f `  x
)  =  0 ) )  <->  ( ( a  <  b  /\  (
f `  a )  <  0  /\  0  < 
( f `  b
) )  ->  E. q  e.  RR  ( a  < 
q  /\  q  <  b  /\  ( f `  q )  =  0 ) ) )
762ralbii 2558 . . . . . 6  |-  ( A. a  e.  RR  A. b  e.  RR  ( ( a  <  b  /\  (
f `  a )  <  0  /\  0  < 
( f `  b
) )  ->  E. x  e.  RR  ( a  < 
x  /\  x  <  b  /\  ( f `  x )  =  0 ) )  <->  A. a  e.  RR  A. b  e.  RR  ( ( a  <  b  /\  (
f `  a )  <  0  /\  0  < 
( f `  b
) )  ->  E. q  e.  RR  ( a  < 
q  /\  q  <  b  /\  ( f `  q )  =  0 ) ) )
87imbi2i 226 . . . . 5  |-  ( ( f  e.  ( RR
-cn-> RR )  ->  A. a  e.  RR  A. b  e.  RR  ( ( a  <  b  /\  (
f `  a )  <  0  /\  0  < 
( f `  b
) )  ->  E. x  e.  RR  ( a  < 
x  /\  x  <  b  /\  ( f `  x )  =  0 ) ) )  <->  ( f  e.  ( RR -cn-> RR )  ->  A. a  e.  RR  A. b  e.  RR  (
( a  <  b  /\  ( f `  a
)  <  0  /\  0  <  ( f `  b ) )  ->  E. q  e.  RR  ( a  <  q  /\  q  <  b  /\  ( f `  q
)  =  0 ) ) ) )
98albii 1523 . . . 4  |-  ( A. f ( f  e.  ( RR -cn-> RR )  ->  A. a  e.  RR  A. b  e.  RR  (
( a  <  b  /\  ( f `  a
)  <  0  /\  0  <  ( f `  b ) )  ->  E. x  e.  RR  ( a  <  x  /\  x  <  b  /\  ( f `  x
)  =  0 ) ) )  <->  A. f
( f  e.  ( RR -cn-> RR )  ->  A. a  e.  RR  A. b  e.  RR  ( ( a  <  b  /\  (
f `  a )  <  0  /\  0  < 
( f `  b
) )  ->  E. q  e.  RR  ( a  < 
q  /\  q  <  b  /\  ( f `  q )  =  0 ) ) ) )
10 preq1 3788 . . . . . . . . 9  |-  ( t  =  x  ->  { t ,  0 }  =  { x ,  0 } )
1110infeq1d 7352 . . . . . . . 8  |-  ( t  =  x  -> inf ( { t ,  0 } ,  RR ,  <  )  = inf ( { x ,  0 } ,  RR ,  <  ) )
12 oveq1 6092 . . . . . . . 8  |-  ( t  =  x  ->  (
t  -  1 )  =  ( x  - 
1 ) )
1311, 12preq12d 3796 . . . . . . 7  |-  ( t  =  x  ->  {inf ( { t ,  0 } ,  RR ,  <  ) ,  ( t  -  1 ) }  =  {inf ( { x ,  0 } ,  RR ,  <  ) ,  ( x  - 
1 ) } )
1413supeq1d 7327 . . . . . 6  |-  ( t  =  x  ->  sup ( {inf ( { t ,  0 } ,  RR ,  <  ) ,  ( t  -  1 ) } ,  RR ,  <  )  =  sup ( {inf ( { x ,  0 } ,  RR ,  <  ) ,  ( x  -  1 ) } ,  RR ,  <  ) )
1514cbvmptv 4227 . . . . 5  |-  ( t  e.  RR  |->  sup ( {inf ( { t ,  0 } ,  RR ,  <  ) ,  ( t  -  1 ) } ,  RR ,  <  ) )  =  ( x  e.  RR  |->  sup ( {inf ( { x ,  0 } ,  RR ,  <  ) ,  ( x  - 
1 ) } ,  RR ,  <  ) )
16 simpr 110 . . . . 5  |-  ( ( A. f ( f  e.  ( RR -cn-> RR )  ->  A. a  e.  RR  A. b  e.  RR  ( ( a  <  b  /\  (
f `  a )  <  0  /\  0  < 
( f `  b
) )  ->  E. q  e.  RR  ( a  < 
q  /\  q  <  b  /\  ( f `  q )  =  0 ) ) )  /\  z  e.  RR )  ->  z  e.  RR )
179biimpri 133 . . . . . 6  |-  ( A. f ( f  e.  ( RR -cn-> RR )  ->  A. a  e.  RR  A. b  e.  RR  (
( a  <  b  /\  ( f `  a
)  <  0  /\  0  <  ( f `  b ) )  ->  E. q  e.  RR  ( a  <  q  /\  q  <  b  /\  ( f `  q
)  =  0 ) ) )  ->  A. f
( f  e.  ( RR -cn-> RR )  ->  A. a  e.  RR  A. b  e.  RR  ( ( a  <  b  /\  (
f `  a )  <  0  /\  0  < 
( f `  b
) )  ->  E. x  e.  RR  ( a  < 
x  /\  x  <  b  /\  ( f `  x )  =  0 ) ) ) )
1817adantr 276 . . . . 5  |-  ( ( A. f ( f  e.  ( RR -cn-> RR )  ->  A. a  e.  RR  A. b  e.  RR  ( ( a  <  b  /\  (
f `  a )  <  0  /\  0  < 
( f `  b
) )  ->  E. q  e.  RR  ( a  < 
q  /\  q  <  b  /\  ( f `  q )  =  0 ) ) )  /\  z  e.  RR )  ->  A. f ( f  e.  ( RR -cn-> RR )  ->  A. a  e.  RR  A. b  e.  RR  ( ( a  <  b  /\  (
f `  a )  <  0  /\  0  < 
( f `  b
) )  ->  E. x  e.  RR  ( a  < 
x  /\  x  <  b  /\  ( f `  x )  =  0 ) ) ) )
1915, 16, 18ivthdichlem 15752 . . . 4  |-  ( ( A. f ( f  e.  ( RR -cn-> RR )  ->  A. a  e.  RR  A. b  e.  RR  ( ( a  <  b  /\  (
f `  a )  <  0  /\  0  < 
( f `  b
) )  ->  E. q  e.  RR  ( a  < 
q  /\  q  <  b  /\  ( f `  q )  =  0 ) ) )  /\  z  e.  RR )  ->  ( z  <_  0  \/  0  <_  z ) )
209, 19sylanb 284 . . 3  |-  ( ( A. f ( f  e.  ( RR -cn-> RR )  ->  A. a  e.  RR  A. b  e.  RR  ( ( a  <  b  /\  (
f `  a )  <  0  /\  0  < 
( f `  b
) )  ->  E. x  e.  RR  ( a  < 
x  /\  x  <  b  /\  ( f `  x )  =  0 ) ) )  /\  z  e.  RR )  ->  ( z  <_  0  \/  0  <_  z ) )
2120ralrimiva 2623 . 2  |-  ( A. f ( f  e.  ( RR -cn-> RR )  ->  A. a  e.  RR  A. b  e.  RR  (
( a  <  b  /\  ( f `  a
)  <  0  /\  0  <  ( f `  b ) )  ->  E. x  e.  RR  ( a  <  x  /\  x  <  b  /\  ( f `  x
)  =  0 ) ) )  ->  A. z  e.  RR  ( z  <_ 
0  \/  0  <_ 
z ) )
22 dich0 15753 . 2  |-  ( A. z  e.  RR  (
z  <_  0  \/  0  <_  z )  <->  A. r  e.  RR  A. s  e.  RR  ( r  <_ 
s  \/  s  <_ 
r ) )
2321, 22sylib 122 1  |-  ( A. f ( f  e.  ( RR -cn-> RR )  ->  A. a  e.  RR  A. b  e.  RR  (
( a  <  b  /\  ( f `  a
)  <  0  /\  0  <  ( f `  b ) )  ->  E. x  e.  RR  ( a  <  x  /\  x  <  b  /\  ( f `  x
)  =  0 ) ) )  ->  A. r  e.  RR  A. s  e.  RR  ( r  <_ 
s  \/  s  <_ 
r ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    \/ wo 720    /\ w3a 1009   A.wal 1400    = wceq 1402    e. wcel 2209   A.wral 2528   E.wrex 2529   {cpr 3710   class class class wbr 4130    |-> cmpt 4192   ` cfv 5377  (class class class)co 6085   supcsup 7322  infcinf 7323   RRcr 8178   0cc0 8179   1c1 8180    < clt 8360    <_ cle 8361    - cmin 8497   -cn->ccncf 15671
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297  ax-arch 8298  ax-caucvg 8299  ax-addf 8301
This proof depends on definitions:  df-bi 117  df-stab 843  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-isom 5386  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-map 6924  df-sup 7324  df-inf 7325  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-inn 9305  df-2 9363  df-3 9364  df-4 9365  df-n0 9564  df-z 9645  df-uz 9922  df-q 10020  df-rp 10055  df-xneg 10174  df-xadd 10175  df-ioo 10294  df-seqfrec 10885  df-exp 10976  df-cj 11607  df-re 11608  df-im 11609  df-rsqrt 11764  df-abs 11765  df-rest 13595  df-topgen 13614  df-psmet 14880  df-xmet 14881  df-met 14882  df-bl 14883  df-mopn 14884  df-top 15099  df-topon 15112  df-bases 15144  df-cn 15289  df-cnp 15290  df-tx 15354  df-cncf 15672
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator