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

Theorem rdg0 6390
Description: The initial value of the recursive definition generator. (Contributed by NM, 23-Apr-1995.) (Revised by Mario Carneiro, 14-Nov-2014.)
Hypothesis
Ref Expression
rdg.1  |-  A  e. 
_V
Assertion
Ref Expression
rdg0  |-  ( rec ( F ,  A
) `  (/) )  =  A

Proof of Theorem rdg0
Dummy variables  x  g are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0ex 4132 . . . . 5  |-  (/)  e.  _V
2 dmeq 4829 . . . . . . . 8  |-  ( g  =  (/)  ->  dom  g  =  dom  (/) )
3 fveq1 5516 . . . . . . . . 9  |-  ( g  =  (/)  ->  ( g `
 x )  =  ( (/) `  x ) )
43fveq2d 5521 . . . . . . . 8  |-  ( g  =  (/)  ->  ( F `
 ( g `  x ) )  =  ( F `  ( (/) `  x ) ) )
52, 4iuneq12d 3912 . . . . . . 7  |-  ( g  =  (/)  ->  U_ x  e.  dom  g ( F `
 ( g `  x ) )  = 
U_ x  e.  dom  (/) ( F `  ( (/) `  x ) ) )
65uneq2d 3291 . . . . . 6  |-  ( g  =  (/)  ->  ( A  u.  U_ x  e. 
dom  g ( F `
 ( g `  x ) ) )  =  ( A  u.  U_ x  e.  dom  (/) ( F `
 ( (/) `  x
) ) ) )
7 eqid 2177 . . . . . 6  |-  ( g  e.  _V  |->  ( A  u.  U_ x  e. 
dom  g ( F `
 ( g `  x ) ) ) )  =  ( g  e.  _V  |->  ( A  u.  U_ x  e. 
dom  g ( F `
 ( g `  x ) ) ) )
8 rdg.1 . . . . . . 7  |-  A  e. 
_V
9 dm0 4843 . . . . . . . . . 10  |-  dom  (/)  =  (/)
10 iuneq1 3901 . . . . . . . . . 10  |-  ( dom  (/)  =  (/)  ->  U_ x  e.  dom  (/) ( F `  ( (/) `  x ) )  =  U_ x  e.  (/)  ( F `  ( (/) `  x ) ) )
119, 10ax-mp 5 . . . . . . . . 9  |-  U_ x  e.  dom  (/) ( F `  ( (/) `  x ) )  =  U_ x  e.  (/)  ( F `  ( (/) `  x ) )
12 0iun 3946 . . . . . . . . 9  |-  U_ x  e.  (/)  ( F `  ( (/) `  x ) )  =  (/)
1311, 12eqtri 2198 . . . . . . . 8  |-  U_ x  e.  dom  (/) ( F `  ( (/) `  x ) )  =  (/)
1413, 1eqeltri 2250 . . . . . . 7  |-  U_ x  e.  dom  (/) ( F `  ( (/) `  x ) )  e.  _V
158, 14unex 4443 . . . . . 6  |-  ( A  u.  U_ x  e. 
dom  (/) ( F `  ( (/) `  x ) ) )  e.  _V
166, 7, 15fvmpt 5595 . . . . 5  |-  ( (/)  e.  _V  ->  ( (
g  e.  _V  |->  ( A  u.  U_ x  e.  dom  g ( F `
 ( g `  x ) ) ) ) `  (/) )  =  ( A  u.  U_ x  e.  dom  (/) ( F `
 ( (/) `  x
) ) ) )
171, 16ax-mp 5 . . . 4  |-  ( ( g  e.  _V  |->  ( A  u.  U_ x  e.  dom  g ( F `
 ( g `  x ) ) ) ) `  (/) )  =  ( A  u.  U_ x  e.  dom  (/) ( F `
 ( (/) `  x
) ) )
1817, 15eqeltri 2250 . . 3  |-  ( ( g  e.  _V  |->  ( A  u.  U_ x  e.  dom  g ( F `
 ( g `  x ) ) ) ) `  (/) )  e. 
_V
19 df-irdg 6373 . . . 4  |-  rec ( F ,  A )  = recs ( ( g  e. 
_V  |->  ( A  u.  U_ x  e.  dom  g
( F `  (
g `  x )
) ) ) )
2019tfr0 6326 . . 3  |-  ( ( ( g  e.  _V  |->  ( A  u.  U_ x  e.  dom  g ( F `
 ( g `  x ) ) ) ) `  (/) )  e. 
_V  ->  ( rec ( F ,  A ) `  (/) )  =  ( ( g  e.  _V  |->  ( A  u.  U_ x  e.  dom  g ( F `
 ( g `  x ) ) ) ) `  (/) ) )
2118, 20ax-mp 5 . 2  |-  ( rec ( F ,  A
) `  (/) )  =  ( ( g  e. 
_V  |->  ( A  u.  U_ x  e.  dom  g
( F `  (
g `  x )
) ) ) `  (/) )
2213uneq2i 3288 . . . 4  |-  ( A  u.  U_ x  e. 
dom  (/) ( F `  ( (/) `  x ) ) )  =  ( A  u.  (/) )
2317, 22eqtri 2198 . . 3  |-  ( ( g  e.  _V  |->  ( A  u.  U_ x  e.  dom  g ( F `
 ( g `  x ) ) ) ) `  (/) )  =  ( A  u.  (/) )
24 un0 3458 . . 3  |-  ( A  u.  (/) )  =  A
2523, 24eqtri 2198 . 2  |-  ( ( g  e.  _V  |->  ( A  u.  U_ x  e.  dom  g ( F `
 ( g `  x ) ) ) ) `  (/) )  =  A
2621, 25eqtri 2198 1  |-  ( rec ( F ,  A
) `  (/) )  =  A
Colors of variables: wff set class
Syntax hints:    = wceq 1353    e. wcel 2148   _Vcvv 2739    u. cun 3129   (/)c0 3424   U_ciun 3888    |-> cmpt 4066   dom cdm 4628   ` cfv 5218   reccrdg 6372
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-nul 4131  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-tr 4104  df-id 4295  df-iord 4368  df-on 4370  df-suc 4373  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-res 4640  df-iota 5180  df-fun 5220  df-fn 5221  df-fv 5226  df-recs 6308  df-irdg 6373
This theorem is referenced by:  rdg0g  6391  om0  6461
  Copyright terms: Public domain W3C validator