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

Theorem tfr0dm 6593
Description: Transfinite recursion is defined at the empty set. (Contributed by Jim Kingdon, 8-Mar-2022.)
Hypothesis
Ref Expression
tfr.1  |-  F  = recs ( G )
Assertion
Ref Expression
tfr0dm  |-  ( ( G `  (/) )  e.  V  ->  (/)  e.  dom  F )

Proof of Theorem tfr0dm
Dummy variables  x  f  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0ex 4260 . . . . 5  |-  (/)  e.  _V
2 opexg 4368 . . . . 5  |-  ( (
(/)  e.  _V  /\  ( G `  (/) )  e.  V )  ->  <. (/) ,  ( G `  (/) ) >.  e.  _V )
31, 2mpan 428 . . . 4  |-  ( ( G `  (/) )  e.  V  ->  <. (/) ,  ( G `  (/) ) >.  e.  _V )
4 snidg 3738 . . . 4  |-  ( <. (/)
,  ( G `  (/) ) >.  e.  _V  -> 
<. (/) ,  ( G `
 (/) ) >.  e.  { <.
(/) ,  ( G `  (/) ) >. } )
53, 4syl 14 . . 3  |-  ( ( G `  (/) )  e.  V  ->  <. (/) ,  ( G `  (/) ) >.  e.  { <. (/) ,  ( G `
 (/) ) >. } )
6 fnsng 5428 . . . . 5  |-  ( (
(/)  e.  _V  /\  ( G `  (/) )  e.  V )  ->  { <. (/)
,  ( G `  (/) ) >. }  Fn  { (/)
} )
71, 6mpan 428 . . . 4  |-  ( ( G `  (/) )  e.  V  ->  { <. (/) ,  ( G `  (/) ) >. }  Fn  { (/) } )
8 fvsng 5911 . . . . . . 7  |-  ( (
(/)  e.  _V  /\  ( G `  (/) )  e.  V )  ->  ( { <. (/) ,  ( G `
 (/) ) >. } `  (/) )  =  ( G `
 (/) ) )
91, 8mpan 428 . . . . . 6  |-  ( ( G `  (/) )  e.  V  ->  ( { <.
(/) ,  ( G `  (/) ) >. } `  (/) )  =  ( G `
 (/) ) )
10 res0 5067 . . . . . . 7  |-  ( {
<. (/) ,  ( G `
 (/) ) >. }  |`  (/) )  =  (/)
1110fveq2i 5698 . . . . . 6  |-  ( G `
 ( { <. (/)
,  ( G `  (/) ) >. }  |`  (/) ) )  =  ( G `  (/) )
129, 11eqtr4di 2289 . . . . 5  |-  ( ( G `  (/) )  e.  V  ->  ( { <.
(/) ,  ( G `  (/) ) >. } `  (/) )  =  ( G `
 ( { <. (/)
,  ( G `  (/) ) >. }  |`  (/) ) ) )
13 fveq2 5695 . . . . . . 7  |-  ( y  =  (/)  ->  ( {
<. (/) ,  ( G `
 (/) ) >. } `  y )  =  ( { <. (/) ,  ( G `
 (/) ) >. } `  (/) ) )
14 reseq2 5058 . . . . . . . 8  |-  ( y  =  (/)  ->  ( {
<. (/) ,  ( G `
 (/) ) >. }  |`  y
)  =  ( {
<. (/) ,  ( G `
 (/) ) >. }  |`  (/) ) )
1514fveq2d 5699 . . . . . . 7  |-  ( y  =  (/)  ->  ( G `
 ( { <. (/)
,  ( G `  (/) ) >. }  |`  y
) )  =  ( G `  ( {
<. (/) ,  ( G `
 (/) ) >. }  |`  (/) ) ) )
1613, 15eqeq12d 2253 . . . . . 6  |-  ( y  =  (/)  ->  ( ( { <. (/) ,  ( G `
 (/) ) >. } `  y )  =  ( G `  ( {
<. (/) ,  ( G `
 (/) ) >. }  |`  y
) )  <->  ( { <.
(/) ,  ( G `  (/) ) >. } `  (/) )  =  ( G `
 ( { <. (/)
,  ( G `  (/) ) >. }  |`  (/) ) ) ) )
171, 16ralsn 3752 . . . . 5  |-  ( A. y  e.  { (/) }  ( { <. (/) ,  ( G `
 (/) ) >. } `  y )  =  ( G `  ( {
<. (/) ,  ( G `
 (/) ) >. }  |`  y
) )  <->  ( { <.
(/) ,  ( G `  (/) ) >. } `  (/) )  =  ( G `
 ( { <. (/)
,  ( G `  (/) ) >. }  |`  (/) ) ) )
1812, 17sylibr 134 . . . 4  |-  ( ( G `  (/) )  e.  V  ->  A. y  e.  { (/) }  ( {
<. (/) ,  ( G `
 (/) ) >. } `  y )  =  ( G `  ( {
<. (/) ,  ( G `
 (/) ) >. }  |`  y
) ) )
19 suc0 4556 . . . . . 6  |-  suc  (/)  =  { (/)
}
20 0elon 4537 . . . . . . 7  |-  (/)  e.  On
2120onsuci 4663 . . . . . 6  |-  suc  (/)  e.  On
2219, 21eqeltrri 2312 . . . . 5  |-  { (/) }  e.  On
23 fneq2 5470 . . . . . . 7  |-  ( x  =  { (/) }  ->  ( { <. (/) ,  ( G `
 (/) ) >. }  Fn  x 
