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

Theorem nninfdclemcl 12377
Description: Lemma for nninfdc 12382. (Contributed by Jim Kingdon, 25-Sep-2024.)
Hypotheses
Ref Expression
nninfdclemf.a  |-  ( ph  ->  A  C_  NN )
nninfdclemf.dc  |-  ( ph  ->  A. x  e.  NN DECID  x  e.  A )
nninfdclemf.nb  |-  ( ph  ->  A. m  e.  NN  E. n  e.  A  m  <  n )
nninfdclemcl.p  |-  ( ph  ->  P  e.  A )
nninfdclemcl.q  |-  ( ph  ->  Q  e.  A )
Assertion
Ref Expression
nninfdclemcl  |-  ( ph  ->  ( P ( y  e.  NN ,  z  e.  NN  |-> inf ( ( A  i^i  ( ZZ>= `  ( y  +  1 ) ) ) ,  RR ,  <  )
) Q )  e.  A )
Distinct variable groups:    x, A    y, A, z    A, m, n   
x, P    P, m, n    y, P, z    y, Q, z    m, n
Allowed substitution hints:    ph( x, y, z, m, n)    Q( x, m, n)

Proof of Theorem nninfdclemcl
Dummy variables  r  s  t are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 nninfdclemf.a . . . 4  |-  ( ph  ->  A  C_  NN )
2 nninfdclemcl.p . . . 4  |-  ( ph  ->  P  e.  A )
31, 2sseldd 3142 . . 3  |-  ( ph  ->  P  e.  NN )
4 nninfdclemcl.q . . . 4  |-  ( ph  ->  Q  e.  A )
51, 4sseldd 3142 . . 3  |-  ( ph  ->  Q  e.  NN )
6 inss1 3341 . . . . . 6  |-  ( A  i^i  ( ZZ>= `  ( P  +  1 ) ) )  C_  A
76, 1sstrid 3152 . . . . 5  |-  ( ph  ->  ( A  i^i  ( ZZ>=
`  ( P  + 
1 ) ) ) 
C_  NN )
8 eleq1w 2226 . . . . . . . . . . 11  |-  ( x  =  s  ->  (
x  e.  A  <->  s  e.  A ) )
98dcbid 828 . . . . . . . . . 10  |-  ( x  =  s  ->  (DECID  x  e.  A  <-> DECID  s  e.  A )
)
10 nninfdclemf.dc . . . . . . . . . . 11  |-  ( ph  ->  A. x  e.  NN DECID  x  e.  A )
1110adantr 274 . . . . . . . . . 10  |-  ( (
ph  /\  s  e.  NN )  ->  A. x  e.  NN DECID  x  e.  A )
12 simpr 109 . . . . . . . . . 10  |-  ( (
ph  /\  s  e.  NN )  ->  s  e.  NN )
139, 11, 12rspcdva 2834 . . . . . . . . 9  |-  ( (
ph  /\  s  e.  NN )  -> DECID  s  e.  A
)
143adantr 274 . . . . . . . . . . . 12  |-  ( (
ph  /\  s  e.  NN )  ->  P  e.  NN )
1514nnzd 9308 . . . . . . . . . . 11  |-  ( (
ph  /\  s  e.  NN )  ->  P  e.  ZZ )
1615peano2zd 9312 . . . . . . . . . 10  |-  ( (
ph  /\  s  e.  NN )  ->  ( P  +  1 )  e.  ZZ )
1712nnzd 9308 . . . . . . . . . 10  |-  ( (
ph  /\  s  e.  NN )  ->  s  e.  ZZ )
18 eluzdc 9544 . . . . . . . . . 10  |-  ( ( ( P  +  1 )  e.  ZZ  /\  s  e.  ZZ )  -> DECID  s  e.  ( ZZ>= `  ( P  +  1 ) ) )
1916, 17, 18syl2anc 409 . . . . . . . . 9  |-  ( (
ph  /\  s  e.  NN )  -> DECID  s  e.  ( ZZ>=
`  ( P  + 
1 ) ) )
20 dcan2 924 . . . . . . . . 9  |-  (DECID  s  e.  A  ->  (DECID  s  e.  ( ZZ>= `  ( P  +  1 ) )  -> DECID 
( s  e.  A  /\  s  e.  ( ZZ>=
`  ( P  + 
1 ) ) ) ) )
2113, 19, 20sylc 62 . . . . . . . 8  |-  ( (
ph  /\  s  e.  NN )  -> DECID  ( s  e.  A  /\  s  e.  ( ZZ>=
`  ( P  + 
1 ) ) ) )
22 elin 3304 . . . . . . . . 9  |-  ( s  e.  ( A  i^i  ( ZZ>= `  ( P  +  1 ) ) )  <->  ( s  e.  A  /\  s  e.  ( ZZ>= `  ( P  +  1 ) ) ) )
2322dcbii 830 . . . . . . . 8  |-  (DECID  s  e.  ( A  i^i  ( ZZ>=
`  ( P  + 
1 ) ) )  <-> DECID  (
s  e.  A  /\  s  e.  ( ZZ>= `  ( P  +  1
) ) ) )
2421, 23sylibr 133 . . . . . . 7  |-  ( (
ph  /\  s  e.  NN )  -> DECID  s  e.  ( A  i^i  ( ZZ>= `  ( P  +  1 ) ) ) )
2524ralrimiva 2538 . . . . . 6  |-  ( ph  ->  A. s  e.  NN DECID  s  e.  ( A  i^i  ( ZZ>=
`  ( P  + 
1 ) ) ) )
26 eleq1w 2226 . . . . . . . 8  |-  ( s  =  x  ->  (
s  e.  ( A  i^i  ( ZZ>= `  ( P  +  1 ) ) )  <->  x  e.  ( A  i^i  ( ZZ>=
`  ( P  + 
1 ) ) ) ) )
2726dcbid 828 . . . . . . 7  |-  ( s  =  x  ->  (DECID  s  e.  ( A  i^i  ( ZZ>=
`  ( P  + 
1 ) ) )  <-> DECID  x  e.  ( A  i^i  ( ZZ>=
`  ( P  + 
1 ) ) ) ) )
2827cbvralv 2691 . . . . . 6  |-  ( A. s  e.  NN DECID  s  e.  ( A  i^i  ( ZZ>= `  ( P  +  1 ) ) )  <->  A. x  e.  NN DECID  x  e.  ( A  i^i  ( ZZ>= `  ( P  +  1 ) ) ) )
2925, 28sylib 121 . . . . 5  |-  ( ph  ->  A. x  e.  NN DECID  x  e.  ( A  i^i  ( ZZ>=
`  ( P  + 
1 ) ) ) )
30 breq1 3984 . . . . . . . . 9  |-  ( m  =  P  ->  (
m  <  n  <->  P  <  n ) )
3130rexbidv 2466 . . . . . . . 8  |-  ( m  =  P  ->  ( E. n  e.  A  m  <  n  <->  E. n  e.  A  P  <  n ) )
32 nninfdclemf.nb . . . . . . . 8  |-  ( ph  ->  A. m  e.  NN  E. n  e.  A  m  <  n )
3331, 32, 3rspcdva 2834 . . . . . . 7  |-  ( ph  ->  E. n  e.  A  P  <  n )
34 breq2 3985 . . . . . . . 8  |-  ( n  =  t  ->  ( P  <  n  <->  P  <  t ) )
3534cbvrexv 2692 . . . . . . 7  |-  ( E. n  e.  A  P  <  n  <->  E. t  e.  A  P  <  t )
3633, 35sylib 121 . . . . . 6  |-  ( ph  ->  E. t  e.  A  P  <  t )
37 simprl 521 . . . . . . . 8  |-  ( (
ph  /\  ( t  e.  A  /\  P  < 
t ) )  -> 
t  e.  A )
383nnzd 9308 . . . . . . . . . . 11  |-  ( ph  ->  P  e.  ZZ )
3938peano2zd 9312 . . . . . . . . . 10  |-  ( ph  ->  ( P  +  1 )  e.  ZZ )
4039adantr 274 . . . . . . . . 9  |-  ( (
ph  /\  ( t  e.  A  /\  P  < 
t ) )  -> 
( P  +  1 )  e.  ZZ )
411adantr 274 . . . . . . . . . . 11  |-  ( (
ph  /\  ( t  e.  A  /\  P  < 
t ) )  ->  A  C_  NN )
4241, 37sseldd 3142 . . . . . . . . . 10  |-  ( (
ph  /\  ( t  e.  A  /\  P  < 
t ) )  -> 
t  e.  NN )
4342nnzd 9308 . . . . . . . . 9  |-  ( (
ph  /\  ( t  e.  A  /\  P  < 
t ) )  -> 
t  e.  ZZ )
44 simprr 522 . . . . . . . . . 10  |-  ( (
ph  /\  ( t  e.  A  /\  P  < 
t ) )  ->  P  <  t )
453adantr 274 . . . . . . . . . . 11  |-  ( (
ph  /\  ( t  e.  A  /\  P  < 
t ) )  ->  P  e.  NN )
46 nnltp1le 9247 . . . . . . . . . . 11  |-  ( ( P  e.  NN  /\  t  e.  NN )  ->  ( P  <  t  <->  ( P  +  1 )  <_  t ) )
4745, 42, 46syl2anc 409 . . . . . . . . . 10  |-  ( (
ph  /\  ( t  e.  A  /\  P  < 
t ) )  -> 
( P  <  t  <->  ( P  +  1 )  <_  t ) )
4844, 47mpbid 146 . . . . . . . . 9  |-  ( (
ph  /\  ( t  e.  A  /\  P  < 
t ) )  -> 
( P  +  1 )  <_  t )
49 eluz2 9468 . . . . . . . . 9  |-  ( t  e.  ( ZZ>= `  ( P  +  1 ) )  <->  ( ( P  +  1 )  e.  ZZ  /\  t  e.  ZZ  /\  ( P  +  1 )  <_ 
t ) )
5040, 43, 48, 49syl3anbrc 1171 . . . . . . . 8  |-  ( (
ph  /\  ( t  e.  A  /\  P  < 
t ) )  -> 
t  e.  ( ZZ>= `  ( P  +  1
) ) )
5137, 50elind 3306 . . . . . . 7  |-  ( (
ph  /\  ( t  e.  A  /\  P  < 
t ) )  -> 
t  e.  ( A  i^i  ( ZZ>= `  ( P  +  1 ) ) ) )
52 elex2 2741 . . . . . . 7  |-  ( t  e.  ( A  i^i  ( ZZ>= `  ( P  +  1 ) ) )  ->  E. r 
r  e.  ( A  i^i  ( ZZ>= `  ( P  +  1 ) ) ) )
5351, 52syl 14 . . . . . 6  |-  ( (
ph  /\  ( t  e.  A  /\  P  < 
t ) )  ->  E. r  r  e.  ( A  i^i  ( ZZ>=
`  ( P  + 
1 ) ) ) )
5436, 53rexlimddv 2587 . . . . 5  |-  ( ph  ->  E. r  r  e.  ( A  i^i  ( ZZ>=
`  ( P  + 
1 ) ) ) )
55 nnmindc 11963 . . . . 5  |-  ( ( ( A  i^i  ( ZZ>=
`  ( P  + 
1 ) ) ) 
C_  NN  /\  A. x  e.  NN DECID  x  e.  ( A  i^i  ( ZZ>= `  ( P  +  1 ) ) )  /\  E. r  r  e.  ( A  i^i  ( ZZ>= `  ( P  +  1 ) ) ) )  -> inf ( ( A  i^i  ( ZZ>= `  ( P  +  1 ) ) ) ,  RR ,  <  )  e.  ( A  i^i  ( ZZ>= `  ( P  +  1 ) ) ) )
567, 29, 54, 55syl3anc 1228 . . . 4  |-  ( ph  -> inf ( ( A  i^i  ( ZZ>= `  ( P  +  1 ) ) ) ,  RR ,  <  )  e.  ( A  i^i  ( ZZ>= `  ( P  +  1 ) ) ) )
5756elin1d 3310 . . 3  |-  ( ph  -> inf ( ( A  i^i  ( ZZ>= `  ( P  +  1 ) ) ) ,  RR ,  <  )  e.  A )
58 fvoveq1 5864 . . . . . 6  |-  ( y  =  P  ->  ( ZZ>=
`  ( y  +  1 ) )  =  ( ZZ>= `  ( P  +  1 ) ) )
5958ineq2d 3322 . . . . 5  |-  ( y  =  P  ->  ( A  i^i  ( ZZ>= `  (
y  +  1 ) ) )  =  ( A  i^i  ( ZZ>= `  ( P  +  1
) ) ) )
6059infeq1d 6973 . . . 4  |-  ( y  =  P  -> inf ( ( A  i^i  ( ZZ>= `  ( y  +  1 ) ) ) ,  RR ,  <  )  = inf ( ( A  i^i  ( ZZ>= `  ( P  +  1 ) ) ) ,  RR ,  <  ) )
61 eqidd 2166 . . . 4  |-  ( z  =  Q  -> inf ( ( A  i^i  ( ZZ>= `  ( P  +  1
) ) ) ,  RR ,  <  )  = inf ( ( A  i^i  ( ZZ>= `  ( P  +  1 ) ) ) ,  RR ,  <  ) )
62 eqid 2165 . . . 4  |-  ( y  e.  NN ,  z  e.  NN  |-> inf ( ( A  i^i  ( ZZ>= `  ( y  +  1 ) ) ) ,  RR ,  <  )
)  =  ( y  e.  NN ,  z  e.  NN  |-> inf ( ( A  i^i  ( ZZ>= `  ( y  +  1 ) ) ) ,  RR ,  <  )
)
6360, 61, 62ovmpog 5972 . . 3  |-  ( ( P  e.  NN  /\  Q  e.  NN  /\ inf (
( A  i^i  ( ZZ>=
`  ( P  + 
1 ) ) ) ,  RR ,  <  )  e.  A )  -> 
( P ( y  e.  NN ,  z  e.  NN  |-> inf ( ( A  i^i  ( ZZ>= `  ( y  +  1 ) ) ) ,  RR ,  <  )
) Q )  = inf ( ( A  i^i  ( ZZ>= `  ( P  +  1 ) ) ) ,  RR ,  <  ) )
643, 5, 57, 63syl3anc 1228 . 2  |-  ( ph  ->  ( P ( y  e.  NN ,  z  e.  NN  |-> inf ( ( A  i^i  ( ZZ>= `  ( y  +  1 ) ) ) ,  RR ,  <  )
) Q )  = inf ( ( A  i^i  ( ZZ>= `  ( P  +  1 ) ) ) ,  RR ,  <  ) )
6564, 57eqeltrd 2242 1  |-  ( ph  ->  ( P ( y  e.  NN ,  z  e.  NN  |-> inf ( ( A  i^i  ( ZZ>= `  ( y  +  1 ) ) ) ,  RR ,  <  )
) Q )  e.  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104  DECID wdc 824    = wceq 1343   E.wex 1480    e. wcel 2136   A.wral 2443   E.wrex 2444    i^i cin 3114    C_ wss 3115   class class class wbr 3981   ` cfv 5187  (class class class)co 5841    e. cmpo 5843  infcinf 6944   RRcr 7748   1c1 7750    + caddc 7752    < clt 7929    <_ cle 7930   NNcn 8853   ZZcz 9187   ZZ>=cuz 9462
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-sep 4099  ax-pow 4152  ax-pr 4186  ax-un 4410  ax-setind 4513  ax-cnex 7840  ax-resscn 7841  ax-1cn 7842  ax-1re 7843  ax-icn 7844  ax-addcl 7845  ax-addrcl 7846  ax-mulcl 7847  ax-addcom 7849  ax-addass 7851  ax-distr 7853  ax-i2m1 7854  ax-0lt1 7855  ax-0id 7857  ax-rnegex 7858  ax-cnre 7860  ax-pre-ltirr 7861  ax-pre-ltwlin 7862  ax-pre-lttrn 7863  ax-pre-apti 7864  ax-pre-ltadd 7865
This theorem depends on definitions:  df-bi 116  df-dc 825  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2296  df-ne 2336  df-nel 2431  df-ral 2448  df-rex 2449  df-reu 2450  df-rmo 2451  df-rab 2452  df-v 2727  df-sbc 2951  df-csb 3045  df-dif 3117  df-un 3119  df-in 3121  df-ss 3128  df-pw 3560  df-sn 3581  df-pr 3582  df-op 3584  df-uni 3789  df-int 3824  df-iun 3867  df-br 3982  df-opab 4043  df-mpt 4044  df-id 4270  df-po 4273  df-iso 4274  df-xp 4609  df-rel 4610  df-cnv 4611  df-co 4612  df-dm 4613  df-rn 4614  df-res 4615  df-ima 4616  df-iota 5152  df-fun 5189  df-fn 5190  df-f 5191  df-f1 5192  df-fo 5193  df-f1o 5194  df-fv 5195  df-isom 5196  df-riota 5797  df-ov 5844  df-oprab 5845  df-mpo 5846  df-1st 6105  df-2nd 6106  df-sup 6945  df-inf 6946  df-pnf 7931  df-mnf 7932  df-xr 7933  df-ltxr 7934  df-le 7935  df-sub 8067  df-neg 8068  df-inn 8854  df-n0 9111  df-z 9188  df-uz 9463  df-fz 9941  df-fzo 10074
This theorem is referenced by:  nninfdclemf  12378  nninfdclemp1  12379
  Copyright terms: Public domain W3C validator