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

Theorem rdg0 6658
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 4260 . . . . 5  |-  (/)  e.  _V
2 dmeq 4981 . . . . . . . 8  |-  ( g  =  (/)  ->  dom  g  =  dom  (/) )
3 fveq1 5694 . . . . . . . . 9  |-  ( g  =  (/)  ->  ( g `
 x )  =  ( (/) `  x ) )
43fveq2d 5699 . . . . . . . 8  |-  ( g  =  (/)  ->  ( F `
 ( g `  x ) )  =  ( F `  ( (/) `  x ) ) )
52, 4iuneq12d 4036 . . . . . . 7  |-  ( g  =  (/)  ->  U_ x  e.  dom  g ( F `
 ( g `  x ) )  = 
U_ x  e.  dom  (/) ( F `  ( (/) `  x ) ) )
65uneq2d 3383 . . . . . 6  |-  ( g  =  (/)  ->  ( A  u.  U_ x  e. 
dom  g ( F `
 ( g `  x ) ) )  =  ( A  u.  U_ x  e.  dom  (/) ( F `
 ( (/) `  x
) ) ) )
7 eqid 2238 . . . . . 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 4995 . . . . . . . . . 10  |-  dom  (/)  =  (/)
10 iuneq1 4025 . . . . . . . . . 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 4070 . . . . . . . . 9  |-  U_ x  e.  (/)  ( F `  ( (/) `  x ) )  =  (/)
1311, 12eqtri 2259 . . . . . . . 8  |-  U_ x  e.  dom  (/) ( F `  ( (/) `  x ) )  =  (/)
1413, 1eqeltri 2311 . . . . . . 7  |-  U_ x  e.  dom  (/) ( F `  ( (/) `  x ) )  e.  _V
158, 14unex 4587 . . . . . 6  |-  ( A  u.  U_ x  e. 
dom  (/) ( F `  ( (/) `  x ) ) )  e.  _V
166, 7, 15fvmpt 5782 . . . . 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 2311 . . 3  |-  ( ( g  e.  _V  |->  ( A  u.  U_ x  e.  dom  g ( F `
 ( g `  x ) ) ) ) `  (/) )  e. 
_V
19 df-irdg 6641 . . . 4  |-  rec ( F ,  A )  = recs ( ( g  e. 
_V  |->  ( A  u.  U_ x  e.  dom  g
( F `  (
g `  x )
) ) ) )
2019tfr0 6594 . . 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 3380 . . . 4  |-  ( A  u.  U_ x  e. 
dom  (/) ( F `  ( (/) `  x ) ) )  =  ( A  u.  (/) )
2317, 22eqtri 2259 . . 3  |-  ( ( g  e.  _V  |->  ( A  u.  U_ x  e.  dom  g ( F `
 ( g `  x ) ) ) ) `  (/) )  =  ( A  u.  (/) )
24 un0 3556 . . 3  |-  ( A  u.  (/) )  =  A
2523, 24eqtri 2259 . 2  |-  ( ( g  e.  _V  |->  ( A  u.  U_ x  e.  dom  g ( F `
 ( g `  x ) ) ) ) `  (/) )  =  A
2621, 25eqtri 2259 1  |-  ( rec ( F ,  A
) `  (/) )  =  A
Colors of variables:    wff set class
This proof depends on syntax axioms:    = wceq 1402    e. wcel 2209   _Vcvv 2821    u. cun 3218   (/)c0 3520   U_ciun 4012    |-> cmpt 4192   dom cdm 4774   ` cfv 5377   reccrdg 6640
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  ax-setind 4684
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-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  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-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  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  df-irdg 6641
This theorem is used by:  rdg0g  6659  om0  6731
  Copyright terms: Public domain W3C validator