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

Theorem infssuzcldc 12088
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 12086 . . 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 3264 . . . . . . 7  |-  { n  e.  ( ZZ>= `  M )  |  ps }  C_  ( ZZ>=
`  M )
72, 6eqsstri 3211 . . . . . 6  |-  S  C_  ( ZZ>= `  M )
8 uzssz 9612 . . . . . 6  |-  ( ZZ>= `  M )  C_  ZZ
97, 8sstri 3188 . . . . 5  |-  S  C_  ZZ
10 zssre 9324 . . . . 5  |-  ZZ  C_  RR
119, 10sstri 3188 . . . 4  |-  S  C_  RR
1211a1i 9 . . 3  |-  ( ph  ->  S  C_  RR )
135, 12infrenegsupex 9659 . 2  |-  ( ph  -> inf ( S ,  RR ,  <  )  =  -u sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  ) )
141, 2, 3, 4infssuzex 12086 . . . . . 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 9661 . . . . 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 8212 . . . . . . . . . 10  |-  ( w  =  u  ->  -u w  =  -u u )
1716eleq1d 2262 . . . . . . . . 9  |-  ( w  =  u  ->  ( -u w  e.  S  <->  -u u  e.  S ) )
1817elrab 2916 . . . . . . . 8  |-  ( u  e.  { w  e.  RR  |  -u w  e.  S }  <->  ( u  e.  RR  /\  -u u  e.  S ) )
199sseli 3175 . . . . . . . . . 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 8048 . . . . . . . . . 10  |-  ( ( u  e.  RR  /\  -u u  e.  S )  ->  u  e.  CC )
23 znegclb 9350 . . . . . . . . . 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 3183 . . . . . 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 9415 . . . 4  |-  ( ph  ->  sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  )  e.  {
w  e.  RR  |  -u w  e.  S }
)
30 nfrab1 2674 . . . . . 6  |-  F/_ w { w  e.  RR  |  -u w  e.  S }
31 nfcv 2336 . . . . . 6  |-  F/_ w RR
32 nfcv 2336 . . . . . 6  |-  F/_ w  <
3330, 31, 32nfsup 7051 . . . . 5  |-  F/_ w sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  )
3433nfneg 8216 . . . . . 6  |-  F/_ w -u
sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  )
3534nfel1 2347 . . . . 5  |-  F/ w -u
sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  )  e.  S
36 negeq 8212 . . . . . 6  |-  ( w  =  sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  )  -> 
-u w  =  -u sup ( { w  e.  RR  |  -u w  e.  S } ,  RR ,  <  ) )
3736eleq1d 2262 . . . . 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 2914 . . . 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 2270 1  |-  ( ph  -> inf ( S ,  RR ,  <  )  e.  S
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105  DECID wdc 835    = wceq 1364    e. wcel 2164   {crab 2476    C_ wss 3153   ` cfv 5254  (class class class)co 5918   supcsup 7041  infcinf 7042   CCcc 7870   RRcr 7871    < clt 8054   -ucneg 8191   ZZcz 9317   ZZ>=cuz 9592   ...cfz 10074
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-1cn 7965  ax-1re 7966  ax-icn 7967  ax-addcl 7968  ax-addrcl 7969  ax-mulcl 7970  ax-addcom 7972  ax-addass 7974  ax-distr 7976  ax-i2m1 7977  ax-0lt1 7978  ax-0id 7980  ax-rnegex 7981  ax-cnre 7983  ax-pre-ltirr 7984  ax-pre-ltwlin 7985  ax-pre-lttrn 7986  ax-pre-apti 7987  ax-pre-ltadd 7988
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-po 4327  df-iso 4328  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-isom 5263  df-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-sup 7043  df-inf 7044  df-pnf 8056  df-mnf 8057  df-xr 8058  df-ltxr 8059  df-le 8060  df-sub 8192  df-neg 8193  df-inn 8983  df-n0 9241  df-z 9318  df-uz 9593  df-fz 10075  df-fzo 10209
This theorem is referenced by:  zsupssdc  12091  nnmindc  12171  nninfctlemfo  12177  lcmval  12201  lcmcllem  12205  odzcllem  12380  4sqlem13m  12541  4sqlem14  12542  4sqlem17  12545  4sqlem18  12546
  Copyright terms: Public domain W3C validator