Theorem tfrlemiubacc 6601

Description: The union of B satisfies the recursion rule (lemma for tfrlemi1 6603). (Contributed by Jim Kingdon, 22-Apr-2019.) (Proof shortened by Mario Carneiro, 24-May-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 ) )
tfrlemi1.3	|- B = { h | E. z e. x E. g ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) }
tfrlemi1.4	|- ( ph -> x e. On )
tfrlemi1.5	|- ( ph -> A. z e. x E. g ( g Fn z /\ A. w e. z ( g ` w ) = ( F ` ( g |` w ) ) ) )

Assertion

Ref	Expression
tfrlemiubacc	|- ( ph -> A. u e. x ( U. B ` u ) = ( F ` ( U. B |` u ) ) )

Distinct variable groups:   f, g, h, u, w, x, y, z, A   f, F, g, h, u, w, x, y, z   ph, w, y   u, B, w, f, g, h, z   ph, g, h, z

Allowed substitution hints:   ph( x, u, f)   B( x, y)

Proof of Theorem tfrlemiubacc

Step	Hyp	Ref	Expression
1		tfrlemisucfn.1	. . . . . . . . 9 |- A = { f | E. x e. On ( f Fn x /\ A. y e. x ( f ` y ) = ( F ` ( f |` y ) ) ) }
2		tfrlemisucfn.2	. . . . . . . . 9 |- ( ph -> A. x ( Fun F /\ ( F ` x ) e. _V ) )
3		tfrlemi1.3	. . . . . . . . 9 |- B = { h | E. z e. x E. g ( g Fn z /\ g e. A /\ h = ( g u. { <. z , ( F ` g ) >. } ) ) }
4		tfrlemi1.4	. . . . . . . . 9 |- ( ph -> x e. On )
5		tfrlemi1.5	. . . . . . . . 9 |- ( ph -> A. z e. x E. g ( g Fn z /\ A. w e. z ( g ` w ) = ( F ` ( g |` w ) ) ) )
6	1, 2, 3, 4, 5	tfrlemibfn 6599	. . . . . . . 8 |- ( ph -> U. B Fn x )
7		fndm 5480	. . . . . . . 8 |- ( U. B Fn x -> dom U. B = x )
8	6, 7	syl 14	. . . . . . 7 |- ( ph -> dom U. B = x )
9	1, 2, 3, 4, 5	tfrlemibacc 6597	. . . . . . . . . 10 |- ( ph -> B C_ A )
10	9	unissd 3959	. . . . . . . . 9 |- ( ph -> U. B C_ U. A )
11	1	recsfval 6586	. . . . . . . . 9 |- recs ( F ) = U. A
12	10, 11	sseqtrrdi 3297	. . . . . . . 8 |- ( ph -> U. B C_ recs ( F ) )
13		dmss 4980	. . . . . . . 8 |- ( U. B C_ recs ( F ) -> dom U. B C_ dom recs ( F ) )
14	12, 13	syl 14	. . . . . . 7 |- ( ph -> dom U. B C_ dom recs ( F ) )
15	8, 14	eqsstrrd 3285	. . . . . 6 |- ( ph -> x C_ dom recs ( F ) )
16	15	sselda 3248	. . . . 5 |- ( ( ph /\ w e. x ) -> w e. dom recs ( F ) )
17	1	tfrlem9 6590	. . . . 5 |- ( w e. dom recs ( F ) -> (recs ( F ) ` w ) = ( F ` (recs ( F ) |` w ) ) )
18	16, 17	syl 14	. . . 4 |- ( ( ph /\ w e. x ) -> (recs ( F ) ` w ) = ( F ` (recs ( F ) |` w ) ) )
19	1	tfrlem7 6588	. . . . . 6 |- Fun recs ( F )
20	19	a1i 9	. . . . 5 |- ( ( ph /\ w e. x ) -> Fun recs ( F ) )
21	12	adantr 276	. . . . 5 |- ( ( ph /\ w e. x ) -> U. B C_ recs ( F ) )
22	8	eleq2d 2308	. . . . . 6 |- ( ph -> ( w e. dom U. B <-> w e. x ) )
23	22	biimpar 297	. . . . 5 |- ( ( ph /\ w e. x ) -> w e. dom U. B )
24		funssfv 5721	. . . . 5 |- ( ( Fun recs ( F ) /\ U. B C_ recs ( F ) /\ w e. dom U. B ) -> (recs ( F ) ` w ) = ( U. B ` w ) )
25	20, 21, 23, 24	syl3anc 1278	. . . 4 |- ( ( ph /\ w e. x ) -> (recs ( F ) ` w ) = ( U. B ` w ) )
26		eloni 4520	. . . . . . . . 9 |- ( x e. On -> Ord x )
27	4, 26	syl 14	. . . . . . . 8 |- ( ph -> Ord x )
28		ordelss 4524	. . . . . . . 8 |- ( ( Ord x /\ w e. x ) -> w C_ x )
29	27, 28	sylan 283	. . . . . . 7 |- ( ( ph /\ w e. x ) -> w C_ x )
30	8	adantr 276	. . . . . . 7 |- ( ( ph /\ w e. x ) -> dom U. B = x )
31	29, 30	sseqtrrd 3287	. . . . . 6 |- ( ( ph /\ w e. x ) -> w C_ dom U. B )
32		fun2ssres 5421	. . . . . 6 |- ( ( Fun recs ( F ) /\ U. B C_ recs ( F ) /\ w C_ dom U. B ) -> (recs ( F ) |` w ) = ( U. B |` w ) )
33	20, 21, 31, 32	syl3anc 1278	. . . . 5 |- ( ( ph /\ w e. x ) -> (recs ( F ) |` w ) = ( U. B |` w ) )
34	33	fveq2d 5699	. . . 4 |- ( ( ph /\ w e. x ) -> ( F ` (recs ( F ) |` w ) ) = ( F ` ( U. B |` w ) ) )
35	18, 25, 34	3eqtr3d 2279	. . 3 |- ( ( ph /\ w e. x ) -> ( U. B ` w ) = ( F ` ( U. B |` w ) ) )
36	35	ralrimiva 2623	. 2 |- ( ph -> A. w e. x ( U. B ` w ) = ( F ` ( U. B |` w ) ) )
37		fveq2 5695	. . . 4 |- ( u = w -> ( U. B ` u ) = ( U. B ` w ) )
38		reseq2 5058	. . . . 5 |- ( u = w -> ( U. B |` u ) = ( U. B |` w ) )
39	38	fveq2d 5699	. . . 4 |- ( u = w -> ( F ` ( U. B |` u ) ) = ( F ` ( U. B |` w ) ) )
40	37, 39	eqeq12d 2253	. . 3 |- ( u = w -> ( ( U. B ` u ) = ( F ` ( U. B |` u ) ) <-> ( U. B ` w ) = ( F ` ( U. B |` w ) ) ) )
41	40	cbvralv 2786	. 2 |- ( A. u e. x ( U. B ` u ) = ( F ` ( U. B |` u ) ) <-> A. w e. x ( U. B ` w ) = ( F ` ( U. B |` w ) ) )
42	36, 41	sylibr 134	1 |- ( ph -> A. u e. x ( U. B ` u ) = ( F ` ( U. B |` u ) ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   /\ w3a 1009   A.wal 1400   = wceq 1402   E.wex 1545   e. wcel 2209   {cab 2224   A.wral 2528   E.wrex 2529   _Vcvv 2821   u. cun 3218   C_ wss 3220   {csn 3709   <.cop 3712   U.cuni 3935   Ord word 4507   Oncon0 4508   dom cdm 4774   |` 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-un 4578  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-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  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-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  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-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-recs 6576

This theorem is used by:  tfrlemiex  6602