<->  { <. (/) ,  ( G `
 (/) ) >. }  Fn  {
(/) } ) )
24 raleq 2749 . . . . . . 7  |-  ( x  =  { (/) }  ->  ( A. y  e.  x  ( { <. (/) ,  ( G `
 (/) ) >. } `  y )  =  ( G `  ( {
<. (/) ,  ( G `
 (/) ) >. }  |`  y
) )  <->  A. y  e.  { (/) }  ( {
<. (/) ,  ( G `
 (/) ) >. } `  y )  =  ( G `  ( {
<. (/) ,  ( G `
 (/) ) >. }  |`  y
) ) ) )
2523, 24anbi12d 477 . . . . . 6  |-  ( x  =  { (/) }  ->  ( ( { <. (/) ,  ( G `  (/) ) >. }  Fn  x  /\  A. y  e.  x  ( { <. (/) ,  ( G `
 (/) ) >. } `  y )  =  ( G `  ( {
<. (/) ,  ( G `
 (/) ) >. }  |`  y
) ) )  <->  ( { <.
(/) ,  ( G `  (/) ) >. }  Fn  {
(/) }  /\  A. y  e.  { (/) }  ( {
<. (/) ,  ( G `
 (/) ) >. } `  y )  =  ( G `  ( {
<. (/) ,  ( G `
 (/) ) >. }  |`  y
) ) ) ) )
2625rspcev 2929 . . . . 5  |-  ( ( { (/) }  e.  On  /\  ( { <. (/) ,  ( G `  (/) ) >. }  Fn  { (/) }  /\  A. y  e.  { (/) }  ( { <. (/) ,  ( G `  (/) ) >. } `  y )  =  ( G `  ( { <. (/) ,  ( G `
 (/) ) >. }  |`  y
) ) ) )  ->  E. x  e.  On  ( { <. (/) ,  ( G `
 (/) ) >. }  Fn  x  /\  A. y  e.  x  ( { <. (/)
,  ( G `  (/) ) >. } `  y
)  =  ( G `
 ( { <. (/)
,  ( G `  (/) ) >. }  |`  y
) ) ) )
2722, 26mpan 428 . . . 4  |-  ( ( { <. (/) ,  ( G `
 (/) ) >. }  Fn  {
(/) }  /\  A. y  e.  { (/) }  ( {
<. (/) ,  ( G `
 (/) ) >. } `  y )  =  ( G `  ( {
<. (/) ,  ( G `
 (/) ) >. }  |`  y
) ) )  ->  E. x  e.  On  ( { <. (/) ,  ( G `
 (/) ) >. }  Fn  x  /\  A. y  e.  x  ( { <. (/)
,  ( G `  (/) ) >. } `  y
)  =  ( G `
 ( { <. (/)
,  ( G `  (/) ) >. }  |`  y
) ) ) )
287, 18, 27syl2anc 415 . . 3  |-  ( ( G `  (/) )  e.  V  ->  E. x  e.  On  ( { <. (/)
,  ( G `  (/) ) >. }  Fn  x  /\  A. y  e.  x  ( { <. (/) ,  ( G `
 (/) ) >. } `  y )  =  ( G `  ( {
<. (/) ,  ( G `
 (/) ) >. }  |`  y
) ) ) )
29 snexg 4321 . . . . 5  |-  ( <. (/)
,  ( G `  (/) ) >.  e.  _V  ->  { <. (/) ,  ( G `
 (/) ) >. }  e.  _V )
