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

Theorem iseqf1olemqval 10752
Description: Lemma for seq3f1o 10769. 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 10751 . 2  |-  ( ph  ->  if ( A  e.  ( K ... ( `' J `  K ) ) ,  if ( A  =  K ,  K ,  ( J `  ( A  -  1 ) ) ) ,  ( J `  A
) )  e.  ( M ... N ) )
5 eleq1 2292 . . . 4  |-  ( u  =  A  ->  (
u  e.  ( K ... ( `' J `  K ) )  <->  A  e.  ( K ... ( `' J `  K ) ) ) )
6 eqeq1 2236 . . . . 5  |-  ( u  =  A  ->  (
u  =  K  <->  A  =  K ) )
7 oveq1 6020 . . . . . 6  |-  ( u  =  A  ->  (
u  -  1 )  =  ( A  - 
1 ) )
87fveq2d 5639 . . . . 5  |-  ( u  =  A  ->  ( J `  ( u  -  1 ) )  =  ( J `  ( A  -  1
) ) )
96, 8ifbieq2d 3628 . . . 4  |-  ( u  =  A  ->  if ( u  =  K ,  K ,  ( J `
 ( u  - 
1 ) ) )  =  if ( A  =  K ,  K ,  ( J `  ( A  -  1
) ) ) )
10 fveq2 5635 . . . 4  |-  ( u  =  A  ->  ( J `  u )  =  ( J `  A ) )
115, 9, 10ifbieq12d 3630 . . 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 5718 . 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 1395    e. wcel 2200   ifcif 3603    |-> cmpt 4148   `'ccnv 4722   -1-1-onto->wf1o 5323   ` cfv 5324  (class class class)co 6013   1c1 8023    - cmin 8340   ...cfz 10233
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-addcom 8122  ax-addass 8124  ax-distr 8126  ax-i2m1 8127  ax-0lt1 8128  ax-0id 8130  ax-rnegex 8131  ax-cnre 8133  ax-pre-ltirr 8134  ax-pre-ltwlin 8135  ax-pre-lttrn 8136  ax-pre-ltadd 8138
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2802  df-sbc 3030  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-if 3604  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-pnf 8206  df-mnf 8207  df-xr 8208  df-ltxr 8209  df-le 8210  df-sub 8342  df-neg 8343  df-inn 9134  df-n0 9393  df-z 9470  df-uz 9746  df-fz 10234
This theorem is referenced by:  iseqf1olemnab  10753  iseqf1olemab  10754  iseqf1olemnanb  10755  iseqf1olemqk  10759  seq3f1olemqsumkj  10763  seq3f1olemqsumk  10764
  Copyright terms: Public domain W3C validator