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

Theorem tfrcldm 6358
Description: Recursion is defined on an ordinal if the characteristic function satisfies a closure hypothesis up to a suitable point. (Contributed by Jim Kingdon, 26-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 )
tfrcl.u  |-  ( (
ph  /\  x  e.  U. X )  ->  suc  x  e.  X )
tfrcl.yx  |-  ( ph  ->  Y  e.  U. X
)
Assertion
Ref Expression
tfrcldm  |-  ( ph  ->  Y  e.  dom  F
)
Distinct variable groups:    f, G, x    S, f, x    f, X, x    f, Y, x    ph, f, x
Allowed substitution hints:    F( x, f)

Proof of Theorem tfrcldm
Dummy variables  z  a  b  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 tfrcl.yx . . 3  |-  ( ph  ->  Y  e.  U. X
)
2 eluni 3810 . . 3  |-  ( Y  e.  U. X  <->  E. z
( Y  e.  z  /\  z  e.  X
) )
31, 2sylib 122 . 2  |-  ( ph  ->  E. z ( Y  e.  z  /\  z  e.  X ) )
4 tfrcl.f . . . 4  |-  F  = recs ( G )
5 tfrcl.g . . . . 5  |-  ( ph  ->  Fun  G )
65adantr 276 . . . 4  |-  ( (
ph  /\  ( Y  e.  z  /\  z  e.  X ) )  ->  Fun  G )
7 tfrcl.x . . . . 5  |-  ( ph  ->  Ord  X )
87adantr 276 . . . 4  |-  ( (
ph  /\  ( Y  e.  z  /\  z  e.  X ) )  ->  Ord  X )
9 tfrcl.ex . . . . 5  |-  ( (
ph  /\  x  e.  X  /\  f : x --> S )  ->  ( G `  f )  e.  S )
1093adant1r 1231 . . . 4  |-  ( ( ( ph  /\  ( Y  e.  z  /\  z  e.  X )
)  /\  x  e.  X  /\  f : x --> S )  ->  ( G `  f )  e.  S )
11 feq2 5345 . . . . . . . 8  |-  ( a  =  x  ->  (
f : a --> S  <-> 
f : x --> S ) )
12 raleq 2672 . . . . . . . 8  |-  ( a  =  x  ->  ( A. b  e.  a 
( f `  b
)  =  ( G `
 ( f  |`  b ) )  <->  A. b  e.  x  ( f `  b )  =  ( G `  ( f  |`  b ) ) ) )
1311, 12anbi12d 473 . . . . . . 7  |-  ( a  =  x  ->  (
( f : a --> S  /\  A. b  e.  a  ( f `  b )  =  ( G `  ( f  |`  b ) ) )  <-> 
( f : x --> S  /\  A. b  e.  x  ( f `  b )  =  ( G `  ( f  |`  b ) ) ) ) )
1413cbvrexv 2704 . . . . . 6  |-  ( E. a  e.  X  ( f : a --> S  /\  A. b  e.  a  ( f `  b )  =  ( G `  ( f  |`  b ) ) )  <->  E. x  e.  X  ( f : x --> S  /\  A. b  e.  x  ( f `  b )  =  ( G `  ( f  |`  b ) ) ) )
15 fveq2 5511 . . . . . . . . . 10  |-  ( b  =  y  ->  (
f `  b )  =  ( f `  y ) )
16 reseq2 4898 . . . . . . . . . . 11  |-  ( b  =  y  ->  (
f  |`  b )  =  ( f  |`  y
) )
1716fveq2d 5515 . . . . . . . . . 10  |-  ( b  =  y  ->  ( G `  ( f  |`  b ) )  =  ( G `  (
f  |`  y ) ) )
1815, 17eqeq12d 2192 . . . . . . . . 9  |-  ( b  =  y  ->  (
( f `  b
)  =  ( G `
 ( f  |`  b ) )  <->  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) )
1918cbvralv 2703 . . . . . . . 8  |-  ( A. b  e.  x  (
f `  b )  =  ( G `  ( f  |`  b
) )  <->  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) )
2019anbi2i 457 . . . . . . 7  |-  ( ( f : x --> S  /\  A. b  e.  x  ( f `  b )  =  ( G `  ( f  |`  b
) ) )  <->  ( f : x --> S  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y
) ) ) )
2120rexbii 2484 . . . . . 6  |-  ( E. x  e.  X  ( f : x --> S  /\  A. b  e.  x  ( f `  b )  =  ( G `  ( f  |`  b
) ) )  <->  E. x  e.  X  ( f : x --> S  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y
) ) ) )
2214, 21bitri 184 . . . . 5  |-  ( E. a  e.  X  ( f : a --> S  /\  A. b  e.  a  ( f `  b )  =  ( G `  ( f  |`  b ) ) )  <->  E. x  e.  X  ( f : x --> S  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) )
2322abbii 2293 . . . 4  |-  { f  |  E. a  e.  X  ( f : a --> S  /\  A. b  e.  a  (
f `  b )  =  ( G `  ( f  |`  b
) ) ) }  =  { f  |  E. x  e.  X  ( f : x --> S  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }
24 tfrcl.u . . . . 5  |-  ( (
ph  /\  x  e.  U. X )  ->  suc  x  e.  X )
2524adantlr 477 . . . 4  |-  ( ( ( ph  /\  ( Y  e.  z  /\  z  e.  X )
)  /\  x  e.  U. X )  ->  suc  x  e.  X )
26 simprr 531 . . . 4  |-  ( (
ph  /\  ( Y  e.  z  /\  z  e.  X ) )  -> 
z  e.  X )
274, 6, 8, 10, 23, 25, 26tfrcllemres 6357 . . 3  |-  ( (
ph  /\  ( Y  e.  z  /\  z  e.  X ) )  -> 
z  C_  dom  F )
28 simprl 529 . . 3  |-  ( (
ph  /\  ( Y  e.  z  /\  z  e.  X ) )  ->  Y  e.  z )
2927, 28sseldd 3156 . 2  |-  ( (
ph  /\  ( Y  e.  z  /\  z  e.  X ) )  ->  Y  e.  dom  F )
303, 29exlimddv 1898 1  |-  ( ph  ->  Y  e.  dom  F
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 978    = wceq 1353   E.wex 1492    e. wcel 2148   {cab 2163   A.wral 2455   E.wrex 2456   U.cuni 3807   Ord word 4359   suc csuc 4362   dom cdm 4623    |` cres 4625   Fun wfun 5206   -->wf 5208   ` cfv 5212  recscrecs 6299
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4115  ax-sep 4118  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-setind 4533
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-iun 3886  df-br 4001  df-opab 4062  df-mpt 4063  df-tr 4099  df-id 4290  df-iord 4363  df-on 4365  df-suc 4368  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-iota 5174  df-fun 5214  df-fn 5215  df-f 5216  df-f1 5217  df-fo 5218  df-f1o 5219  df-fv 5220  df-recs 6300
This theorem is referenced by:  tfrcl  6359  frecfcllem  6399  frecsuclem  6401
  Copyright terms: Public domain W3C validator