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

Theorem infssfzledc 10690
Description: The infimum of a decidable inhabited subset of an integer range is a lower bound for that set. (Contributed by Jim Kingdon, 12-Jun-2026.)
Hypotheses
Ref Expression
infssfzledc.s  |-  S  =  { n  e.  ( M ... N )  |  ps }
infssfzledc.a  |-  ( ph  ->  A  e.  S )
infssfzledc.dc  |-  ( (
ph  /\  n  e.  ( M ... A ) )  -> DECID  ps )
Assertion
Ref Expression
infssfzledc  |-  ( ph  -> inf ( S ,  RR ,  <  )  <_  A
)
Distinct variable groups:    A, n    n, M    n, N    ph, n
Allowed substitution hints:    ps( n)    S( n)

Proof of Theorem infssfzledc
StepHypRef Expression
1 infssfzledc.s . . . 4  |-  S  =  { n  e.  ( M ... N )  |  ps }
2 elfzuz 10444 . . . . . . . 8  |-  ( n  e.  ( M ... N )  ->  n  e.  ( ZZ>= `  M )
)
32ad2antrl 494 . . . . . . 7  |-  ( (
ph  /\  ( n  e.  ( M ... N
)  /\  ps )
)  ->  n  e.  ( ZZ>= `  M )
)
4 elfzle2 10452 . . . . . . . 8  |-  ( n  e.  ( M ... N )  ->  n  <_  N )
54ad2antrl 494 . . . . . . 7  |-  ( (
ph  /\  ( n  e.  ( M ... N
)  /\  ps )
)  ->  n  <_  N )
6 simprr 537 . . . . . . 7  |-  ( (
ph  /\  ( n  e.  ( M ... N
)  /\  ps )
)  ->  ps )
73, 5, 6jca32 310 . . . . . 6  |-  ( (
ph  /\  ( n  e.  ( M ... N
)  /\  ps )
)  ->  ( n  e.  ( ZZ>= `  M )  /\  ( n  <_  N  /\  ps ) ) )
8 simprl 535 . . . . . . . 8  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  M )  /\  ( n  <_  N  /\  ps ) ) )  ->  n  e.  (
ZZ>= `  M ) )
9 simprrl 545 . . . . . . . . 9  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  M )  /\  ( n  <_  N  /\  ps ) ) )  ->  n  <_  N
)
10 eluzelz 9950 . . . . . . . . . . 11  |-  ( n  e.  ( ZZ>= `  M
)  ->  n  e.  ZZ )
1110adantr 276 . . . . . . . . . 10  |-  ( ( n  e.  ( ZZ>= `  M )  /\  (
n  <_  N  /\  ps ) )  ->  n  e.  ZZ )
12 infssfzledc.a . . . . . . . . . . . . 13  |-  ( ph  ->  A  e.  S )
131eleq2i 2305 . . . . . . . . . . . . . 14  |-  ( A  e.  S  <->  A  e.  { n  e.  ( M ... N )  |  ps } )
14 nfcv 2392 . . . . . . . . . . . . . . 15  |-  F/_ n
( M ... N
)
1514elrabsf 3090 . . . . . . . . . . . . . 14  |-  ( A  e.  { n  e.  ( M ... N
)  |  ps }  <->  ( A  e.  ( M ... N )  /\  [. A  /  n ]. ps ) )
1613, 15bitri 184 . . . . . . . . . . . . 13  |-  ( A  e.  S  <->  ( A  e.  ( M ... N
)  /\  [. A  /  n ]. ps ) )
1712, 16sylib 122 . . . . . . . . . . . 12  |-  ( ph  ->  ( A  e.  ( M ... N )  /\  [. A  /  n ]. ps ) )
1817simpld 112 . . . . . . . . . . 11  |-  ( ph  ->  A  e.  ( M ... N ) )
19 elfzel2 10446 . . . . . . . . . . 11  |-  ( A  e.  ( M ... N )  ->  N  e.  ZZ )
2018, 19syl 14 . . . . . . . . . 10  |-  ( ph  ->  N  e.  ZZ )
21 eluz 9954 . . . . . . . . . 10  |-  ( ( n  e.  ZZ  /\  N  e.  ZZ )  ->  ( N  e.  (
ZZ>= `  n )  <->  n  <_  N ) )
2211, 20, 21syl2anr 290 . . . . . . . . 9  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  M )  /\  ( n  <_  N  /\  ps ) ) )  ->  ( N  e.  ( ZZ>= `  n )  <->  n  <_  N ) )
239, 22mpbird 167 . . . . . . . 8  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  M )  /\  ( n  <_  N  /\  ps ) ) )  ->  N  e.  (
ZZ>= `  n ) )
24 elfzuzb 10442 . . . . . . . 8  |-  ( n  e.  ( M ... N )  <->  ( n  e.  ( ZZ>= `  M )  /\  N  e.  ( ZZ>=
`  n ) ) )
258, 23, 24sylanbrc 421 . . . . . . 7  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  M )  /\  ( n  <_  N  /\  ps ) ) )  ->  n  e.  ( M ... N ) )
26 simprrr 546 . . . . . . 7  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  M )  /\  ( n  <_  N  /\  ps ) ) )  ->  ps )
2725, 26jca 306 . . . . . 6  |-  ( (
ph  /\  ( n  e.  ( ZZ>= `  M )  /\  ( n  <_  N  /\  ps ) ) )  ->  ( n  e.  ( M ... N
)  /\  ps )
)
287, 27impbida 604 . . . . 5  |-  ( ph  ->  ( ( n  e.  ( M ... N
)  /\  ps )  <->  ( n  e.  ( ZZ>= `  M )  /\  (
n  <_  N  /\  ps ) ) ) )
2928rabbidva2 2805 . . . 4  |-  ( ph  ->  { n  e.  ( M ... N )  |  ps }  =  { n  e.  ( ZZ>=
`  M )  |  ( n  <_  N  /\  ps ) } )
301, 29eqtrid 2283 . . 3  |-  ( ph  ->  S  =  { n  e.  ( ZZ>= `  M )  |  ( n  <_  N  /\  ps ) } )
3130infeq1d 7362 . 2  |-  ( ph  -> inf ( S ,  RR ,  <  )  = inf ( { n  e.  ( ZZ>=
`  M )  |  ( n  <_  N  /\  ps ) } ,  RR ,  <  ) )
32 elfzel1 10447 . . . 4  |-  ( A  e.  ( M ... N )  ->  M  e.  ZZ )
3318, 32syl 14 . . 3  |-  ( ph  ->  M  e.  ZZ )
34 eqid 2238 . . 3  |-  { n  e.  ( ZZ>= `  M )  |  ( n  <_  N  /\  ps ) }  =  { n  e.  ( ZZ>= `  M )  |  ( n  <_  N  /\  ps ) }
3512, 30eleqtrd 2317 . . 3  |-  ( ph  ->  A  e.  { n  e.  ( ZZ>= `  M )  |  ( n  <_  N  /\  ps ) } )
36 elfzelz 10448 . . . . 5  |-  ( n  e.  ( M ... A )  ->  n  e.  ZZ )
37 zdcle 9734 . . . . 5  |-  ( ( n  e.  ZZ  /\  N  e.  ZZ )  -> DECID  n  <_  N )
3836, 20, 37syl2anr 290 . . . 4  |-  ( (
ph  /\  n  e.  ( M ... A ) )  -> DECID  n  <_  N )
39 infssfzledc.dc . . . 4  |-  ( (
ph  /\  n  e.  ( M ... A ) )  -> DECID  ps )
4038, 39dcand 945 . . 3  |-  ( (
ph  /\  n  e.  ( M ... A ) )  -> DECID  ( n  <_  N  /\  ps ) )
4133, 34, 35, 40infssuzledc 10687 . 2  |-  ( ph  -> inf ( { n  e.  ( ZZ>= `  M )  |  ( n  <_  N  /\  ps ) } ,  RR ,  <  )  <_  A )
4231, 41eqbrtrd 4153 1  |-  ( ph  -> inf ( S ,  RR ,  <  )  <_  A
)
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105  DECID wdc 846    = wceq 1402    e. wcel 2209   {crab 2532   [.wsbc 3051   class class class wbr 4131   ` cfv 5383  (class class class)co 6091  infcinf 7333   RRcr 8188    < clt 8370    <_ cle 8371   ZZcz 9657   ZZ>=cuz 9940   ...cfz 10431
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-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8280  ax-resscn 8281  ax-1cn 8282  ax-1re 8283  ax-icn 8284  ax-addcl 8285  ax-addrcl 8286  ax-mulcl 8287  ax-addcom 8289  ax-addass 8291  ax-distr 8293  ax-i2m1 8294  ax-0lt1 8295  ax-0id 8297  ax-rnegex 8298  ax-cnre 8300  ax-pre-ltirr 8301  ax-pre-ltwlin 8302  ax-pre-lttrn 8303  ax-pre-apti 8304  ax-pre-ltadd 8305
This proof depends on definitions:  df-bi 117  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-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5343  df-fun 5385  df-fn 5386  df-f 5387  df-fv 5391  df-riota 6044  df-ov 6094  df-oprab 6095  df-mpo 6096  df-1st 6381  df-2nd 6382  df-sup 7334  df-inf 7335  df-pnf 8372  df-mnf 8373  df-xr 8374  df-ltxr 8375  df-le 8376  df-sub 8510  df-neg 8511  df-inn 9318  df-n0 9579  df-z 9658  df-uz 9941  df-fz 10432  df-fzo 10570
This theorem is used by:  ballotfilemsle  13309
  Copyright terms: Public domain W3C validator