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

Theorem rdgisucinc 6616
Description: Value of the recursive definition generator at a successor.

This can be thought of as a generalization of oasuc 6697 and omsuc 6705. (Contributed by Jim Kingdon, 29-Aug-2019.)

Hypotheses
Ref Expression
rdgisuc1.1  |-  ( ph  ->  F  Fn  _V )
rdgisuc1.2  |-  ( ph  ->  A  e.  V )
rdgisuc1.3  |-  ( ph  ->  B  e.  On )
rdgisucinc.inc  |-  ( ph  ->  A. x  x  C_  ( F `  x ) )
Assertion
Ref Expression
rdgisucinc  |-  ( ph  ->  ( rec ( F ,  A ) `  suc  B )  =  ( F `  ( rec ( F ,  A
) `  B )
) )
Distinct variable groups:    x, F    x, A    x, B    x, V
Allowed substitution hint:    ph( x)

Proof of Theorem rdgisucinc
StepHypRef Expression
1 rdgisuc1.1 . . . 4  |-  ( ph  ->  F  Fn  _V )
2 rdgisuc1.2 . . . 4  |-  ( ph  ->  A  e.  V )
3 rdgisuc1.3 . . . 4  |-  ( ph  ->  B  e.  On )
41, 2, 3rdgisuc1 6615 . . 3  |-  ( ph  ->  ( rec ( F ,  A ) `  suc  B )  =  ( A  u.  ( U_ x  e.  B  ( F `  ( rec ( F ,  A ) `
 x ) )  u.  ( F `  ( rec ( F ,  A ) `  B
) ) ) ) )
5 unass 3376 . . 3  |-  ( ( A  u.  U_ x  e.  B  ( F `  ( rec ( F ,  A ) `  x ) ) )  u.  ( F `  ( rec ( F ,  A ) `  B
) ) )  =  ( A  u.  ( U_ x  e.  B  ( F `  ( rec ( F ,  A
) `  x )
)  u.  ( F `
 ( rec ( F ,  A ) `  B ) ) ) )
64, 5eqtr4di 2283 . 2  |-  ( ph  ->  ( rec ( F ,  A ) `  suc  B )  =  ( ( A  u.  U_ x  e.  B  ( F `  ( rec ( F ,  A ) `
 x ) ) )  u.  ( F `
 ( rec ( F ,  A ) `  B ) ) ) )
7 rdgival 6613 . . . 4  |-  ( ( F  Fn  _V  /\  A  e.  V  /\  B  e.  On )  ->  ( rec ( F ,  A ) `  B )  =  ( A  u.  U_ x  e.  B  ( F `  ( rec ( F ,  A ) `  x ) ) ) )
81, 2, 3, 7syl3anc 1274 . . 3  |-  ( ph  ->  ( rec ( F ,  A ) `  B )  =  ( A  u.  U_ x  e.  B  ( F `  ( rec ( F ,  A ) `  x ) ) ) )
98uneq1d 3372 . 2  |-  ( ph  ->  ( ( rec ( F ,  A ) `  B )  u.  ( F `  ( rec ( F ,  A ) `
 B ) ) )  =  ( ( A  u.  U_ x  e.  B  ( F `  ( rec ( F ,  A ) `  x ) ) )  u.  ( F `  ( rec ( F ,  A ) `  B
) ) ) )
10 rdgexggg 6608 . . . . 5  |-  ( ( F  Fn  _V  /\  A  e.  V  /\  B  e.  On )  ->  ( rec ( F ,  A ) `  B )  e.  _V )
111, 2, 3, 10syl3anc 1274 . . . 4  |-  ( ph  ->  ( rec ( F ,  A ) `  B )  e.  _V )
12 rdgisucinc.inc . . . 4  |-  ( ph  ->  A. x  x  C_  ( F `  x ) )
13 id 19 . . . . . 6  |-  ( x  =  ( rec ( F ,  A ) `  B )  ->  x  =  ( rec ( F ,  A ) `  B ) )
14 fveq2 5670 . . . . . 6  |-  ( x  =  ( rec ( F ,  A ) `  B )  ->  ( F `  x )  =  ( F `  ( rec ( F ,  A ) `  B
) ) )
1513, 14sseq12d 3269 . . . . 5  |-  ( x  =  ( rec ( F ,  A ) `  B )  ->  (
x  C_  ( F `  x )  <->  ( rec ( F ,  A ) `
 B )  C_  ( F `  ( rec ( F ,  A
) `  B )
) ) )
1615spcgv 2904 . . . 4  |-  ( ( rec ( F ,  A ) `  B
)  e.  _V  ->  ( A. x  x  C_  ( F `  x )  ->  ( rec ( F ,  A ) `  B )  C_  ( F `  ( rec ( F ,  A ) `
 B ) ) ) )
1711, 12, 16sylc 62 . . 3  |-  ( ph  ->  ( rec ( F ,  A ) `  B )  C_  ( F `  ( rec ( F ,  A ) `
 B ) ) )
18 ssequn1 3389 . . 3  |-  ( ( rec ( F ,  A ) `  B
)  C_  ( F `  ( rec ( F ,  A ) `  B ) )  <->  ( ( rec ( F ,  A
) `  B )  u.  ( F `  ( rec ( F ,  A
) `  B )
) )  =  ( F `  ( rec ( F ,  A
) `  B )
) )
1917, 18sylib 122 . 2  |-  ( ph  ->  ( ( rec ( F ,  A ) `  B )  u.  ( F `  ( rec ( F ,  A ) `
 B ) ) )  =  ( F `
 ( rec ( F ,  A ) `  B ) ) )
206, 9, 193eqtr2d 2271 1  |-  ( ph  ->  ( rec ( F ,  A ) `  suc  B )  =  ( F `  ( rec ( F ,  A
) `  B )
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1396    = wceq 1398    e. wcel 2203   _Vcvv 2813    u. cun 3209    C_ wss 3211   U_ciun 3991   Oncon0 4484   suc csuc 4486    Fn wfn 5347   ` cfv 5352   reccrdg 6600
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 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-iord 4487  df-on 4489  df-suc 4492  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-recs 6536  df-irdg 6601
This theorem is referenced by:  frecrdg  6639
  Copyright terms: Public domain W3C validator