Theorem tfri1dALT 6330

Description: Alternate proof of tfri1d 6314 in terms of tfr1on 6329.

Although this does show that the tfr1on 6329 proof is general enough to also prove tfri1d 6314, the tfri1d 6314 proof is simpler in places because it does not need to deal with X being any ordinal. For that reason, we have both proofs. (Proof modification is discouraged.) (New usage is discouraged.) (Contributed by Jim Kingdon, 20-Mar-2022.)

Hypotheses

Ref	Expression
tfri1dALT.1	|- F = recs ( G )
tfri1dALT.2	|- ( ph -> A. x ( Fun G /\ ( G ` x ) e. _V ) )

Assertion

Ref	Expression
tfri1dALT	|- ( ph -> F Fn On )

Distinct variable group:   x, G

Allowed substitution hints:   ph( x)   F( x)

Proof of Theorem tfri1dALT

Dummy variables z a b c f y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		tfrfun 6299	. . . 4 |- Fun recs ( G )
2		tfri1dALT.1	. . . . 5 |- F = recs ( G )
3	2	funeqi 5219	. . . 4 |- ( Fun F <-> Fun recs ( G ) )
4	1, 3	mpbir 145	. . 3 |- Fun F
5	4	a1i 9	. 2 |- ( ph -> Fun F )
6		eqid 2170	. . . . . 6 |- { a | E. b e. On ( a Fn b /\ A. c e. b ( a ` c ) = ( G ` ( a |` c ) ) ) } = { a | E. b e. On ( a Fn b /\ A. c e. b ( a ` c ) = ( G ` ( a |` c ) ) ) }
7	6	tfrlem8 6297	. . . . 5 |- Ord dom recs ( G )
8	2	dmeqi 4812	. . . . . 6 |- dom F = dom recs ( G )
9		ordeq 4357	. . . . . 6 |- ( dom F = dom recs ( G ) -> ( Ord dom F <-> Ord dom recs ( G ) ) )
10	8, 9	ax-mp 5	. . . . 5 |- ( Ord dom F <-> Ord dom recs ( G ) )
11	7, 10	mpbir 145	. . . 4 |- Ord dom F
12		ordsson 4476	. . . 4 |- ( Ord dom F -> dom F C_ On )
13	11, 12	mp1i 10	. . 3 |- ( ph -> dom F C_ On )
14		tfri1dALT.2	. . . . . . . . . 10 |- ( ph -> A. x ( Fun G /\ ( G ` x ) e. _V ) )
15		simpl 108	. . . . . . . . . . 11 |- ( ( Fun G /\ ( G ` x ) e. _V ) -> Fun G )
16	15	alimi 1448	. . . . . . . . . 10 |- ( A. x ( Fun G /\ ( G ` x ) e. _V ) -> A. x Fun G )
17	14, 16	syl 14	. . . . . . . . 9 |- ( ph -> A. x Fun G )
18	17	19.21bi 1551	. . . . . . . 8 |- ( ph -> Fun G )
19	18	adantr 274	. . . . . . 7 |- ( ( ph /\ z e. On ) -> Fun G )
20		ordon 4470	. . . . . . . 8 |- Ord On
21	20	a1i 9	. . . . . . 7 |- ( ( ph /\ z e. On ) -> Ord On )
22		simpr 109	. . . . . . . . . . 11 |- ( ( Fun G /\ ( G ` x ) e. _V ) -> ( G ` x ) e. _V )
23	22	alimi 1448	. . . . . . . . . 10 |- ( A. x ( Fun G /\ ( G ` x ) e. _V ) -> A. x ( G ` x ) e. _V )
24		fveq2 5496	. . . . . . . . . . . 12 |- ( x = f -> ( G ` x ) = ( G ` f ) )
25	24	eleq1d 2239	. . . . . . . . . . 11 |- ( x = f -> ( ( G ` x ) e. _V <-> ( G ` f ) e. _V ) )
26	25	spv 1853	. . . . . . . . . 10 |- ( A. x ( G ` x ) e. _V -> ( G ` f ) e. _V )
27	14, 23, 26	3syl 17	. . . . . . . . 9 |- ( ph -> ( G ` f ) e. _V )
28	27	adantr 274	. . . . . . . 8 |- ( ( ph /\ z e. On ) -> ( G ` f ) e. _V )
29	28	3ad2ant1 1013	. . . . . . 7 |- ( ( ( ph /\ z e. On ) /\ y e. On /\ f Fn y ) -> ( G ` f ) e. _V )
30		suceloni 4485	. . . . . . . . 9 |- ( y e. On -> suc y e. On )
31		unon 4495	. . . . . . . . 9 |- U. On = On
32	30, 31	eleq2s 2265	. . . . . . . 8 |- ( y e. U. On -> suc y e. On )
33	32	adantl 275	. . . . . . 7 |- ( ( ( ph /\ z e. On ) /\ y e. U. On ) -> suc y e. On )
34		suceloni 4485	. . . . . . . 8 |- ( z e. On -> suc z e. On )
35	34	adantl 275	. . . . . . 7 |- ( ( ph /\ z e. On ) -> suc z e. On )
36	2, 19, 21, 29, 33, 35	tfr1on 6329	. . . . . 6 |- ( ( ph /\ z e. On ) -> suc z C_ dom F )
37		vex 2733	. . . . . . 7 |- z e. _V
38	37	sucid 4402	. . . . . 6 |- z e. suc z
39		ssel2 3142	. . . . . 6 |- ( ( suc z C_ dom F /\ z e. suc z ) -> z e. dom F )
40	36, 38, 39	sylancl 411	. . . . 5 |- ( ( ph /\ z e. On ) -> z e. dom F )
41	40	ex 114	. . . 4 |- ( ph -> ( z e. On -> z e. dom F ) )
42	41	ssrdv 3153	. . 3 |- ( ph -> On C_ dom F )
43	13, 42	eqssd 3164	. 2 |- ( ph -> dom F = On )
44		df-fn 5201	. 2 |- ( F Fn On <-> ( Fun F /\ dom F = On ) )
45	5, 43, 44	sylanbrc 415	1 |- ( ph -> F Fn On )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   A.wal 1346   = wceq 1348   e. wcel 2141   {cab 2156   A.wral 2448   E.wrex 2449   _Vcvv 2730   C_ wss 3121   U.cuni 3796   Ord word 4347   Oncon0 4348   suc csuc 4350   dom cdm 4611   |` cres 4613   Fun wfun 5192   Fn wfn 5193   ` cfv 5198  recscrecs 6283

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4104  ax-sep 4107  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521

This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-ral 2453  df-rex 2454  df-reu 2455  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-id 4278  df-iord 4351  df-on 4353  df-suc 4356  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-recs 6284

This theorem is referenced by: (None)