Users' Mathboxes Mathbox for Matthew House < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  depindlem2 Unicode version

Theorem depindlem2 16631
Description: Lemma for depind 16633. (Contributed by Matthew House, 14-Apr-2026.)
Hypotheses
Ref Expression
depind.p  |-  ( ph  ->  P : NN0 --> _V )
depind.0  |-  ( ph  ->  A  e.  ( P `
 0 ) )
depind.h  |-  ( ph  ->  A. n  e.  NN0  ( H `  n ) : ( P `  n ) --> ( P `
 ( n  + 
1 ) ) )
depindlem1.4  |-  F  =  seq 0 ( ( x  e.  _V ,  h  e.  _V  |->  ( h `
 x ) ) ,  ( m  e. 
NN0  |->  if ( m  =  0 ,  A ,  ( H `  ( m  -  1
) ) ) ) )
Assertion
Ref Expression
depindlem2  |-  ( ph  ->  F  e.  X_ n  e.  NN0  ( P `  n ) )
Distinct variable groups:    h, n, x    A, m, n    n, F   
m, H, n    P, n
Allowed substitution hints:    ph( x, h, m, n)    A( x, h)    P( x, h, m)    F( x, h, m)    H( x, h)

Proof of Theorem depindlem2
Dummy variables  y  k are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 depind.p . . . . . 6  |-  ( ph  ->  P : NN0 --> _V )
2 depind.0 . . . . . 6  |-  ( ph  ->  A  e.  ( P `
 0 ) )
3 depind.h . . . . . 6  |-  ( ph  ->  A. n  e.  NN0  ( H `  n ) : ( P `  n ) --> ( P `
 ( n  + 
1 ) ) )
4 depindlem1.4 . . . . . 6  |-  F  =  seq 0 ( ( x  e.  _V ,  h  e.  _V  |->  ( h `
 x ) ) ,  ( m  e. 
NN0  |->  if ( m  =  0 ,  A ,  ( H `  ( m  -  1
) ) ) ) )
51, 2, 3, 4depindlem1 16630 . . . . 5  |-  ( ph  ->  ( F : NN0 --> _V 
/\  ( F ` 
0 )  =  A  /\  A. n  e. 
NN0  ( F `  ( n  +  1
) )  =  ( ( H `  n
) `  ( F `  n ) ) ) )
65simp1d 1036 . . . 4  |-  ( ph  ->  F : NN0 --> _V )
7 nn0ex 9522 . . . . 5  |-  NN0  e.  _V
87a1i 9 . . . 4  |-  ( ph  ->  NN0  e.  _V )
96, 8fexd 5921 . . 3  |-  ( ph  ->  F  e.  _V )
106ffnd 5514 . . 3  |-  ( ph  ->  F  Fn  NN0 )
11 fveq2 5675 . . . . . . . 8  |-  ( y  =  0  ->  ( F `  y )  =  ( F ` 
0 ) )
12 fveq2 5675 . . . . . . . 8  |-  ( y  =  0  ->  ( P `  y )  =  ( P ` 
0 ) )
1311, 12eleq12d 2305 . . . . . . 7  |-  ( y  =  0  ->  (
( F `  y
)  e.  ( P `
 y )  <->  ( F `  0 )  e.  ( P `  0
) ) )
1413imbi2d 230 . . . . . 6  |-  ( y  =  0  ->  (
( ph  ->  ( F `
 y )  e.  ( P `  y
) )  <->  ( ph  ->  ( F `  0
)  e.  ( P `
 0 ) ) ) )
15 fveq2 5675 . . . . . . . 8  |-  ( y  =  k  ->  ( F `  y )  =  ( F `  k ) )
16 fveq2 5675 . . . . . . . 8  |-  ( y  =  k  ->  ( P `  y )  =  ( P `  k ) )
1715, 16eleq12d 2305 . . . . . . 7  |-  ( y  =  k  ->  (
( F `  y
)  e.  ( P `
 y )  <->  ( F `  k )  e.  ( P `  k ) ) )
