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

Theorem iseqf1olemkle 10568
Description: Lemma for seq3f1o 10588. (Contributed by Jim Kingdon, 21-Aug-2022.)
Hypotheses
Ref Expression
iseqf1olemkle.n  |-  ( ph  ->  N  e.  ( ZZ>= `  M ) )
iseqf1olemkle.k  |-  ( ph  ->  K  e.  ( M ... N ) )
iseqf1olemkle.j  |-  ( ph  ->  J : ( M ... N ) -1-1-onto-> ( M ... N ) )
iseqf1olemkle.const  |-  ( ph  ->  A. x  e.  ( M..^ K ) ( J `  x )  =  x )
Assertion
Ref Expression
iseqf1olemkle  |-  ( ph  ->  K  <_  ( `' J `  K )
)
Distinct variable groups:    x, J    x, K    x, M
Allowed substitution hints:    ph( x)    N( x)

Proof of Theorem iseqf1olemkle
StepHypRef Expression
1 iseqf1olemkle.k . . . . . 6  |-  ( ph  ->  K  e.  ( M ... N ) )
2 elfzelz 10091 . . . . . 6  |-  ( K  e.  ( M ... N )  ->  K  e.  ZZ )
31, 2syl 14 . . . . 5  |-  ( ph  ->  K  e.  ZZ )
43adantr 276 . . . 4  |-  ( (
ph  /\  K  <  ( `' J `  K ) )  ->  K  e.  ZZ )
54zred 9439 . . 3  |-  ( (
ph  /\  K  <  ( `' J `  K ) )  ->  K  e.  RR )
6 iseqf1olemkle.j . . . . . . . . 9  |-  ( ph  ->  J : ( M ... N ) -1-1-onto-> ( M ... N ) )
7 f1ocnv 5513 . . . . . . . . 9  |-  ( J : ( M ... N ) -1-1-onto-> ( M ... N
)  ->  `' J : ( M ... N ) -1-1-onto-> ( M ... N
) )
86, 7syl 14 . . . . . . . 8  |-  ( ph  ->  `' J : ( M ... N ) -1-1-onto-> ( M ... N ) )
9 f1of 5500 . . . . . . . 8  |-  ( `' J : ( M ... N ) -1-1-onto-> ( M ... N )  ->  `' J : ( M ... N ) --> ( M ... N ) )
108, 9syl 14 . . . . . . 7  |-  ( ph  ->  `' J : ( M ... N ) --> ( M ... N ) )
1110, 1ffvelcdmd 5694 . . . . . 6  |-  ( ph  ->  ( `' J `  K )  e.  ( M ... N ) )
12 elfzelz 10091 . . . . . 6  |-  ( ( `' J `  K )  e.  ( M ... N )  ->  ( `' J `  K )  e.  ZZ )
1311, 12syl 14 . . . . 5  |-  ( ph  ->  ( `' J `  K )  e.  ZZ )
1413adantr 276 . . . 4  |-  ( (
ph  /\  K  <  ( `' J `  K ) )  ->  ( `' J `  K )  e.  ZZ )
1514zred 9439 . . 3  |-  ( (
ph  /\  K  <  ( `' J `  K ) )  ->  ( `' J `  K )  e.  RR )
16 simpr 110 . . 3  |-  ( (
ph  /\  K  <  ( `' J `  K ) )  ->  K  <  ( `' J `  K ) )
175, 15, 16ltled 8138 . 2  |-  ( (
ph  /\  K  <  ( `' J `  K ) )  ->  K  <_  ( `' J `  K ) )
183zred 9439 . . 3  |-  ( ph  ->  K  e.  RR )
19 eqle 8111 . . 3  |-  ( ( K  e.  RR  /\  K  =  ( `' J `  K )
)  ->  K  <_  ( `' J `  K ) )
2018, 19sylan 283 . 2  |-  ( (
ph  /\  K  =  ( `' J `  K ) )  ->  K  <_  ( `' J `  K ) )
216adantr 276 . . . . 5  |-  ( (
ph  /\  ( `' J `  K )  <  K )  ->  J : ( M ... N ) -1-1-onto-> ( M ... N
) )
221adantr 276 . . . . 5  |-  ( (
ph  /\  ( `' J `  K )  <  K )  ->  K  e.  ( M ... N
) )
23 f1ocnvfv2 5821 . . . . 5  |-  ( ( J : ( M ... N ) -1-1-onto-> ( M ... N )  /\  K  e.  ( M ... N ) )  -> 
( J `  ( `' J `  K ) )  =  K )
2421, 22, 23syl2anc 411 . . . 4  |-  ( (
ph  /\  ( `' J `  K )  <  K )  ->  ( J `  ( `' J `  K )
)  =  K )
25 fveq2 5554 . . . . . 6  |-  ( x  =  ( `' J `  K )  ->  ( J `  x )  =  ( J `  ( `' J `  K ) ) )
26 id 19 . . . . . 6  |-  ( x  =  ( `' J `  K )  ->  x  =  ( `' J `  K ) )
2725, 26eqeq12d 2208 . . . . 5  |-  ( x  =  ( `' J `  K )  ->  (
( J `  x
)  =  x  <->  ( J `  ( `' J `  K ) )  =  ( `' J `  K ) ) )
28 iseqf1olemkle.const . . . . . 6  |-  ( ph  ->  A. x  e.  ( M..^ K ) ( J `  x )  =  x )
2928adantr 276 . . . . 5  |-  ( (
ph  /\  ( `' J `  K )  <  K )  ->  A. x  e.  ( M..^ K ) ( J `  x
)  =  x )
30 elfzuz 10087 . . . . . . . 8  |-  ( ( `' J `  K )  e.  ( M ... N )  ->  ( `' J `  K )  e.  ( ZZ>= `  M
) )
3111, 30syl 14 . . . . . . 7  |-  ( ph  ->  ( `' J `  K )  e.  (
ZZ>= `  M ) )
3231adantr 276 . . . . . 6  |-  ( (
ph  /\  ( `' J `  K )  <  K )  ->  ( `' J `  K )  e.  ( ZZ>= `  M
) )
333adantr 276 . . . . . 6  |-  ( (
ph  /\  ( `' J `  K )  <  K )  ->  K  e.  ZZ )
34 simpr 110 . . . . . 6  |-  ( (
ph  /\  ( `' J `  K )  <  K )  ->  ( `' J `  K )  <  K )
35 elfzo2 10216 . . . . . 6  |-  ( ( `' J `  K )  e.  ( M..^ K
)  <->  ( ( `' J `  K )  e.  ( ZZ>= `  M
)  /\  K  e.  ZZ  /\  ( `' J `  K )  <  K
) )
3632, 33, 34, 35syl3anbrc 1183 . . . . 5  |-  ( (
ph  /\  ( `' J `  K )  <  K )  ->  ( `' J `  K )  e.  ( M..^ K
) )
3727, 29, 36rspcdva 2869 . . . 4  |-  ( (
ph  /\  ( `' J `  K )  <  K )  ->  ( J `  ( `' J `  K )
)  =  ( `' J `  K ) )
3824, 37eqtr3d 2228 . . 3  |-  ( (
ph  /\  ( `' J `  K )  <  K )  ->  K  =  ( `' J `  K ) )
3938, 20syldan 282 . 2  |-  ( (
ph  /\  ( `' J `  K )  <  K )  ->  K  <_  ( `' J `  K ) )
40 ztri3or 9360 . . 3  |-  ( ( K  e.  ZZ  /\  ( `' J `  K )  e.  ZZ )  -> 
( K  <  ( `' J `  K )  \/  K  =  ( `' J `  K )  \/  ( `' J `  K )  <  K
) )
413, 13, 40syl2anc 411 . 2  |-  ( ph  ->  ( K  <  ( `' J `  K )  \/  K  =  ( `' J `  K )  \/  ( `' J `  K )  <  K
) )
4217, 20, 39, 41mpjao3dan 1318 1  |-  ( ph  ->  K  <_  ( `' J `  K )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    \/ w3o 979    = wceq 1364    e. wcel 2164   A.wral 2472   class class class wbr 4029   `'ccnv 4658   -->wf 5250   -1-1-onto->wf1o 5253   ` cfv 5254  (class class class)co 5918   RRcr 7871    < clt 8054    <_ cle 8055   ZZcz 9317   ZZ>=cuz 9592   ...cfz 10074  ..^cfzo 10208
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-ltadd 7988
This theorem depends on definitions:  df-bi 117  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-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-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-riota 5873  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  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:  iseqf1olemqk  10578  seq3f1olemqsumkj  10582  seq3f1olemqsumk  10583
  Copyright terms: Public domain W3C validator