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

Theorem iseqf1olemnanb 10685
Description: Lemma for seq3f1o 10699. (Contributed by Jim Kingdon, 27-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 ) )
iseqf1olemnab.b  |-  ( ph  ->  B  e.  ( M ... N ) )
iseqf1olemnab.eq  |-  ( ph  ->  ( Q `  A
)  =  ( Q `
 B ) )
iseqf1olemnab.q  |-  Q  =  ( u  e.  ( M ... N ) 
|->  if ( u  e.  ( K ... ( `' J `  K ) ) ,  if ( u  =  K ,  K ,  ( J `  ( u  -  1 ) ) ) ,  ( J `  u
) ) )
iseqf1olemnanb.a  |-  ( ph  ->  -.  A  e.  ( K ... ( `' J `  K ) ) )
iseqf1olemnanb.b  |-  ( ph  ->  -.  B  e.  ( K ... ( `' J `  K ) ) )
Assertion
Ref Expression
iseqf1olemnanb  |-  ( ph  ->  A  =  B )
Distinct variable groups:    u, A    u, B    u, J    u, K    u, M    u, N
Allowed substitution hints:    ph( u)    Q( u)

Proof of Theorem iseqf1olemnanb
StepHypRef Expression
1 iseqf1olemnab.eq . . 3  |-  ( ph  ->  ( Q `  A
)  =  ( Q `
 B ) )
2 iseqf1olemqcl.k . . . . 5  |-  ( ph  ->  K  e.  ( M ... N ) )
3 iseqf1olemqcl.j . . . . 5  |-  ( ph  ->  J : ( M ... N ) -1-1-onto-> ( M ... N ) )
4 iseqf1olemqcl.a . . . . 5  |-  ( ph  ->  A  e.  ( M ... N ) )
5 iseqf1olemnab.q . . . . 5  |-  Q  =  ( u  e.  ( M ... N ) 
|->  if ( u  e.  ( K ... ( `' J `  K ) ) ,  if ( u  =  K ,  K ,  ( J `  ( u  -  1 ) ) ) ,  ( J `  u
) ) )
62, 3, 4, 5iseqf1olemqval 10682 . . . 4  |-  ( ph  ->  ( Q `  A
)  =  if ( A  e.  ( K ... ( `' J `  K ) ) ,  if ( A  =  K ,  K , 
( J `  ( A  -  1 ) ) ) ,  ( J `  A ) ) )
7 iseqf1olemnanb.a . . . . 5  |-  ( ph  ->  -.  A  e.  ( K ... ( `' J `  K ) ) )
87iffalsed 3589 . . . 4  |-  ( ph  ->  if ( A  e.  ( K ... ( `' J `  K ) ) ,  if ( A  =  K ,  K ,  ( J `  ( A  -  1 ) ) ) ,  ( J `  A
) )  =  ( J `  A ) )
96, 8eqtrd 2240 . . 3  |-  ( ph  ->  ( Q `  A
)  =  ( J `
 A ) )
10 iseqf1olemnab.b . . . . 5  |-  ( ph  ->  B  e.  ( M ... N ) )
112, 3, 10, 5iseqf1olemqval 10682 . . . 4  |-  ( ph  ->  ( Q `  B
)  =  if ( B  e.  ( K ... ( `' J `  K ) ) ,  if ( B  =  K ,  K , 
( J `  ( B  -  1 ) ) ) ,  ( J `  B ) ) )
12 iseqf1olemnanb.b . . . . 5  |-  ( ph  ->  -.  B  e.  ( K ... ( `' J `  K ) ) )
1312iffalsed 3589 . . . 4  |-  ( ph  ->  if ( B  e.  ( K ... ( `' J `  K ) ) ,  if ( B  =  K ,  K ,  ( J `  ( B  -  1 ) ) ) ,  ( J `  B
) )  =  ( J `  B ) )
1411, 13eqtrd 2240 . . 3  |-  ( ph  ->  ( Q `  B
)  =  ( J `
 B ) )
151, 9, 143eqtr3d 2248 . 2  |-  ( ph  ->  ( J `  A
)  =  ( J `
 B ) )
16 f1of1 5543 . . . 4  |-  ( J : ( M ... N ) -1-1-onto-> ( M ... N
)  ->  J :
( M ... N
) -1-1-> ( M ... N ) )
173, 16syl 14 . . 3  |-  ( ph  ->  J : ( M ... N ) -1-1-> ( M ... N ) )
18 f1veqaeq 5861 . . 3  |-  ( ( J : ( M ... N ) -1-1-> ( M ... N )  /\  ( A  e.  ( M ... N
)  /\  B  e.  ( M ... N ) ) )  ->  (
( J `  A
)  =  ( J `
 B )  ->  A  =  B )
)
1917, 4, 10, 18syl12anc 1248 . 2  |-  ( ph  ->  ( ( J `  A )  =  ( J `  B )  ->  A  =  B ) )
2015, 19mpd 13 1  |-  ( ph  ->  A  =  B )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    = wceq 1373    e. wcel 2178   ifcif 3579    |-> cmpt 4121   `'ccnv 4692   -1-1->wf1 5287   -1-1-onto->wf1o 5289   ` cfv 5290  (class class class)co 5967   1c1 7961    - cmin 8278   ...cfz 10165
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-cnex 8051  ax-resscn 8052  ax-1cn 8053  ax-1re 8054  ax-icn 8055  ax-addcl 8056  ax-addrcl 8057  ax-mulcl 8058  ax-addcom 8060  ax-addass 8062  ax-distr 8064  ax-i2m1 8065  ax-0lt1 8066  ax-0id 8068  ax-rnegex 8069  ax-cnre 8071  ax-pre-ltirr 8072  ax-pre-ltwlin 8073  ax-pre-lttrn 8074  ax-pre-ltadd 8076
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-nel 2474  df-ral 2491  df-rex 2492  df-reu 2493  df-rab 2495  df-v 2778  df-sbc 3006  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-if 3580  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-br 4060  df-opab 4122  df-mpt 4123  df-id 4358  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-riota 5922  df-ov 5970  df-oprab 5971  df-mpo 5972  df-pnf 8144  df-mnf 8145  df-xr 8146  df-ltxr 8147  df-le 8148  df-sub 8280  df-neg 8281  df-inn 9072  df-n0 9331  df-z 9408  df-uz 9684  df-fz 10166
This theorem is referenced by:  iseqf1olemmo  10687
  Copyright terms: Public domain W3C validator