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

Theorem infssuzcldc 11943
Description: The infimum of a subset of an upper set of integers belongs to the subset. (Contributed by Jim Kingdon, 20-Jan-2022.)
Hypotheses
Ref Expression
infssuzledc.m  |-  ( ph  ->  M  e.  ZZ )
infssuzledc.s  |-  S  =  { n  e.  (
ZZ>= `  M )  |  ps }
infssuzledc.a  |-  ( ph  ->  A  e.  S )
infssuzledc.dc  |-  ( (
ph  /\  n  e.  ( M ... A ) )  -> DECID  ps )
Assertion
Ref Expression
infssuzcldc  |-  ( ph  -> inf ( S ,  RR ,  <  )  e.  S
)
Distinct variable groups:    A, n    n, M    ph, n
Allowed substitution hints:    ps( n)    S( n)

Proof of Theorem infssuzcldc
Dummy variables  y  w  x  z  u are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 infssuzledc.m . . . 4  |-  ( ph  ->  M  e.  ZZ )
2 infssuzledc.s . . . 4  |-  S  =  { n  e.  (
ZZ>= `  M )  |  ps }
3 infssuzledc.a . . . 4  |-  ( ph  ->  A  e.  S )
4 infssuzledc.dc . . . 4  |-  ( (
ph  /\  n  e.  ( M ... A ) )  -> DECID  ps )
51, 2, 3, 4infssuzex 11941 . . 3  |-  ( ph  ->  E. x  e.  RR  ( A. y  e.  S  -.  y  <  x  /\  A. y  e.  RR  (
x  <  y  ->  E. w  e.  S  w  <  y ) ) )
6 ssrab2 3240 . . . . . . 7  |-  { n  e.  ( ZZ>= `  M )  |  ps }  C_  ( ZZ>=
`  M )
72, 6eqsstri 3187 . . . . . 6  |-  S  C_  ( ZZ>= `  M )
8 uzssz 9542 . . . . . 6  |-  ( ZZ>= `  M )  C_  ZZ
97, 8sstri 3164 . . . . 5  |-  S  C_  ZZ
10 zssre 9255 . . . . 5  |-  ZZ  C_  RR
119, 10sstri 3164 . . . 4  |-  S  C_  RR
1211a1i 9 . . 3  |-  ( ph  ->  S  C_  RR )
135, 12infrenegsupex 9589 . 2  |-  ( ph  -> inf ( S ,  RR ,  <  )  =  -u sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  ) )
141, 2, 3, 4infssuzex 11941 . . . . . 6  |-  ( ph  ->  E. x  e.  RR  ( A. y  e.  S  -.  y  <  x  /\  A. y  e.  RR  (
x  <  y  ->  E. z  e.  S  z  <  y ) ) )
1514, 12infsupneg 9591 . . . . 5  |-  ( ph  ->  E. x  e.  RR  ( A. y  e.  {
w  e.  RR  |  -u w  e.  S }  -.  x  <  y  /\  A. y  e.  RR  (
y  <  x  ->  E. z  e.  { w  e.  RR  |  -u w  e.  S } y  < 
z ) ) )
16 negeq 8145 . . . . . . . . . 10  |-  ( w  =  u  ->  -u w  =  -u u )
1716eleq1d 2246 . . . . . . . . 9  |-  ( w  =  u  ->  ( -u w  e.  S  <->  -u u  e.  S ) )
1817elrab 2893 . . . . . . . 8  |-  ( u  e.  { w  e.  RR  |  -u w  e.  S }  <->  ( u  e.  RR  /\  -u u  e.  S ) )
199sseli 3151 . . . . . . . . . 10  |-  ( -u u  e.  S  ->  -u u  e.  ZZ )
2019adantl 277 . . . . . . . . 9  |-  ( ( u  e.  RR  /\  -u u  e.  S )  ->  -u u  e.  ZZ )
21 simpl 109 . . . . . . . . . . 11  |-  ( ( u  e.  RR  /\  -u u  e.  S )  ->  u  e.  RR )
2221recnd 7981 . . . . . . . . . 10  |-  ( ( u  e.  RR  /\  -u u  e.  S )  ->  u  e.  CC )
23 znegclb 9281 . . . . . . . . . 10  |-  ( u  e.  CC  ->  (
u  e.  ZZ  <->  -u u  e.  ZZ ) )
2422, 23syl 14 . . . . . . . . 9  |-  ( ( u  e.  RR  /\  -u u  e.  S )  ->  ( u  e.  ZZ  <->  -u u  e.  ZZ ) )
2520, 24mpbird 167 . . . . . . . 8  |-  ( ( u  e.  RR  /\  -u u  e.  S )  ->  u  e.  ZZ )
2618, 25sylbi 121 . . . . . . 7  |-  ( u  e.  { w  e.  RR  |  -u w  e.  S }  ->  u  e.  ZZ )
2726ssriv 3159 . . . . . 6  |-  { w  e.  RR  |  -u w  e.  S }  C_  ZZ
2827a1i 9 . . . . 5  |-  ( ph  ->  { w  e.  RR  |  -u w  e.  S }  C_  ZZ )
2915, 28suprzclex 9346 . . . 4  |-  ( ph  ->  sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  )  e.  {
w  e.  RR  |  -u w  e.  S }
)
30 nfrab1 2656 . . . . . 6  |-  F/_ w { w  e.  RR  |  -u w  e.  S }
31 nfcv 2319 . . . . . 6  |-  F/_ w RR
32 nfcv 2319 . . . . . 6  |-  F/_ w  <
3330, 31, 32nfsup 6987 . . . . 5  |-  F/_ w sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  )
3433nfneg 8149 . . . . . 6  |-  F/_ w -u
sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  )
3534nfel1 2330 . . . . 5  |-  F/ w -u
sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  )  e.  S
36 negeq 8145 . . . . . 6  |-  ( w  =  sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  )  -> 
-u w  =  -u sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  ) )
3736eleq1d 2246 . . . . 5  |-  ( w  =  sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  )  ->  ( -u w  e.  S  <->  -u sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  )  e.  S ) )
3833, 31, 35, 37elrabf 2891 . . . 4  |-  ( sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  )  e.  {
w  e.  RR  |  -u w  e.  S }  <->  ( sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  )  e.  RR  /\  -u sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  )  e.  S
) )
3929, 38sylib 122 . . 3  |-  ( ph  ->  ( sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  )  e.  RR  /\  -u sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  )  e.  S ) )
4039simprd 114 . 2  |-  ( ph  -> 
-u sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  )  e.  S
)
4113, 40eqeltrd 2254 1  |-  ( ph  -> inf ( S ,  RR ,  <  )  e.  S
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105  DECID wdc 834    = wceq 1353    e. wcel 2148   {crab 2459    C_ wss 3129   ` cfv 5214  (class class class)co 5871   supcsup 6977  infcinf 6978   CCcc 7805   RRcr 7806    < clt 7987   -ucneg 8124   ZZcz 9248   ZZ>=cuz 9523   ...cfz 10003
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4120  ax-pow 4173  ax-pr 4208  ax-un 4432  ax-setind 4535  ax-cnex 7898  ax-resscn 7899  ax-1cn 7900  ax-1re 7901  ax-icn 7902  ax-addcl 7903  ax-addrcl 7904  ax-mulcl 7905  ax-addcom 7907  ax-addass 7909  ax-distr 7911  ax-i2m1 7912  ax-0lt1 7913  ax-0id 7915  ax-rnegex 7916  ax-cnre 7918  ax-pre-ltirr 7919  ax-pre-ltwlin 7920  ax-pre-lttrn 7921  ax-pre-apti 7922  ax-pre-ltadd 7923
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rmo 2463  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-int 3845  df-iun 3888  df-br 4003  df-opab 4064  df-mpt 4065  df-id 4292  df-po 4295  df-iso 4296  df-xp 4631  df-rel 4632  df-cnv 4633  df-co 4634  df-dm 4635  df-rn 4636  df-res 4637  df-ima 4638  df-iota 5176  df-fun 5216  df-fn 5217  df-f 5218  df-f1 5219  df-fo 5220  df-f1o 5221  df-fv 5222  df-isom 5223  df-riota 5827  df-ov 5874  df-oprab 5875  df-mpo 5876  df-1st 6137  df-2nd 6138  df-sup 6979  df-inf 6980  df-pnf 7989  df-mnf 7990  df-xr 7991  df-ltxr 7992  df-le 7993  df-sub 8125  df-neg 8126  df-inn 8915  df-n0 9172  df-z 9249  df-uz 9524  df-fz 10004  df-fzo 10137
This theorem is referenced by:  zsupssdc  11946  nnmindc  12026  lcmval  12054  lcmcllem  12058  odzcllem  12233
  Copyright terms: Public domain W3C validator