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

Theorem iseqf1olemqval 10891
Description: Lemma for seq3f1o 10908. Value of the function  Q. (Contributed by Jim Kingdon, 28-Aug-2022.)
Hypotheses
Ref Expression
iseqf1olemqcl.k  |-  ( ph  ->  K  e.  ( M ... N ) )
iseqf1olemqcl.j  |-  ( ph  ->  J : ( M ... N ) -1-1-onto-> ( M ... N ) )
iseqf1olemqcl.a  |-  ( ph  ->  A  e.  ( M ... N ) )
iseqf1olemqval.q  |-  Q  =  ( u  e.  ( M ... N ) 
|->  if ( u  e.  ( K ... ( `' J `  K ) ) ,  if ( u  =  K ,  K ,  ( J `  ( u  -  1 ) ) ) ,  ( J `  u
) ) )
Assertion
Ref Expression
iseqf1olemqval  |-  ( ph  ->  ( Q `  A
)  =  if ( A  e.  ( K ... ( `' J `  K ) ) ,  if ( A  =  K ,  K , 
( J `  ( A  -  1 ) ) ) ,  ( J `  A ) ) )
Distinct variable groups:    u, A    u, J    u, K    u, M    u, N
Allowed substitution hints:    ph( u)    Q( u)

Proof of Theorem iseqf1olemqval
StepHypRef Expression
1 iseqf1olemqcl.a . 2  |-  ( ph  ->  A  e.  ( M ... N ) )
2 iseqf1olemqcl.k . . 3  |-  ( ph  ->  K  e.  ( M ... N ) )
3 iseqf1olemqcl.j . . 3  |-  ( ph  ->  J : ( M ... N ) -1-1-onto-> ( M ... N ) )
42, 3, 1iseqf1olemqcl 10890 . 2  |-  ( ph  ->  if ( A  e.  ( K ... ( `' J `  K ) ) ,  if ( A  =  K ,  K ,  ( J `  ( A  -  1 ) ) ) ,  ( J `  A
) )  e.  ( M ... N ) )
5 eleq1 2297 . . . 4  |-  ( u  =  A  ->  (
u  e.  ( K ... ( `' J `  K ) )  <->  A  e.  ( K ... ( `' J `  K ) ) ) )
6 eqeq1 2241 . . . . 5  |-  ( u  =  A  ->  (
u  =  K  <->  A  =  K ) )
7 oveq1 6067 . . . . . 6  |-  ( u  =  A  ->  (
u  -  1 )  =  ( A  - 
1 ) )
87fveq2d 5681 . . . . 5  |-  ( u  =  A  ->  ( J `  ( u  -  1 ) )  =  ( J `  ( A  -  1
) ) )
96, 8ifbieq2d 3652 . . . 4  |-  ( u  =  A  ->  if ( u  =  K ,  K ,  ( J `
 ( u  - 
1 ) ) )  =  if ( A  =  K ,  K ,  ( J `  ( A  -  1
) ) ) )
10 fveq2 5677 . . . 4  |-  ( u  =  A  ->  ( J `  u )  =  ( J `  A ) )
115, 9, 10ifbieq12d 3654 . . 3  |-  ( u  =  A  ->  if ( u  e.  ( K ... ( `' J `  K ) ) ,  if ( u  =  K ,  K , 
( J `  (
u  -  1 ) ) ) ,  ( J `  u ) )  =  if ( A  e.  ( K ... ( `' J `  K ) ) ,  if ( A  =  K ,  K , 
( J `  ( A  -  1 ) ) ) ,  ( J `  A ) ) )
12 iseqf1olemqval.q . . 3  |-  Q  =  ( u  e.  ( M ... N ) 
|->  if ( u  e.  ( K ... ( `' J `  K ) ) ,  if ( u  =  K ,  K ,  ( J `  ( u  -  1 ) ) ) ,  ( J `  u
) ) )
1311, 12fvmptg 5760 . 2  |-  ( ( A  e.  ( M ... N )  /\  if ( A  e.  ( K ... ( `' J `  K ) ) ,  if ( A  =  K ,  K ,  ( J `  ( A  -  1 ) ) ) ,  ( J `  A
) )  e.  ( M ... N ) )  ->  ( Q `  A )  =  if ( A  e.  ( K ... ( `' J `  K ) ) ,  if ( A  =  K ,  K ,  ( J `  ( A  -  1 ) ) ) ,  ( J `  A
) ) )
141, 4, 13syl2anc 411 1  |-  ( ph  ->  ( Q `  A
)  =  if ( A  e.  ( K ... ( `' J `  K ) ) ,  if ( A  =  K ,  K , 
( J `  ( A  -  1 ) ) ) ,  ( J `  A ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398    e. wcel 2205   ifcif 3625    |-> cmpt 4177   `'ccnv 4755   -1-1-onto->wf1o 5358   ` cfv 5359  (class class class)co 6060   1c1 8146    - cmin 8463   ...cfz 10366
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4234  ax-pow 4293  ax-pr 4328  ax-un 4560  ax-setind 4666  ax-cnex 8236  ax-resscn 8237  ax-1cn 8238  ax-1re 8239  ax-icn 8240  ax-addcl 8241  ax-addrcl 8242  ax-mulcl 8243  ax-addcom 8245  ax-addass 8247  ax-distr 8249  ax-i2m1 8250  ax-0lt1 8251  ax-0id 8253  ax-rnegex 8254  ax-cnre 8256  ax-pre-ltirr 8257  ax-pre-ltwlin 8258  ax-pre-lttrn 8259  ax-pre-ltadd 8261
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-if 3626  df-pw 3677  df-sn 3701  df-pr 3702  df-op 3704  df-uni 3921  df-int 3956  df-br 4116  df-opab 4178  df-mpt 4179  df-id 4420  df-xp 4762  df-rel 4763  df-cnv 4764  df-co 4765  df-dm 4766  df-rn 4767  df-res 4768  df-ima 4769  df-iota 5319  df-fun 5361  df-fn 5362  df-f 5363  df-f1 5364  df-fo 5365  df-f1o 5366  df-fv 5367  df-riota 6013  df-ov 6063  df-oprab 6064  df-mpo 6065  df-pnf 8328  df-mnf 8329  df-xr 8330  df-ltxr 8331  df-le 8332  df-sub 8465  df-neg 8466  df-inn 9260  df-n0 9519  df-z 9600  df-uz 9877  df-fz 10367
This theorem is referenced by:  iseqf1olemnab  10892  iseqf1olemab  10893  iseqf1olemnanb  10894  iseqf1olemqk  10898  seq3f1olemqsumkj  10902  seq3f1olemqsumk  10903
  Copyright terms: Public domain W3C validator