30 eleq2 2302 . . . . . . 7  |-  ( f  =  { <. (/) ,  ( G `  (/) ) >. }  ->  ( <. (/) ,  ( G `  (/) ) >.  e.  f  <->  <. (/) ,  ( G `
 (/) ) >.  e.  { <.
(/) ,  ( G `  (/) ) >. } ) )
31 fneq1 5469 . . . . . . . . 9  |-  ( f  =  { <. (/) ,  ( G `  (/) ) >. }  ->  ( f  Fn  x  <->  { <. (/) ,  ( G `
 (/) ) >. }  Fn  x ) )
32 fveq1 5694 . . . . . . . . . . 11  |-  ( f  =  { <. (/) ,  ( G `  (/) ) >. }  ->  ( f `  y )  =  ( { <. (/) ,  ( G `
 (/) ) >. } `  y ) )
33 reseq1 5057 . . . . . . . . . . . 12  |-  ( f  =  { <. (/) ,  ( G `  (/) ) >. }  ->  ( f  |`  y )  =  ( { <. (/) ,  ( G `
 (/) ) >. }  |`  y
) )
3433fveq2d 5699 . . . . . . . . . . 11  |-  ( f  =  { <. (/) ,  ( G `  (/) ) >. }  ->  ( G `  ( f  |`  y
) )  =  ( G `  ( {
<. (/) ,  ( G `
 (/) ) >. }  |`  y
) ) )
3532, 34eqeq12d 2253 . . . . . . . . . 10  |-  ( f  =  { <. (/) ,  ( G `  (/) ) >. }  ->  ( ( f `
 y )  =  ( G `  (
f  |`  y ) )  <-> 
( { <. (/) ,  ( G `  (/) ) >. } `  y )  =  ( G `  ( { <. (/) ,  ( G `
 (/) ) >. }  |`  y
) ) ) )
3635ralbidv 2550 . . . . . . . . 9  |-  ( f  =  { <. (/) ,  ( G `  (/) ) >. }  ->  ( A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) )  <->  A. y  e.  x  ( { <.
(/) ,  ( G `  (/) ) >. } `  y )  =  ( G `  ( {
<. (/) ,  ( G `
 (/) ) >. }  |`  y
) ) ) )
3731, 36anbi12d 477 . . . . . . . 8  |-  ( f  =  { <. (/) ,  ( G `  (/) ) >. }  ->  ( ( f  Fn  x  /\  A. y  e.  x  (
f `  y )  =  ( G `  ( f  |`  y
) ) )  <->  ( { <.
(/) ,  ( G `  (/) ) >. }  Fn  x  /\  A. y  e.  x  ( { <. (/)
,  ( G `  (/) ) >. } `  y
)  =  ( G `
 ( { <. (/)
,  ( G `  (/) ) >. }  |`  y
) ) ) ) )
3837rexbidv 2551 . . . . . . 7  |-  ( f  =  { <. (/) ,  ( G `  (/) ) >. }  ->  ( E. x  e.  On  ( f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) )  <->  E. x  e.  On  ( { <. (/) ,  ( G `
 (/) ) >. }  Fn  x  /\  A. y  e.  x  ( { <. (/)
,  ( G `  (/) ) >. } `  y
)  =  ( G `
 ( { <. (/)
,  ( G `  (/) ) >. }  |`  y
) ) ) ) )
3930, 38anbi12d 477 . . . . . 6  |-  ( f  =  { <. (/) ,  ( G `  (/) ) >. }  ->  ( ( <. (/)
,  ( G `  (/) ) >.  e.  f  /\  E. x  e.  On  ( f  Fn  x  /\  A. y  e.  x  ( f `  y
)  =  ( G `
 ( f  |`  y ) ) ) )  <->  ( <. (/) ,  ( G `  (/) ) >.  e.  { <. (/) ,  ( G `
 (/) ) >. }  /\  E. x  e.  On  ( { <. (/) ,  ( G `
 (/) ) >. }  Fn  x  /\  A. y  e.  x  ( { <. (/)
,  ( G `  (/) ) >. } `  y
)  =  ( G `
 ( { <. (/)
,  ( G `  (/) ) >. }  |`  y
) ) ) ) ) )
4039spcegv 2913 . . . . 5  |-  ( {
<. (/) ,  ( G `
 (/) ) >. }  e.  _V  ->  ( ( <. (/)
,  ( G `  (/) ) >.  e.  { <. (/)
,  ( G `  (/) ) >. }  /\  E. x  e.  On  ( { <. (/) ,  ( G `
 (/) ) >. }  Fn  x  /\  A. y  e.  x  ( { <. (/)
,  ( G `  (/) ) >. } `  y
)  =  ( G `
 ( { <. (/)
,  ( G `  (/) ) >. }  |`  y
) ) ) )  ->  E. f ( <. (/)
,  ( G `  (/) ) >.  e.  f  /\  E. x  e.  On  ( f  Fn  x  /\  A. y  e.  x  ( f `  y
)  =  ( G `
 ( f  |`  y ) ) ) ) ) )
413, 29, 403syl 17 . . . 4  |-  ( ( G `  (/) )  e.  V  ->  ( ( <.
(/) ,  ( G `  (/) ) >.  e.  { <.
(/) ,  ( G `  (/) ) >. }  /\  E. x  e.  On  ( { <. (/) ,  ( G `
 (/) ) >. }  Fn  x  /\  A. y  e.  x  ( { <. (/)
,  ( G `  (/) ) >. } `  y
)  =  ( G `
 ( { <. (/)
,  ( G `  (/) ) >. }  |`  y
) ) ) )  ->  E. f ( <. (/)
,  ( G `  (/) ) >.  e.  f  /\  E. x  e.  On  ( f  Fn  x  /\  A. y  e.  x  ( f `  y
)  =  ( G `
 ( f  |`  y ) ) ) ) ) )
42 tfr.1 . . . . . 6  |-  F  = recs ( G )
4342eleq2i 2305 . . . . 5  |-  ( <. (/)
,  ( G `  (/) ) >.  e.  F  <->  <. (/)
,  ( G `  (/) ) >.  e. recs ( G ) )
44 df-recs 6576 . . . . . 6  |- recs ( G )  =  U. {
f  |  E. x  e.  On  ( f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }
4544eleq2i 2305 . . . . 5  |-  ( <. (/)
,  ( G `  (/) ) >.  e. recs ( G )  <->  <. (/) ,  ( G `
 (/) ) >.  e.  U. { f  |  E. x  e.  On  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y
) ) ) } )
46 eluniab 3947 . . . . 5  |-  ( <. (/)
,  ( G `  (/) ) >.  e.  U. {
f  |  E. x  e.  On  ( f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }  <->  E. f ( <. (/)
,  ( G `  (/) ) >.  e.  f  /\  E. x  e.  On  ( f  Fn  x  /\  A. y  e.  x  ( f `  y
)  =  ( G `
 ( f  |`  y ) ) ) ) )
4743, 45, 463bitri 206 . . . 4  |-  ( <. (/)
,  ( G `  (/) ) >.  e.  F  <->  E. f ( <. (/) ,  ( G `  (/) ) >.  e.  f  /\  E. x  e.  On  ( f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) ) )
4841, 47imbitrrdi 162 . . 3  |-  ( ( G `  (/) )  e.  V  ->  ( ( <.
(/) ,  ( G `  (/) ) >.  e.  { <.
(/) ,  ( G `  (/) ) >. }  /\  E. x  e.  On  ( { <. (/) ,  ( G `
 (/) ) >. }  Fn  x  /\  A. y  e.  x  ( { <. (/)
,  ( G `  (/) ) >. } `  y
)  =  ( G `
 ( { <. (/)
,  ( G `  (/) ) >. }  |`  y
) ) ) )  ->  <. (/) ,  ( G `
 (/) ) >.  e.  F
) )
495, 28, 48mp2and 437 . 2  |-  ( ( G `  (/) )  e.  V  ->  <. (/) ,  ( G `  (/) ) >.  e.  F )
50 opeldmg 4986 . . 3  |-  ( (
(/)  e.  _V  /\  ( G `  (/) )  e.  V )  ->  ( <.
(/) ,  ( G `  (/) ) >.  e.  F  -> 
(/)  e.  dom  F ) )
511, 50mpan 428 . 2  |-  ( ( G `  (/) )  e.  V  ->  ( <. (/)
,  ( G `  (/) ) >.  e.  F  -> 
(/)  e.  dom  F ) )
5249, 51mpd 13 1  |-  ( ( G `  (/) )  e.  V  ->  (/)  e.  dom  F )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    = wceq 1402   E.wex 1545    e. wcel 2209   {cab 2224   A.wral 2528   E.wrex 2529   _Vcvv 2821   (/)c0 3520   {csn 3709   <.cop 3712   U.cuni 3935   Oncon0 4508   suc csuc 4510   dom cdm 4774    |` cres 4776    Fn wfn 5372   ` cfv 5377  recscrecs 6575
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-recs 6576
This theorem is used by:  tfr0  6594
  Copyright terms: Public domain W3C validator