Theorem tfrcllemubacc 6592

Description: Lemma for tfrcl 6597. The union of B satisfies the recursion rule. (Contributed by Jim Kingdon, 25-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 ) ) ) }
tfrcllembacc.3	|- B = { h | E. z e. D E. g ( g : z --> S /\ g e. A /\ h = ( g u. { <. z , ( G ` g ) >. } ) ) }
tfrcllembacc.u	|- ( ( ph /\ x e. U. X ) -> suc x e. X )
tfrcllembacc.4	|- ( ph -> D e. X )
tfrcllembacc.5	|- ( ph -> A. z e. D E. g ( g : z --> S /\ A. w e. z ( g ` w ) = ( G ` ( g |` w ) ) ) )

Assertion

Ref	Expression
tfrcllemubacc	|- ( ph -> A. u e. D ( U. B ` u ) = ( G ` ( U. B |` u ) ) )

Distinct variable groups:   A, f, g, h, x, y, z   D, f, g, x, y   f, G, x, y   S, f, x, y   f, X, x   ph, f, g, h, x, y, z   B, g, h, z   u, B, w   D, h, z   u, D, w   w, G   h, G, z   u, G   S, g, h, z   z, X   w, g, ph, y, z

Allowed substitution hints:   ph( u)   A( w, u)   B( x, y, f)   S( w, u)   F( x, y, z, w, u, f, g, h)   G( g)   X( y, w, u, g, h)

Proof of Theorem tfrcllemubacc

Dummy variables e t v are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		tfrcl.f	. . . . . . . . 9 |- F = recs ( G )
2		tfrcl.g	. . . . . . . . 9 |- ( ph -> Fun G )
3		tfrcl.x	. . . . . . . . 9 |- ( ph -> Ord X )
4		tfrcl.ex	. . . . . . . . 9 |- ( ( ph /\ x e. X /\ f : x --> S ) -> ( G ` f ) e. S )
5		tfrcllemsucfn.1	. . . . . . . . 9 |- A = { f | E. x e. X ( f : x --> S /\ A. y e. x ( f ` y ) = ( G ` ( f |` y ) ) ) }
6		tfrcllembacc.3	. . . . . . . . 9 |- B = { h | E. z e. D E. g ( g : z --> S /\ g e. A /\ h = ( g u. { <. z , ( G ` g ) >. } ) ) }
7		tfrcllembacc.u	. . . . . . . . 9 |- ( ( ph /\ x e. U. X ) -> suc x e. X )
8		tfrcllembacc.4	. . . . . . . . 9 |- ( ph -> D e. X )
9		tfrcllembacc.5	. . . . . . . . 9 |- ( ph -> A. z e. D E. g ( g : z --> S /\ A. w e. z ( g ` w ) = ( G ` ( g |` w ) ) ) )
10	1, 2, 3, 4, 5, 6, 7, 8, 9	tfrcllembfn 6590	. . . . . . . 8 |- ( ph -> U. B : D --> S )
11		fdm 5516	. . . . . . . 8 |- ( U. B : D --> S -> dom U. B = D )
12	10, 11	syl 14	. . . . . . 7 |- ( ph -> dom U. B = D )
13	1, 2, 3, 4, 5, 6, 7, 8, 9	tfrcllembacc 6588	. . . . . . . . . 10 |- ( ph -> B C_ A )
14	13	unissd 3940	. . . . . . . . 9 |- ( ph -> U. B C_ U. A )
15	5, 3	tfrcllemssrecs 6585	. . . . . . . . 9 |- ( ph -> U. A C_ recs ( G ) )
16	14, 15	sstrd 3250	. . . . . . . 8 |- ( ph -> U. B C_ recs ( G ) )
17		dmss 4957	. . . . . . . 8 |- ( U. B C_ recs ( G ) -> dom U. B C_ dom recs ( G ) )
18	16, 17	syl 14	. . . . . . 7 |- ( ph -> dom U. B C_ dom recs ( G ) )
19	12, 18	eqsstrrd 3277	. . . . . 6 |- ( ph -> D C_ dom recs ( G ) )
20	19	sselda 3240	. . . . 5 |- ( ( ph /\ w e. D ) -> w e. dom recs ( G ) )
21		eqid 2234	. . . . . 6 |- { e | E. v e. On ( e Fn v /\ A. t e. v ( e ` t ) = ( G ` ( e |` t ) ) ) } = { e | E. v e. On ( e Fn v /\ A. t e. v ( e ` t ) = ( G ` ( e |` t ) ) ) }
22	21	tfrlem9 6552	. . . . 5 |- ( w e. dom recs ( G ) -> (recs ( G ) ` w ) = ( G ` (recs ( G ) |` w ) ) )
23	20, 22	syl 14	. . . 4 |- ( ( ph /\ w e. D ) -> (recs ( G ) ` w ) = ( G ` (recs ( G ) |` w ) ) )
24		tfrfun 6553	. . . . 5 |- Fun recs ( G )
25	12	eleq2d 2304	. . . . . 6 |- ( ph -> ( w e. dom U. B <-> w e. D ) )
26	25	biimpar 297	. . . . 5 |- ( ( ph /\ w e. D ) -> w e. dom U. B )
27		funssfv 5698	. . . . 5 |- ( ( Fun recs ( G ) /\ U. B C_ recs ( G ) /\ w e. dom U. B ) -> (recs ( G ) ` w ) = ( U. B ` w ) )
28	24, 16, 26, 27	mp3an2ani 1381	. . . 4 |- ( ( ph /\ w e. D ) -> (recs ( G ) ` w ) = ( U. B ` w ) )
29		ordelon 4506	. . . . . . . . . 10 |- ( ( Ord X /\ D e. X ) -> D e. On )
30	3, 8, 29	syl2anc 411	. . . . . . . . 9 |- ( ph -> D e. On )
31		eloni 4498	. . . . . . . . 9 |- ( D e. On -> Ord D )
32	30, 31	syl 14	. . . . . . . 8 |- ( ph -> Ord D )
33		ordelss 4502	. . . . . . . 8 |- ( ( Ord D /\ w e. D ) -> w C_ D )
34	32, 33	sylan 283	. . . . . . 7 |- ( ( ph /\ w e. D ) -> w C_ D )
35	12	adantr 276	. . . . . . 7 |- ( ( ph /\ w e. D ) -> dom U. B = D )
36	34, 35	sseqtrrd 3279	. . . . . 6 |- ( ( ph /\ w e. D ) -> w C_ dom U. B )
37		fun2ssres 5398	. . . . . 6 |- ( ( Fun recs ( G ) /\ U. B C_ recs ( G ) /\ w C_ dom U. B ) -> (recs ( G ) |` w ) = ( U. B |` w ) )
38	24, 16, 36, 37	mp3an2ani 1381	. . . . 5 |- ( ( ph /\ w e. D ) -> (recs ( G ) |` w ) = ( U. B |` w ) )
39	38	fveq2d 5676	. . . 4 |- ( ( ph /\ w e. D ) -> ( G ` (recs ( G ) |` w ) ) = ( G ` ( U. B |` w ) ) )
40	23, 28, 39	3eqtr3d 2275	. . 3 |- ( ( ph /\ w e. D ) -> ( U. B ` w ) = ( G ` ( U. B |` w ) ) )
41	40	ralrimiva 2617	. 2 |- ( ph -> A. w e. D ( U. B ` w ) = ( G ` ( U. B |` w ) ) )
42		fveq2 5672	. . . 4 |- ( u = w -> ( U. B ` u ) = ( U. B ` w ) )
43		reseq2 5035	. . . . 5 |- ( u = w -> ( U. B |` u ) = ( U. B |` w ) )
44	43	fveq2d 5676	. . . 4 |- ( u = w -> ( G ` ( U. B |` u ) ) = ( G ` ( U. B |` w ) ) )
45	42, 44	eqeq12d 2249	. . 3 |- ( u = w -> ( ( U. B ` u ) = ( G ` ( U. B |` u ) ) <-> ( U. B ` w ) = ( G ` ( U. B |` w ) ) ) )
46	45	cbvralv 2780	. 2 |- ( A. u e. D ( U. B ` u ) = ( G ` ( U. B |` u ) ) <-> A. w e. D ( U. B ` w ) = ( G ` ( U. B |` w ) ) )
47	41, 46	sylibr 134	1 |- ( ph -> A. u e. D ( U. B ` u ) = ( G ` ( U. B |` u ) ) )

Syntax hints:   -> wi 4   /\ wa 104   /\ w3a 1005   = wceq 1398   E.wex 1541   e. wcel 2205   {cab 2220   A.wral 2522   E.wrex 2523   u. cun 3211   C_ wss 3213   {csn 3691   <.cop 3694   U.cuni 3916   Ord word 4485   Oncon0 4486   suc csuc 4488   dom cdm 4751   |` cres 4753   Fun wfun 5348   Fn wfn 5349   -->wf 5350   ` cfv 5354  recscrecs 6537

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-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661

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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-tr 4211  df-id 4416  df-iord 4489  df-on 4491  df-suc 4494  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-recs 6538

This theorem is referenced by:  tfrcllemex  6593