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

Theorem tfr1onlemsucfn 6611
Description: We can extend an acceptable function by one element to produce a function. Lemma for tfr1on 6621. (Contributed by Jim Kingdon, 12-Mar-2022.)
Hypotheses
Ref Expression
tfr1on.f  |-  F  = recs ( G )
tfr1on.g  |-  ( ph  ->  Fun  G )
tfr1on.x  |-  ( ph  ->  Ord  X )
tfr1on.ex  |-  ( (
ph  /\  x  e.  X  /\  f  Fn  x
)  ->  ( G `  f )  e.  _V )
tfr1onlemsucfn.1  |-  A  =  { f  |  E. x  e.  X  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y
) ) ) }
tfr1onlemsucfn.3  |-  ( ph  ->  z  e.  X )
tfr1onlemsucfn.4  |-  ( ph  ->  g  Fn  z )
tfr1onlemsucfn.5  |-  ( ph  ->  g  e.  A )
Assertion
Ref Expression
tfr1onlemsucfn  |-  ( ph  ->  ( g  u.  { <. z ,  ( G `
 g ) >. } )  Fn  suc  z )
Distinct variable groups:    f, G, x   
f, X, x    f,
g    ph, f, x    z,
f, x
Allowed substitution hints:    ph( y,  z,  g)    A( x,  y,  z,  f,  g)    F( x,  y,  z,  f,  g)    G( y,  z,  g)    X( y,  z,  g)

Proof of Theorem tfr1onlemsucfn
StepHypRef Expression
1 tfr1onlemsucfn.3 . . 3  |-  ( ph  ->  z  e.  X )
21elexd 2835 . 2  |-  ( ph  ->  z  e.  _V )
3 fneq2 5470 . . . . . 6  |-  ( x  =  z  ->  (
f  Fn  x  <->  f  Fn  z ) )
43imbi1d 231 . . . . 5  |-  ( x  =  z  ->  (
( f  Fn  x  ->  ( G `  f
)  e.  _V )  <->  ( f  Fn  z  -> 
( G `  f
)  e.  _V )
) )
54albidv 1877 . . . 4  |-  ( x  =  z  ->  ( A. f ( f  Fn  x  ->  ( G `  f )  e.  _V ) 
<-> 
A. f ( f  Fn  z  ->  ( G `  f )  e.  _V ) ) )
6 tfr1on.ex . . . . . . 7  |-  ( (
ph  /\  x  e.  X  /\  f  Fn  x
)  ->  ( G `  f )  e.  _V )
763expia 1236 . . . . . 6  |-  ( (
ph  /\  x  e.  X )  ->  (
f  Fn  x  -> 
( G `  f
)  e.  _V )
)
87alrimiv 1927 . . . . 5  |-  ( (
ph  /\  x  e.  X )  ->  A. f
( f  Fn  x  ->  ( G `  f
)  e.  _V )
)
98ralrimiva 2623 . . . 4  |-  ( ph  ->  A. x  e.  X  A. f ( f  Fn  x  ->  ( G `  f )  e.  _V ) )
105, 9, 1rspcdva 2934 . . 3  |-  ( ph  ->  A. f ( f  Fn  z  ->  ( G `  f )  e.  _V ) )
11 tfr1onlemsucfn.4 . . 3  |-  ( ph  ->  g  Fn  z )
12 fneq1 5469 . . . . 5  |-  ( f  =  g  ->  (
f  Fn  z  <->  g  Fn  z ) )
13 fveq2 5695 . . . . . 6  |-  ( f  =  g  ->  ( G `  f )  =  ( G `  g ) )
1413eleq1d 2307 . . . . 5  |-  ( f  =  g  ->  (
( G `  f
)  e.  _V  <->  ( G `  g )  e.  _V ) )
1512, 14imbi12d 234 . . . 4  |-  ( f  =  g  ->  (
( f  Fn  z  ->  ( G `  f
)  e.  _V )  <->  ( g  Fn  z  -> 
( G `  g
)  e.  _V )
) )
1615spv 1913 . . 3  |-  ( A. f ( f  Fn  z  ->  ( G `  f )  e.  _V )  ->  ( g  Fn  z  ->  ( G `  g )  e.  _V ) )
1710, 11, 16sylc 62 . 2  |-  ( ph  ->  ( G `  g
)  e.  _V )
18 eqid 2238 . 2  |-  ( g  u.  { <. z ,  ( G `  g ) >. } )  =  ( g  u. 
{ <. z ,  ( G `  g )
>. } )
19 df-suc 4516 . 2  |-  suc  z  =  ( z  u. 
{ z } )
20 tfr1on.x . . . 4  |-  ( ph  ->  Ord  X )
21 ordelon 4528 . . . 4  |-  ( ( Ord  X  /\  z  e.  X )  ->  z  e.  On )
2220, 1, 21syl2anc 415 . . 3  |-  ( ph  ->  z  e.  On )
23 eloni 4520 . . 3  |-  ( z  e.  On  ->  Ord  z )
24 ordirr 4689 . . 3  |-  ( Ord  z  ->  -.  z  e.  z )
2522, 23, 243syl 17 . 2  |-  ( ph  ->  -.  z  e.  z )
262, 17, 11, 18, 19, 25fnunsn 5490 1  |-  ( ph  ->  ( g  u.  { <. z ,  ( G `
 g ) >. } )  Fn  suc  z )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -. wn 3    -> wi 4    /\ wa 104    /\ w3a 1009   A.wal 1400    = wceq 1402    e. wcel 2209   {cab 2224   A.wral 2528   E.wrex 2529   _Vcvv 2821    u. cun 3218   {csn 3709   <.cop 3712   Ord word 4507   Oncon0 4508   suc csuc 4510    |` cres 4776   Fun wfun 5371    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-pow 4311  ax-pr 4346  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-ne 2421  df-ral 2533  df-rex 2534  df-v 2823  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-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385
This theorem is used by:  tfr1onlemsucaccv  6612  tfr1onlembfn  6615
  Copyright terms: Public domain W3C validator