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

Theorem iseqf1olemqval 10886
Description: Lemma for seq3f1o 10903. 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 10885 . 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 6065 . . . . . 6  |-  ( u  =  A  ->  (
u  -  1 )  =  ( A  - 
1 ) )
87fveq2d 5679 . . . . 5  |-  ( u  =  A  ->  ( J `  ( u  -  1 ) )  =  ( J `  ( A  -  1
) ) )
96, 8ifbieq2d 3651 . . . 4  |-  ( u  =  A  ->  if ( u  =  K ,  K ,  ( J `
 ( u  - 
1 ) ) )  =  if ( A  =  K ,  K ,  ( J `  ( A  -  1
) ) ) )
10 fveq2 5675 . . . 4  |-  ( u  =  A  ->  ( J `  u )  =  ( J `  A ) )
115, 9, 10ifbieq12d 3653 . . 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 5758 . 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 3624    |-> cmpt 4176   `'ccnv 4753   -1-1-onto->wf1o 5356   ` cfv 5357  (class class class)co 6058   1c1 8144    - cmin 8460   ...cfz 10361
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-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-ltadd 8259
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 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-inn 9255  df-n0 9514  df-z 9595  df-uz 9872  df-fz 10362
This theorem is referenced by:  iseqf1olemnab  10887  iseqf1olemab  10888  iseqf1olemnanb  10889  iseqf1olemqk  10893  seq3f1olemqsumkj  10897  seq3f1olemqsumk  10898
  Copyright terms: Public domain W3C validator