Theorem dftr4 3880

Description: An alternate way of defining a transitive class. Definition of [Enderton] p. 71. (Contributed by NM, 29-Aug-1993.)

Assertion

Ref	Expression
dftr4	|- ( Tr A <-> A C_ ~P A )

Proof of Theorem dftr4

Step	Hyp	Ref	Expression
1		df-tr 3876	. 2 |- ( Tr A <-> U. A C_ A )
2		sspwuni 3760	. 2 |- ( A C_ ~P A <-> U. A C_ A )
3	1, 2	bitr4i 185	1 |- ( Tr A <-> A C_ ~P A )

Syntax hints:   <-> wb 103   C_ wss 2973   ~Pcpw 3382   U.cuni 3601   Tr wtr 3875

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063

This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-v 2603  df-in 2979  df-ss 2986  df-pw 3384  df-uni 3602  df-tr 3876

This theorem is referenced by:  tr0  3886  pwtr  3974