Theorem tfri1dALT 6418

Description: Alternate proof of tfri1d 6402 in terms of tfr1on 6417.

Although this does show that the tfr1on 6417 proof is general enough to also prove tfri1d 6402, the tfri1d 6402 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 6387	. . . 4 |- Fun recs ( G )
2		tfri1dALT.1	. . . . 5 |- F = recs ( G )
3	2	funeqi 5280	. . . 4 |- ( Fun F <-> Fun recs ( G ) )
4	1, 3	mpbir 146	. . 3 |- Fun F
5	4	a1i 9	. 2 |- ( ph -> Fun F )
6		eqid 2196	. . . . . 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 6385	. . . . 5 |- Ord dom recs ( G )
8	2	dmeqi 4868	. . . . . 6 |- dom F = dom recs ( G )
9		ordeq 4408	. . . . . 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 146	. . . 4 |- Ord dom F
12		ordsson 4529	. . . 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 109	. . . . . . . . . . 11 |- ( ( Fun G /\ ( G ` x ) e. _V ) -> Fun G )
16	15	alimi 1469	. . . . . . . . . 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 1572	. . . . . . . 8 |- ( ph -> Fun G )
19	18	adantr 276	. . . . . . 7 |- ( ( ph /\ z e. On ) -> Fun G )
20		ordon 4523	. . . . . . . 8 |- Ord On
21	20	a1i 9	. . . . . . 7 |- ( ( ph /\ z e. On ) -> Ord On )
22		simpr 110	. . . . . . . . . . 11 |- ( ( Fun G /\ ( G ` x ) e. _V ) -> ( G ` x ) e. _V )
23	22	alimi 1469	. . . . . . . . . 10 |- ( A. x ( Fun G /\ ( G ` x ) e. _V ) -> A. x ( G ` x ) e. _V )
24		fveq2 5561	. . . . . . . . . . . 12 |- ( x = f -> ( G ` x ) = ( G ` f ) )
25	24	eleq1d 2265	. . . . . . . . . . 11 |- ( x = f -> ( ( G ` x ) e. _V <-> ( G ` f ) e. _V ) )
26	25	spv 1874	. . . . . . . . . 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 276	. . . . . . . 8 |- ( ( ph /\ z e. On ) -> ( G ` f ) e. _V )
29	28	3ad2ant1 1020	. . . . . . 7 |- ( ( ( ph /\ z e. On ) /\ y e. On /\ f Fn y ) -> ( G ` f ) e. _V )
30		onsuc 4538	. . . . . . . . 9 |- ( y e. On -> suc y e. On )
31		unon 4548	. . . . . . . . 9 |- U. On = On
32	30, 31	eleq2s 2291	. . . . . . . 8 |- ( y e. U. On -> suc y e. On )
33	32	adantl 277	. . . . . . 7 |- ( ( ( ph /\ z e. On ) /\ y e. U. On ) -> suc y e. On )
34		onsuc 4538	. . . . . . . 8 |- ( z e. On -> suc z e. On )
35	34	adantl 277	. . . . . . 7 |- ( ( ph /\ z e. On ) -> suc z e. On )
36	2, 19, 21, 29, 33, 35	tfr1on 6417	. . . . . 6 |- ( ( ph /\ z e. On ) -> suc z C_ dom F )
37		vex 2766	. . . . . . 7 |- z e. _V
38	37	sucid 4453	. . . . . 6 |- z e. suc z
39		ssel2 3179	. . . . . 6 |- ( ( suc z C_ dom F /\ z e. suc z ) -> z e. dom F )
40	36, 38, 39	sylancl 413	. . . . 5 |- ( ( ph /\ z e. On ) -> z e. dom F )
41	40	ex 115	. . . 4 |- ( ph -> ( z e. On -> z e. dom F ) )
42	41	ssrdv 3190	. . 3 |- ( ph -> On C_ dom F )
43	13, 42	eqssd 3201	. 2 |- ( ph -> dom F = On )
44		df-fn 5262	. 2 |- ( F Fn On <-> ( Fun F /\ dom F = On ) )
45	5, 43, 44	sylanbrc 417	1 |- ( ph -> F Fn On )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   A.wal 1362   = wceq 1364   e. wcel 2167   {cab 2182   A.wral 2475   E.wrex 2476   _Vcvv 2763   C_ wss 3157   U.cuni 3840   Ord word 4398   Oncon0 4399   suc csuc 4401   dom cdm 4664   |` cres 4666   Fun wfun 5253   Fn wfn 5254   ` cfv 5259  recscrecs 6371

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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-id 4329  df-iord 4402  df-on 4404  df-suc 4407  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-recs 6372

This theorem is referenced by: (None)