1817imbi2d 230 . . . . . 6  |-  ( y  =  k  ->  (
( ph  ->  ( F `
 y )  e.  ( P `  y
) )  <->  ( ph  ->  ( F `  k
)  e.  ( P `
 k ) ) ) )
19 fveq2 5675 . . . . . . . 8  |-  ( y  =  ( k  +  1 )  ->  ( F `  y )  =  ( F `  ( k  +  1 ) ) )
20 fveq2 5675 . . . . . . . 8  |-  ( y  =  ( k  +  1 )  ->  ( P `  y )  =  ( P `  ( k  +  1 ) ) )
2119, 20eleq12d 2305 . . . . . . 7  |-  ( y  =  ( k  +  1 )  ->  (
( F `  y
)  e.  ( P `
 y )  <->  ( F `  ( k  +  1 ) )  e.  ( P `  ( k  +  1 ) ) ) )
2221imbi2d 230 . . . . . 6  |-  ( y  =  ( k  +  1 )  ->  (
( ph  ->  ( F `
 y )  e.  ( P `  y
) )  <->  ( ph  ->  ( F `  (
k  +  1 ) )  e.  ( P `
 ( k  +  1 ) ) ) ) )
235simp2d 1037 . . . . . . 7  |-  ( ph  ->  ( F `  0
)  =  A )
2423, 2eqeltrd 2311 . . . . . 6  |-  ( ph  ->  ( F `  0
)  e.  ( P `
 0 ) )
255simp3d 1038 . . . . . . . . . . . 12  |-  ( ph  ->  A. n  e.  NN0  ( F `  ( n  +  1 ) )  =  ( ( H `
 n ) `  ( F `  n ) ) )
26 fvoveq1 6081 . . . . . . . . . . . . . 14  |-  ( n  =  k  ->  ( F `  ( n  +  1 ) )  =  ( F `  ( k  +  1 ) ) )
27 fveq2 5675 . . . . . . . . . . . . . . 15  |-  ( n  =  k  ->  ( H `  n )  =  ( H `  k ) )
28 fveq2 5675 . . . . . . . . . . . . . . 15  |-  ( n  =  k  ->  ( F `  n )  =  ( F `  k ) )
2927, 28fveq12d 5682 . . . . . . . . . . . . . 14  |-  ( n  =  k  ->  (
( H `  n
) `  ( F `  n ) )  =  ( ( H `  k ) `  ( F `  k )
) )
3026, 29eqeq12d 2249 . . . . . . . . . . . . 13  |-  ( n  =  k  ->  (
( F `  (
n  +  1 ) )  =  ( ( H `  n ) `
 ( F `  n ) )  <->  ( F `  ( k  +  1 ) )  =  ( ( H `  k
) `  ( F `  k ) ) ) )
3130rspccva 2922 . . . . . . . . . . . 12  |-  ( ( A. n  e.  NN0  ( F `  ( n  +  1 ) )  =  ( ( H `
 n ) `  ( F `  n ) )  /\  k  e. 
NN0 )  ->  ( F `  ( k  +  1 ) )  =  ( ( H `
 k ) `  ( F `  k ) ) )
3225, 31sylan 283 . . . . . . . . . . 11  |-  ( (
ph  /\  k  e.  NN0 )  ->  ( F `  ( k  +  1 ) )  =  ( ( H `  k
) `  ( F `  k ) ) )
3332adantr 276 . . . . . . . . . 10  |-  ( ( ( ph  /\  k  e.  NN0 )  /\  ( F `  k )  e.  ( P `  k
) )  ->  ( F `  ( k  +  1 ) )  =  ( ( H `
 k ) `  ( F `  k ) ) )
34 fveq2 5675 . . . . . . . . . . . . . 14  |-  ( n  =  k  ->  ( P `  n )  =  ( P `  k ) )
35 fvoveq1 6081 . . . . . . . . . . . . . 14  |-  ( n  =  k  ->  ( P `  ( n  +  1 ) )  =  ( P `  ( k  +  1 ) ) )
3627, 34, 35feq123d 5504 . . . . . . . . . . . . 13  |-  ( n  =  k  ->  (
( H `  n
) : ( P `
 n ) --> ( P `  ( n  +  1 ) )  <-> 
( H `  k
) : ( P `
 k ) --> ( P `  ( k  +  1 ) ) ) )
3736rspccva 2922 . . . . . . . . . . . 12  |-  ( ( A. n  e.  NN0  ( H `  n ) : ( P `  n ) --> ( P `
 ( n  + 
1 ) )  /\  k  e.  NN0 )  -> 
( H `  k
) : ( P `
 k ) --> ( P `  ( k  +  1 ) ) )
383, 37sylan 283 . . . . . . . . . . 11  |-  ( (
ph  /\  k  e.  NN0 )  ->  ( H `  k ) : ( P `  k ) --> ( P `  (
k  +  1 ) ) )
3938ffvelcdmda 5817 . . . . . . . . . 10  |-  ( ( ( ph  /\  k  e.  NN0 )  /\  ( F `  k )  e.  ( P `  k
) )  ->  (
( H `  k
) `  ( F `  k ) )  e.  ( P `  (
k  +  1 ) ) )
4033, 39eqeltrd 2311 . . . . . . . . 9  |-  ( ( ( ph  /\  k  e.  NN0 )  /\  ( F `  k )  e.  ( P `  k
) )  ->  ( F `  ( k  +  1 ) )  e.  ( P `  ( k  +  1 ) ) )
4140exp31 364 . . . . . . . 8  |-  ( ph  ->  ( k  e.  NN0  ->  ( ( F `  k )  e.  ( P `  k )  ->  ( F `  ( k  +  1 ) )  e.  ( P `  ( k  +  1 ) ) ) ) )
4241com12 30 . . . . . . 7  |-  ( k  e.  NN0  ->  ( ph  ->  ( ( F `  k )  e.  ( P `  k )  ->  ( F `  ( k  +  1 ) )  e.  ( P `  ( k  +  1 ) ) ) ) )
4342a2d 26 . . . . . 6  |-  ( k  e.  NN0  ->  ( (
ph  ->  ( F `  k )  e.  ( P `  k ) )  ->  ( ph  ->  ( F `  (
k  +  1 ) )  e.  ( P `
 ( k  +  1 ) ) ) ) )
4414, 18, 22, 18, 24, 43nn0ind 9713 . . . . 5  |-  ( k  e.  NN0  ->  ( ph  ->  ( F `  k
)  e.  ( P `
 k ) ) )
4544impcom 125 . . . 4  |-  ( (
ph  /\  k  e.  NN0 )  ->  ( F `  k )  e.  ( P `  k ) )
4645ralrimiva 2617 . . 3  |-  ( ph  ->  A. k  e.  NN0  ( F `  k )  e.  ( P `  k ) )
47 elixp2 6950 . . 3  |-  ( F  e.  X_ k  e.  NN0  ( P `  k )  <-> 
( F  e.  _V  /\  F  Fn  NN0  /\  A. k  e.  NN0  ( F `  k )  e.  ( P `  k
) ) )
489, 10, 46, 47syl3anbrc 1208 . 2  |-  ( ph  ->  F  e.  X_ k  e.  NN0  ( P `  k ) )
4934cbvixpv 6964 . 2  |-  X_ n  e.  NN0  ( P `  n )  =  X_ k  e.  NN0  ( P `
 k )
5048, 49eleqtrrdi 2328 1  |-  ( ph  ->  F  e.  X_ n  e.  NN0  ( P `  n ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2205   A.wral 2522   _Vcvv 2815   ifcif 3624    |-> cmpt 4176    Fn wfn 5352   -->wf 5353   ` cfv 5357  (class class class)co 6058    e. cmpo 6060   X_cixp 6946   0cc0 8143   1c1 8144    + caddc 8146    - cmin 8461   NN0cn0 9516    seqcseq 10836
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-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  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-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-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  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-1st 6347  df-2nd 6348  df-recs 6549  df-frec 6635  df-ixp 6947  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8463  df-neg 8464  df-inn 9258  df-n0 9517  df-z 9598  df-uz 9875  df-seqfrec 10837
This theorem is referenced by:  depind  16633
  Copyright terms: Public domain W3C validator