Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  wrecseq123 Structured version   Unicode version

Theorem wrecseq123 28900
Description: General equality theorem for the well-founded recursive function generator. (Contributed by Scott Fenton, 7-Jun-2018.)
Assertion
Ref Expression
wrecseq123  |-  ( ( R  =  S  /\  A  =  B  /\  F  =  G )  -> wrecs ( R ,  A ,  F )  = wrecs ( S ,  B ,  G ) )

Proof of Theorem wrecseq123
Dummy variables  f  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sseq2 3519 . . . . . . . 8  |-  ( A  =  B  ->  (
x  C_  A  <->  x  C_  B
) )
213ad2ant2 1013 . . . . . . 7  |-  ( ( R  =  S  /\  A  =  B  /\  F  =  G )  ->  ( x  C_  A  <->  x 
C_  B ) )
3 predeq1 28809 . . . . . . . . . . 11  |-  ( R  =  S  ->  Pred ( R ,  A , 
y )  =  Pred ( S ,  A , 
y ) )
4 predeq2 28810 . . . . . . . . . . 11  |-  ( A  =  B  ->  Pred ( S ,  A , 
y )  =  Pred ( S ,  B , 
y ) )
53, 4sylan9eq 2521 . . . . . . . . . 10  |-  ( ( R  =  S  /\  A  =  B )  ->  Pred ( R ,  A ,  y )  =  Pred ( S ,  B ,  y )
)
653adant3 1011 . . . . . . . . 9  |-  ( ( R  =  S  /\  A  =  B  /\  F  =  G )  ->  Pred ( R ,  A ,  y )  =  Pred ( S ,  B ,  y )
)
76sseq1d 3524 . . . . . . . 8  |-  ( ( R  =  S  /\  A  =  B  /\  F  =  G )  ->  ( Pred ( R ,  A ,  y )  C_  x  <->  Pred ( S ,  B ,  y )  C_  x )
)
87ralbidv 2896 . . . . . . 7  |-  ( ( R  =  S  /\  A  =  B  /\  F  =  G )  ->  ( A. y  e.  x  Pred ( R ,  A ,  y )  C_  x  <->  A. y  e.  x  Pred ( S ,  B ,  y )  C_  x ) )
92, 8anbi12d 710 . . . . . 6  |-  ( ( R  =  S  /\  A  =  B  /\  F  =  G )  ->  ( ( x  C_  A  /\  A. y  e.  x  Pred ( R ,  A ,  y )  C_  x )  <->  ( x  C_  B  /\  A. y  e.  x  Pred ( S ,  B ,  y )  C_  x )
) )
10 simp3 993 . . . . . . . . 9  |-  ( ( R  =  S  /\  A  =  B  /\  F  =  G )  ->  F  =  G )
115reseq2d 5264 . . . . . . . . . 10  |-  ( ( R  =  S  /\  A  =  B )  ->  ( f  |`  Pred ( R ,  A , 
y ) )  =  ( f  |`  Pred ( S ,  B , 
y ) ) )
12113adant3 1011 . . . . . . . . 9  |-  ( ( R  =  S  /\  A  =  B  /\  F  =  G )  ->  ( f  |`  Pred ( R ,  A , 
y ) )  =  ( f  |`  Pred ( S ,  B , 
y ) ) )
1310, 12fveq12d 5863 . . . . . . . 8  |-  ( ( R  =  S  /\  A  =  B  /\  F  =  G )  ->  ( F `  (
f  |`  Pred ( R ,  A ,  y )
) )  =  ( G `  ( f  |`  Pred ( S ,  B ,  y )
) ) )
1413eqeq2d 2474 . . . . . . 7  |-  ( ( R  =  S  /\  A  =  B  /\  F  =  G )  ->  ( ( f `  y )  =  ( F `  ( f  |`  Pred ( R ,  A ,  y )
) )  <->  ( f `  y )  =  ( G `  ( f  |`  Pred ( S ,  B ,  y )
) ) ) )
1514ralbidv 2896 . . . . . 6  |-  ( ( R  =  S  /\  A  =  B  /\  F  =  G )  ->  ( A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  Pred ( R ,  A ,  y )
) )  <->  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  Pred ( S ,  B ,  y )
) ) ) )
169, 153anbi23d 1297 . . . . 5  |-  ( ( R  =  S  /\  A  =  B  /\  F  =  G )  ->  ( ( f  Fn  x  /\  ( x 
C_  A  /\  A. y  e.  x  Pred ( R ,  A , 
y )  C_  x
)  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  Pred ( R ,  A ,  y )
) ) )  <->  ( f  Fn  x  /\  (
x  C_  B  /\  A. y  e.  x  Pred ( S ,  B , 
y )  C_  x
)  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  Pred ( S ,  B ,  y )
) ) ) ) )
1716exbidv 1685 . . . 4  |-  ( ( R  =  S  /\  A  =  B  /\  F  =  G )  ->  ( E. x ( f  Fn  x  /\  ( x  C_  A  /\  A. y  e.  x  Pred ( R ,  A , 
y )  C_  x
)  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  Pred ( R ,  A ,  y )
) ) )  <->  E. x
( f  Fn  x  /\  ( x  C_  B  /\  A. y  e.  x  Pred ( S ,  B ,  y )  C_  x )  /\  A. y  e.  x  (
f `  y )  =  ( G `  ( f  |`  Pred ( S ,  B , 
y ) ) ) ) ) )
1817abbidv 2596 . . 3  |-  ( ( R  =  S  /\  A  =  B  /\  F  =  G )  ->  { f  |  E. x ( f  Fn  x  /\  ( x 
C_  A  /\  A. y  e.  x  Pred ( R ,  A , 
y )  C_  x
)  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  Pred ( R ,  A ,  y )
) ) ) }  =  { f  |  E. x ( f  Fn  x  /\  (
x  C_  B  /\  A. y  e.  x  Pred ( S ,  B , 
y )  C_  x
)  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  Pred ( S ,  B ,  y )
) ) ) } )
1918unieqd 4248 . 2  |-  ( ( R  =  S  /\  A  =  B  /\  F  =  G )  ->  U. { f  |  E. x ( f  Fn  x  /\  (
x  C_  A  /\  A. y  e.  x  Pred ( R ,  A , 
y )  C_  x
)  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  Pred ( R ,  A ,  y )
) ) ) }  =  U. { f  |  E. x ( f  Fn  x  /\  ( x  C_  B  /\  A. y  e.  x  Pred ( S ,  B , 
y )  C_  x
)  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  Pred ( S ,  B ,  y )
) ) ) } )
20 df-wrecs 28899 . 2  |- wrecs ( R ,  A ,  F
)  =  U. {
f  |  E. x
( f  Fn  x  /\  ( x  C_  A  /\  A. y  e.  x  Pred ( R ,  A ,  y )  C_  x )  /\  A. y  e.  x  (
f `  y )  =  ( F `  ( f  |`  Pred ( R ,  A , 
y ) ) ) ) }
21 df-wrecs 28899 . 2  |- wrecs ( S ,  B ,  G
)  =  U. {
f  |  E. x
( f  Fn  x  /\  ( x  C_  B  /\  A. y  e.  x  Pred ( S ,  B ,  y )  C_  x )  /\  A. y  e.  x  (
f `  y )  =  ( G `  ( f  |`  Pred ( S ,  B , 
y ) ) ) ) }
2219, 20, 213eqtr4g 2526 1  |-  ( ( R  =  S  /\  A  =  B  /\  F  =  G )  -> wrecs ( R ,  A ,  F )  = wrecs ( S ,  B ,  G ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 369    /\ w3a 968    = wceq 1374   E.wex 1591   {cab 2445   A.wral 2807    C_ wss 3469   U.cuni 4238    |` cres 4994    Fn wfn 5574   ` cfv 5579   Predcpred 28806  wrecscwrecs 28898
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1714  ax-7 1734  ax-10 1781  ax-11 1786  ax-12 1798  ax-13 1961  ax-ext 2438
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 970  df-tru 1377  df-ex 1592  df-nf 1595  df-sb 1707  df-clab 2446  df-cleq 2452  df-clel 2455  df-nfc 2610  df-ral 2812  df-rex 2813  df-rab 2816  df-v 3108  df-dif 3472  df-un 3474  df-in 3476  df-ss 3483  df-nul 3779  df-if 3933  df-sn 4021  df-pr 4023  df-op 4027  df-uni 4239  df-br 4441  df-opab 4499  df-xp 4998  df-cnv 5000  df-dm 5002  df-rn 5003  df-res 5004  df-ima 5005  df-iota 5542  df-fv 5587  df-pred 28807  df-wrecs 28899
This theorem is referenced by:  wrecseq1  28902  wrecseq2  28903  wrecseq3  28904
  Copyright terms: Public domain W3C validator