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

Theorem tfrlemisucfn 6555
Description: We can extend an acceptable function by one element to produce a function. Lemma for tfrlemi1 6563. (Contributed by Jim Kingdon, 2-Jul-2019.)
Hypotheses
Ref Expression
tfrlemisucfn.1  |-  A  =  { f  |  E. x  e.  On  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  y
) ) ) }
tfrlemisucfn.2  |-  ( ph  ->  A. x ( Fun 
F  /\  ( F `  x )  e.  _V ) )
tfrlemisucfn.3  |-  ( ph  ->  z  e.  On )
tfrlemisucfn.4  |-  ( ph  ->  g  Fn  z )
tfrlemisucfn.5  |-  ( ph  ->  g  e.  A )
Assertion
Ref Expression
tfrlemisucfn  |-  ( ph  ->  ( g  u.  { <. z ,  ( F `
 g ) >. } )  Fn  suc  z )
Distinct variable groups:    f, g, x, y, z, A    f, F, g, x, y, z    ph, y
Allowed substitution hints:    ph( x, z, f, g)

Proof of Theorem tfrlemisucfn
StepHypRef Expression
1 vex 2816 . . 3  |-  z  e. 
_V
21a1i 9 . 2  |-  ( ph  ->  z  e.  _V )
3 tfrlemisucfn.2 . . . 4  |-  ( ph  ->  A. x ( Fun 
F  /\  ( F `  x )  e.  _V ) )
43tfrlem3-2d 6543 . . 3  |-  ( ph  ->  ( Fun  F  /\  ( F `  g )  e.  _V ) )
54simprd 114 . 2  |-  ( ph  ->  ( F `  g
)  e.  _V )
6 tfrlemisucfn.4 . 2  |-  ( ph  ->  g  Fn  z )
7 eqid 2232 . 2  |-  ( g  u.  { <. z ,  ( F `  g ) >. } )  =  ( g  u. 
{ <. z ,  ( F `  g )
>. } )
8 df-suc 4492 . 2  |-  suc  z  =  ( z  u. 
{ z } )
9 elirrv 4670 . . 3  |-  -.  z  e.  z
109a1i 9 . 2  |-  ( ph  ->  -.  z  e.  z )
112, 5, 6, 7, 8, 10fnunsn 5465 1  |-  ( ph  ->  ( g  u.  { <. z ,  ( F `
 g ) >. } )  Fn  suc  z )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104   A.wal 1396    = wceq 1398    e. wcel 2203   {cab 2218   A.wral 2520   E.wrex 2521   _Vcvv 2813    u. cun 3209   {csn 3689   <.cop 3692   Oncon0 4484   suc csuc 4486    |` cres 4751   Fun wfun 5346    Fn wfn 5347   ` cfv 5352
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-setind 4659
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-v 2815  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-id 4414  df-suc 4492  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-iota 5312  df-fun 5354  df-fn 5355  df-fv 5360
This theorem is referenced by:  tfrlemisucaccv  6556  tfrlemibfn  6559
  Copyright terms: Public domain W3C validator