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

Theorem iseqf1olemkle 10606
Description: Lemma for seq3f1o 10626. (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 10117 . . . . . 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 9465 . . 3  |-  ( (
ph  /\  K  <  ( `' J `  K ) )  ->  K  e.  RR )
6 iseqf1olemkle.j . . . . . . . . 9  |-  ( ph  ->  J : ( M ... N ) -1-1-onto-> ( M ... N ) )
7 f1ocnv 5520 . . . . . . . . 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 5507 . . . . . . . 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 5701 . . . . . 6  |-  ( ph  ->  ( `' J `  K )  e.  ( M ... N ) )
12 elfzelz 10117 . . . . . 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 9465 . . 3  |-  ( (
ph  /\  K  <  ( `' J `  K ) )  ->  ( `' J `  K )  e.  RR )
16 simpr 110 . . 3  |-  ( (
ph  /\  K  <  ( `' J `  K ) )  ->  K  <  ( `' J `  K ) )
175, 15, 16ltled 8162 . 2  |-  ( (
ph  /\  K  <  ( `' J `  K ) )  ->  K  <_  ( `' J `  K ) )
183zred 9465 . . 3  |-  ( ph  ->  K  e.  RR )
19 eqle 8135 . . 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 5828 . . . . 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 5561 . . . . . 6  |-  ( x  =  ( `' J `  K )  ->  ( J `  x )  =  ( J `  ( `' J `  K ) ) )
26 id 19 . . . . . 6  |-  ( x  =  ( `' J `  K )  ->  x  =  ( `' J `  K ) )
2725, 26eqeq12d 2211 . . . . 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 10113 . . . . . . . 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 10242 . . . . . 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 2873 . . . 4  |-  ( (
ph  /\  ( `' J `  K )  <  K )  ->  ( J `  ( `' J `  K )
)  =  ( `' J `  K ) )
3824, 37eqtr3d 2231 . . 3  |-  ( (
ph  /\  ( `' J `  K )  <  K )  ->  K  =  ( `' J `  K ) )
3938, 20syldan 282 . 2  |-  ( (
ph  /\  ( `' J `  K )  <  K )  ->  K  <_  ( `' J `  K ) )
40 ztri3or 9386 . . 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 2167   A.wral 2475   class class class wbr 4034   `'ccnv 4663   -->wf 5255   -1-1-onto->wf1o 5258   ` cfv 5259  (class class class)co 5925   RRcr 7895    < clt 8078    <_ cle 8079   ZZcz 9343   ZZ>=cuz 9618   ...cfz 10100  ..^cfzo 10234
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-addass 7998  ax-distr 8000  ax-i2m1 8001  ax-0lt1 8002  ax-0id 8004  ax-rnegex 8005  ax-cnre 8007  ax-pre-ltirr 8008  ax-pre-ltwlin 8009  ax-pre-lttrn 8010  ax-pre-ltadd 8012
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-pnf 8080  df-mnf 8081  df-xr 8082  df-ltxr 8083  df-le 8084  df-sub 8216  df-neg 8217  df-inn 9008  df-n0 9267  df-z 9344  df-uz 9619  df-fz 10101  df-fzo 10235
This theorem is referenced by:  iseqf1olemqk  10616  seq3f1olemqsumkj  10620  seq3f1olemqsumk  10621
  Copyright terms: Public domain W3C validator