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

Theorem rdgss 6441
Description: Subset and recursive definition generator. (Contributed by Jim Kingdon, 15-Jul-2019.)
Hypotheses
Ref Expression
rdgss.1  |-  ( ph  ->  F  Fn  _V )
rdgss.2  |-  ( ph  ->  I  e.  V )
rdgss.3  |-  ( ph  ->  A  e.  On )
rdgss.4  |-  ( ph  ->  B  e.  On )
rdgss.5  |-  ( ph  ->  A  C_  B )
Assertion
Ref Expression
rdgss  |-  ( ph  ->  ( rec ( F ,  I ) `  A )  C_  ( rec ( F ,  I
) `  B )
)

Proof of Theorem rdgss
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rdgss.5 . . . 4  |-  ( ph  ->  A  C_  B )
2 ssel 3177 . . . . . 6  |-  ( A 
C_  B  ->  (
x  e.  A  ->  x  e.  B )
)
3 ssid 3203 . . . . . . 7  |-  ( F `
 ( rec ( F ,  I ) `  x ) )  C_  ( F `  ( rec ( F ,  I
) `  x )
)
4 fveq2 5558 . . . . . . . . . 10  |-  ( y  =  x  ->  ( rec ( F ,  I
) `  y )  =  ( rec ( F ,  I ) `  x ) )
54fveq2d 5562 . . . . . . . . 9  |-  ( y  =  x  ->  ( F `  ( rec ( F ,  I ) `
 y ) )  =  ( F `  ( rec ( F ,  I ) `  x
) ) )
65sseq2d 3213 . . . . . . . 8  |-  ( y  =  x  ->  (
( F `  ( rec ( F ,  I
) `  x )
)  C_  ( F `  ( rec ( F ,  I ) `  y ) )  <->  ( F `  ( rec ( F ,  I ) `  x ) )  C_  ( F `  ( rec ( F ,  I
) `  x )
) ) )
76rspcev 2868 . . . . . . 7  |-  ( ( x  e.  B  /\  ( F `  ( rec ( F ,  I
) `  x )
)  C_  ( F `  ( rec ( F ,  I ) `  x ) ) )  ->  E. y  e.  B  ( F `  ( rec ( F ,  I
) `  x )
)  C_  ( F `  ( rec ( F ,  I ) `  y ) ) )
83, 7mpan2 425 . . . . . 6  |-  ( x  e.  B  ->  E. y  e.  B  ( F `  ( rec ( F ,  I ) `  x ) )  C_  ( F `  ( rec ( F ,  I
) `  y )
) )
92, 8syl6 33 . . . . 5  |-  ( A 
C_  B  ->  (
x  e.  A  ->  E. y  e.  B  ( F `  ( rec ( F ,  I
) `  x )
)  C_  ( F `  ( rec ( F ,  I ) `  y ) ) ) )
109ralrimiv 2569 . . . 4  |-  ( A 
C_  B  ->  A. x  e.  A  E. y  e.  B  ( F `  ( rec ( F ,  I ) `  x ) )  C_  ( F `  ( rec ( F ,  I
) `  y )
) )
111, 10syl 14 . . 3  |-  ( ph  ->  A. x  e.  A  E. y  e.  B  ( F `  ( rec ( F ,  I
) `  x )
)  C_  ( F `  ( rec ( F ,  I ) `  y ) ) )
12 iunss2 3961 . . 3  |-  ( A. x  e.  A  E. y  e.  B  ( F `  ( rec ( F ,  I ) `
 x ) ) 
C_  ( F `  ( rec ( F ,  I ) `  y
) )  ->  U_ x  e.  A  ( F `  ( rec ( F ,  I ) `  x ) )  C_  U_ y  e.  B  ( F `  ( rec ( F ,  I
) `  y )
) )
13 unss2 3334 . . 3  |-  ( U_ x  e.  A  ( F `  ( rec ( F ,  I ) `
 x ) ) 
C_  U_ y  e.  B  ( F `  ( rec ( F ,  I
) `  y )
)  ->  ( I  u.  U_ x  e.  A  ( F `  ( rec ( F ,  I
) `  x )
) )  C_  (
I  u.  U_ y  e.  B  ( F `  ( rec ( F ,  I ) `  y ) ) ) )
1411, 12, 133syl 17 . 2  |-  ( ph  ->  ( I  u.  U_ x  e.  A  ( F `  ( rec ( F ,  I ) `
 x ) ) )  C_  ( I  u.  U_ y  e.  B  ( F `  ( rec ( F ,  I
) `  y )
) ) )
15 rdgss.1 . . 3  |-  ( ph  ->  F  Fn  _V )
16 rdgss.2 . . 3  |-  ( ph  ->  I  e.  V )
17 rdgss.3 . . 3  |-  ( ph  ->  A  e.  On )
18 rdgival 6440 . . 3  |-  ( ( F  Fn  _V  /\  I  e.  V  /\  A  e.  On )  ->  ( rec ( F ,  I ) `  A )  =  ( I  u.  U_ x  e.  A  ( F `  ( rec ( F ,  I ) `  x ) ) ) )
1915, 16, 17, 18syl3anc 1249 . 2  |-  ( ph  ->  ( rec ( F ,  I ) `  A )  =  ( I  u.  U_ x  e.  A  ( F `  ( rec ( F ,  I ) `  x ) ) ) )
20 rdgss.4 . . 3  |-  ( ph  ->  B  e.  On )
21 rdgival 6440 . . 3  |-  ( ( F  Fn  _V  /\  I  e.  V  /\  B  e.  On )  ->  ( rec ( F ,  I ) `  B )  =  ( I  u.  U_ y  e.  B  ( F `  ( rec ( F ,  I ) `  y ) ) ) )
2215, 16, 20, 21syl3anc 1249 . 2  |-  ( ph  ->  ( rec ( F ,  I ) `  B )  =  ( I  u.  U_ y  e.  B  ( F `  ( rec ( F ,  I ) `  y ) ) ) )
2314, 19, 223sstr4d 3228 1  |-  ( ph  ->  ( rec ( F ,  I ) `  A )  C_  ( rec ( F ,  I
) `  B )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1364    e. wcel 2167   A.wral 2475   E.wrex 2476   _Vcvv 2763    u. cun 3155    C_ wss 3157   U_ciun 3916   Oncon0 4398    Fn wfn 5253   ` cfv 5258   reccrdg 6427
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-tr 4132  df-id 4328  df-iord 4401  df-on 4403  df-suc 4406  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-recs 6363  df-irdg 6428
This theorem is referenced by:  oawordi  6527
  Copyright terms: Public domain W3C validator