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

Theorem tfrlemisucfn 6382
Description: We can extend an acceptable function by one element to produce a function. Lemma for tfrlemi1 6390. (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 2766 . . 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 6370 . . 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 2196 . 2  |-  ( g  u.  { <. z ,  ( F `  g ) >. } )  =  ( g  u. 
{ <. z ,  ( F `  g )
>. } )
8 df-suc 4406 . 2  |-  suc  z  =  ( z  u. 
{ z } )
9 elirrv 4584 . . 3  |-  -.  z  e.  z
109a1i 9 . 2  |-  ( ph  ->  -.  z  e.  z )
112, 5, 6, 7, 8, 10fnunsn 5365 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 1362    = wceq 1364    e. wcel 2167   {cab 2182   A.wral 2475   E.wrex 2476   _Vcvv 2763    u. cun 3155   {csn 3622   <.cop 3625   Oncon0 4398   suc csuc 4400    |` cres 4665   Fun wfun 5252    Fn wfn 5253   ` cfv 5258
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-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242  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-v 2765  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-br 4034  df-opab 4095  df-id 4328  df-suc 4406  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-iota 5219  df-fun 5260  df-fn 5261  df-fv 5266
This theorem is referenced by:  tfrlemisucaccv  6383  tfrlemibfn  6386
  Copyright terms: Public domain W3C validator