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

Theorem tfrcllemsucfn 6518
Description: We can extend an acceptable function by one element to produce a function. Lemma for tfrcl 6529. (Contributed by Jim Kingdon, 24-Mar-2022.)
Hypotheses
Ref Expression
tfrcl.f  |-  F  = recs ( G )
tfrcl.g  |-  ( ph  ->  Fun  G )
tfrcl.x  |-  ( ph  ->  Ord  X )
tfrcl.ex  |-  ( (
ph  /\  x  e.  X  /\  f : x --> S )  ->  ( G `  f )  e.  S )
tfrcllemsucfn.1  |-  A  =  { f  |  E. x  e.  X  (
f : x --> S  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y
) ) ) }
tfrcllemsucfn.3  |-  ( ph  ->  z  e.  X )
tfrcllemsucfn.4  |-  ( ph  ->  g : z --> S )
tfrcllemsucfn.5  |-  ( ph  ->  g  e.  A )
Assertion
Ref Expression
tfrcllemsucfn  |-  ( ph  ->  ( g  u.  { <. z ,  ( G `
 g ) >. } ) : suc  z
--> S )
Distinct variable groups:    f, G, x    S, f, 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)    S( y, z, g)    F( x, y, z, f, g)    G( y, z, g)    X( y, z, g)

Proof of Theorem tfrcllemsucfn
StepHypRef Expression
1 tfrcllemsucfn.4 . . 3  |-  ( ph  ->  g : z --> S )
2 tfrcllemsucfn.3 . . . 4  |-  ( ph  ->  z  e.  X )
32elexd 2816 . . 3  |-  ( ph  ->  z  e.  _V )
4 tfrcl.x . . . . 5  |-  ( ph  ->  Ord  X )
5 ordelon 4480 . . . . 5  |-  ( ( Ord  X  /\  z  e.  X )  ->  z  e.  On )
64, 2, 5syl2anc 411 . . . 4  |-  ( ph  ->  z  e.  On )
7 eloni 4472 . . . 4  |-  ( z  e.  On  ->  Ord  z )
8 ordirr 4640 . . . 4  |-  ( Ord  z  ->  -.  z  e.  z )
96, 7, 83syl 17 . . 3  |-  ( ph  ->  -.  z  e.  z )
10 feq2 5466 . . . . . . 7  |-  ( x  =  z  ->  (
f : x --> S  <->  f :
z --> S ) )
1110imbi1d 231 . . . . . 6  |-  ( x  =  z  ->  (
( f : x --> S  ->  ( G `  f )  e.  S
)  <->  ( f : z --> S  ->  ( G `  f )  e.  S ) ) )
1211albidv 1872 . . . . 5  |-  ( x  =  z  ->  ( A. f ( f : x --> S  ->  ( G `  f )  e.  S )  <->  A. f
( f : z --> S  ->  ( G `  f )  e.  S
) ) )
13 tfrcl.ex . . . . . . . 8  |-  ( (
ph  /\  x  e.  X  /\  f : x --> S )  ->  ( G `  f )  e.  S )
14133expia 1231 . . . . . . 7  |-  ( (
ph  /\  x  e.  X )  ->  (
f : x --> S  -> 
( G `  f
)  e.  S ) )
1514alrimiv 1922 . . . . . 6  |-  ( (
ph  /\  x  e.  X )  ->  A. f
( f : x --> S  ->  ( G `  f )  e.  S
) )
1615ralrimiva 2605 . . . . 5  |-  ( ph  ->  A. x  e.  X  A. f ( f : x --> S  ->  ( G `  f )  e.  S ) )
1712, 16, 2rspcdva 2915 . . . 4  |-  ( ph  ->  A. f ( f : z --> S  -> 
( G `  f
)  e.  S ) )
18 feq1 5465 . . . . . 6  |-  ( f  =  g  ->  (
f : z --> S  <-> 
g : z --> S ) )
19 fveq2 5639 . . . . . . 7  |-  ( f  =  g  ->  ( G `  f )  =  ( G `  g ) )
2019eleq1d 2300 . . . . . 6  |-  ( f  =  g  ->  (
( G `  f
)  e.  S  <->  ( G `  g )  e.  S
) )
2118, 20imbi12d 234 . . . . 5  |-  ( f  =  g  ->  (
( f : z --> S  ->  ( G `  f )  e.  S
)  <->  ( g : z --> S  ->  ( G `  g )  e.  S ) ) )
2221spv 1908 . . . 4  |-  ( A. f ( f : z --> S  ->  ( G `  f )  e.  S )  ->  (
g : z --> S  ->  ( G `  g )  e.  S
) )
2317, 1, 22sylc 62 . . 3  |-  ( ph  ->  ( G `  g
)  e.  S )
24 fsnunf 5853 . . 3  |-  ( ( g : z --> S  /\  ( z  e. 
_V  /\  -.  z  e.  z )  /\  ( G `  g )  e.  S )  ->  (
g  u.  { <. z ,  ( G `  g ) >. } ) : ( z  u. 
{ z } ) --> S )
251, 3, 9, 23, 24syl121anc 1278 . 2  |-  ( ph  ->  ( g  u.  { <. z ,  ( G `
 g ) >. } ) : ( z  u.  { z } ) --> S )
26 df-suc 4468 . . 3  |-  suc  z  =  ( z  u. 
{ z } )
2726feq2i 5476 . 2  |-  ( ( g  u.  { <. z ,  ( G `  g ) >. } ) : suc  z --> S  <-> 
( g  u.  { <. z ,  ( G `
 g ) >. } ) : ( z  u.  { z } ) --> S )
2825, 27sylibr 134 1  |-  ( ph  ->  ( g  u.  { <. z ,  ( G `
 g ) >. } ) : suc  z
--> S )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    /\ w3a 1004   A.wal 1395    = wceq 1397    e. wcel 2202   {cab 2217   A.wral 2510   E.wrex 2511   _Vcvv 2802    u. cun 3198   {csn 3669   <.cop 3672   Ord word 4459   Oncon0 4460   suc csuc 4462    |` cres 4727   Fun wfun 5320   -->wf 5322   ` cfv 5326  recscrecs 6469
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-setind 4635
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-v 2804  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334
This theorem is referenced by:  tfrcllemsucaccv  6519  tfrcllembfn  6522
  Copyright terms: Public domain W3C validator