Theorem unisucg 4517

Description: A transitive class is equal to the union of its successor. Combines Theorem 4E of [Enderton] p. 72 and Exercise 6 of [Enderton] p. 73. (Contributed by Jim Kingdon, 18-Aug-2019.)

Assertion

Ref	Expression
unisucg	|- ( A e. V -> ( Tr A <-> U. suc A = A ) )

Proof of Theorem unisucg

Step	Hyp	Ref	Expression
1		df-tr 4193	. . 3 |- ( Tr A <-> U. A C_ A )
2		ssequn1 3379	. . 3 |- ( U. A C_ A <-> ( U. A u. A ) = A )
3	1, 2	bitri 184	. 2 |- ( Tr A <-> ( U. A u. A ) = A )
4		df-suc 4474	. . . . . 6 |- suc A = ( A u. { A } )
5	4	unieqi 3908	. . . . 5 |- U. suc A = U. ( A u. { A } )
6		uniun 3917	. . . . 5 |- U. ( A u. { A } ) = ( U. A u. U. { A } )
7	5, 6	eqtri 2252	. . . 4 |- U. suc A = ( U. A u. U. { A } )
8		unisng 3915	. . . . 5 |- ( A e. V -> U. { A } = A )
9	8	uneq2d 3363	. . . 4 |- ( A e. V -> ( U. A u. U. { A } ) = ( U. A u. A ) )
10	7, 9	eqtrid 2276	. . 3 |- ( A e. V -> U. suc A = ( U. A u. A ) )
11	10	eqeq1d 2240	. 2 |- ( A e. V -> ( U. suc A = A <-> ( U. A u. A ) = A ) )
12	3, 11	bitr4id 199	1 |- ( A e. V -> ( Tr A <-> U. suc A = A ) )

Syntax hints:   -> wi 4   <-> wb 105   = wceq 1398   e. wcel 2202   u. cun 3199   C_ wss 3201   {csn 3673   U.cuni 3898   Tr wtr 4192   suc csuc 4468

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-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-ext 2213

This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-sn 3679  df-pr 3680  df-uni 3899  df-tr 4193  df-suc 4474

This theorem is referenced by:  onsucuni2  4668  nlimsucg  4670  ctmlemr  7367  nnnninfeq2  7388  nnsf  16731  peano4nninf  16732  nnnninfex  16748