Theorem r1tr 8206

Description: The cumulative hierarchy of sets is transitive. Lemma 7T of [Enderton] p. 202. (Contributed by NM, 8-Sep-2003.) (Revised by Mario Carneiro, 16-Nov-2014.)

Assertion

Ref	Expression
r1tr	|- Tr ( R1 ` A )

Proof of Theorem r1tr

Dummy variables x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		r1funlim 8196	. . . . . 6 |- ( Fun R1 /\ Lim dom R1 )
2	1	simpri 462	. . . . 5 |- Lim dom R1
3		limord 4943	. . . . 5 |- ( Lim dom R1 -> Ord dom R1 )
4		ordsson 6620	. . . . 5 |- ( Ord dom R1 -> dom R1 C_ On )
5	2, 3, 4	mp2b 10	. . . 4 |- dom R1 C_ On
6	5	sseli 3505	. . 3 |- ( A e. dom R1 -> A e. On )
7		fveq2 5872	. . . . . 6 |- ( x = (/) -> ( R1 ` x ) = ( R1 ` (/) ) )
8		r10 8198	. . . . . 6 |- ( R1 ` (/) ) = (/)
9	7, 8	syl6eq 2524	. . . . 5 |- ( x = (/) -> ( R1 ` x ) = (/) )
10		treq 4552	. . . . 5 |- ( ( R1 ` x ) = (/) -> ( Tr ( R1 ` x ) <-> Tr (/) ) )
11	9, 10	syl 16	. . . 4 |- ( x = (/) -> ( Tr ( R1 ` x ) <-> Tr (/) ) )
12		fveq2 5872	. . . . 5 |- ( x = y -> ( R1 ` x ) = ( R1 ` y ) )
13		treq 4552	. . . . 5 |- ( ( R1 ` x ) = ( R1 ` y ) -> ( Tr ( R1 ` x ) <-> Tr ( R1 ` y ) ) )
14	12, 13	syl 16	. . . 4 |- ( x = y -> ( Tr ( R1 ` x ) <-> Tr ( R1 ` y ) ) )
15		fveq2 5872	. . . . 5 |- ( x = suc y -> ( R1 ` x ) = ( R1 ` suc y ) )
16		treq 4552	. . . . 5 |- ( ( R1 ` x ) = ( R1 ` suc y ) -> ( Tr ( R1 ` x ) <-> Tr ( R1 ` suc y ) ) )
17	15, 16	syl 16	. . . 4 |- ( x = suc y -> ( Tr ( R1 ` x ) <-> Tr ( R1 ` suc y ) ) )
18		fveq2 5872	. . . . 5 |- ( x = A -> ( R1 ` x ) = ( R1 ` A ) )
19		treq 4552	. . . . 5 |- ( ( R1 ` x ) = ( R1 ` A ) -> ( Tr ( R1 ` x ) <-> Tr ( R1 ` A ) ) )
20	18, 19	syl 16	. . . 4 |- ( x = A -> ( Tr ( R1 ` x ) <-> Tr ( R1 ` A ) ) )
21		tr0 4557	. . . 4 |- Tr (/)
22		limsuc 6679	. . . . . . . 8 |- ( Lim dom R1 -> ( y e. dom R1 <-> suc y e. dom R1 ) )
23	2, 22	ax-mp 5	. . . . . . 7 |- ( y e. dom R1 <-> suc y e. dom R1 )
24		simpr 461	. . . . . . . . 9 |- ( ( y e. On /\ Tr ( R1 ` y ) ) -> Tr ( R1 ` y ) )
25		pwtr 4706	. . . . . . . . 9 |- ( Tr ( R1 ` y ) <-> Tr ~P ( R1 ` y ) )
26	24, 25	sylib 196	. . . . . . . 8 |- ( ( y e. On /\ Tr ( R1 ` y ) ) -> Tr ~P ( R1 ` y ) )
27		r1sucg 8199	. . . . . . . . 9 |- ( y e. dom R1 -> ( R1 ` suc y ) = ~P ( R1 ` y ) )
28		treq 4552	. . . . . . . . 9 |- ( ( R1 ` suc y ) = ~P ( R1 ` y ) -> ( Tr ( R1 ` suc y ) <-> Tr ~P ( R1 ` y ) ) )
29	27, 28	syl 16	. . . . . . . 8 |- ( y e. dom R1 -> ( Tr ( R1 ` suc y ) <-> Tr ~P ( R1 ` y ) ) )
30	26, 29	syl5ibrcom 222	. . . . . . 7 |- ( ( y e. On /\ Tr ( R1 ` y ) ) -> ( y e. dom R1 -> Tr ( R1 ` suc y ) ) )
31	23, 30	syl5bir 218	. . . . . 6 |- ( ( y e. On /\ Tr ( R1 ` y ) ) -> ( suc y e. dom R1 -> Tr ( R1 ` suc y ) ) )
32		ndmfv 5896	. . . . . . . 8 |- ( -. suc y e. dom R1 -> ( R1 ` suc y ) = (/) )
33		treq 4552	. . . . . . . 8 |- ( ( R1 ` suc y ) = (/) -> ( Tr ( R1 ` suc y ) <-> Tr (/) ) )
34	32, 33	syl 16	. . . . . . 7 |- ( -. suc y e. dom R1 -> ( Tr ( R1 ` suc y ) <-> Tr (/) ) )
35	21, 34	mpbiri 233	. . . . . 6 |- ( -. suc y e. dom R1 -> Tr ( R1 ` suc y ) )
36	31, 35	pm2.61d1 159	. . . . 5 |- ( ( y e. On /\ Tr ( R1 ` y ) ) -> Tr ( R1 ` suc y ) )
37	36	ex 434	. . . 4 |- ( y e. On -> ( Tr ( R1 ` y ) -> Tr ( R1 ` suc y ) ) )
38		triun 4559	. . . . . . . 8 |- ( A. y e. x Tr ( R1 ` y ) -> Tr U_ y e. x ( R1 ` y ) )
39		r1limg 8201	. . . . . . . . . 10 |- ( ( x e. dom R1 /\ Lim x ) -> ( R1 ` x ) = U_ y e. x ( R1 ` y ) )
40	39	ancoms 453	. . . . . . . . 9 |- ( ( Lim x /\ x e. dom R1 ) -> ( R1 ` x ) = U_ y e. x ( R1 ` y ) )
41		treq 4552	. . . . . . . . 9 |- ( ( R1 ` x ) = U_ y e. x ( R1 ` y ) -> ( Tr ( R1 ` x ) <-> Tr U_ y e. x ( R1 ` y ) ) )
42	40, 41	syl 16	. . . . . . . 8 |- ( ( Lim x /\ x e. dom R1 ) -> ( Tr ( R1 ` x ) <-> Tr U_ y e. x ( R1 ` y ) ) )
43	38, 42	syl5ibr 221	. . . . . . 7 |- ( ( Lim x /\ x e. dom R1 ) -> ( A. y e. x Tr ( R1 ` y ) -> Tr ( R1 ` x ) ) )
44	43	impancom 440	. . . . . 6 |- ( ( Lim x /\ A. y e. x Tr ( R1 ` y ) ) -> ( x e. dom R1 -> Tr ( R1 ` x ) ) )
45		ndmfv 5896	. . . . . . . 8 |- ( -. x e. dom R1 -> ( R1 ` x ) = (/) )
46	45, 10	syl 16	. . . . . . 7 |- ( -. x e. dom R1 -> ( Tr ( R1 ` x ) <-> Tr (/) ) )
47	21, 46	mpbiri 233	. . . . . 6 |- ( -. x e. dom R1 -> Tr ( R1 ` x ) )
48	44, 47	pm2.61d1 159	. . . . 5 |- ( ( Lim x /\ A. y e. x Tr ( R1 ` y ) ) -> Tr ( R1 ` x ) )
49	48	ex 434	. . . 4 |- ( Lim x -> ( A. y e. x Tr ( R1 ` y ) -> Tr ( R1 ` x ) ) )
50	11, 14, 17, 20, 21, 37, 49	tfinds 6689	. . 3 |- ( A e. On -> Tr ( R1 ` A ) )
51	6, 50	syl 16	. 2 |- ( A e. dom R1 -> Tr ( R1 ` A ) )
52		ndmfv 5896	. . . 4 |- ( -. A e. dom R1 -> ( R1 ` A ) = (/) )
53		treq 4552	. . . 4 |- ( ( R1 ` A ) = (/) -> ( Tr ( R1 ` A ) <-> Tr (/) ) )
54	52, 53	syl 16	. . 3 |- ( -. A e. dom R1 -> ( Tr ( R1 ` A ) <-> Tr (/) ) )
55	21, 54	mpbiri 233	. 2 |- ( -. A e. dom R1 -> Tr ( R1 ` A ) )
56	51, 55	pm2.61i 164	1 |- Tr ( R1 ` A )

Syntax hints:   -. wn 3   <-> wb 184   /\ wa 369   = wceq 1379   e. wcel 1767   A.wral 2817   C_ wss 3481   (/)c0 3790   ~Pcpw 4016   U_ciun 4331   Tr wtr 4546   Ord word 4883   Oncon0 4884   Lim wlim 4885   suc csuc 4886   dom cdm 5005   Fun wfun 5588   ` cfv 5594   R1cr1 8192

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1601  ax-4 1612  ax-5 1680  ax-6 1719  ax-7 1739  ax-8 1769  ax-9 1771  ax-10 1786  ax-11 1791  ax-12 1803  ax-13 1968  ax-ext 2445  ax-sep 4574  ax-nul 4582  ax-pow 4631  ax-pr 4692  ax-un 6587

This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 974  df-3an 975  df-tru 1382  df-ex 1597  df-nf 1600  df-sb 1712  df-eu 2279  df-mo 2280  df-clab 2453  df-cleq 2459  df-clel 2462  df-nfc 2617  df-ne 2664  df-ral 2822  df-rex 2823  df-reu 2824  df-rab 2826  df-v 3120  df-sbc 3337  df-csb 3441  df-dif 3484  df-un 3486  df-in 3488  df-ss 3495  df-pss 3497  df-nul 3791  df-if 3946  df-pw 4018  df-sn 4034  df-pr 4036  df-tp 4038  df-op 4040  df-uni 4252  df-iun 4333  df-br 4454  df-opab 4512  df-mpt 4513  df-tr 4547  df-eprel 4797  df-id 4801  df-po 4806  df-so 4807  df-fr 4844  df-we 4846  df-ord 4887  df-on 4888  df-lim 4889  df-suc 4890  df-xp 5011  df-rel 5012  df-cnv 5013  df-co 5014  df-dm 5015  df-rn 5016  df-res 5017  df-ima 5018  df-iota 5557  df-fun 5596  df-fn 5597  df-f 5598  df-f1 5599  df-fo 5600  df-f1o 5601  df-fv 5602  df-om 6696  df-recs 7054  df-rdg 7088  df-r1 8194

This theorem is referenced by:  r1tr2  8207  r1ordg  8208  r1ord3g  8209  r1ord2  8211  r1sssuc  8213  r1pwss  8214  r1val1  8216  rankwflemb  8223  r1elwf  8226  r1elssi  8235  uniwf  8249  tcrank  8314  ackbij2lem3  8633  r1limwun  9126  tskr1om2  9158