ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  dftr4 Unicode version

Theorem dftr4 4192
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
StepHypRef Expression
1 df-tr 4188 . 2  |-  ( Tr  A  <->  U. A  C_  A
)
2 sspwuni 4055 . 2  |-  ( A 
C_  ~P A  <->  U. A  C_  A )
31, 2bitr4i 187 1  |-  ( Tr  A  <->  A  C_  ~P A
)
Colors of variables: wff set class
Syntax hints:    <-> wb 105    C_ wss 3200   ~Pcpw 3652   U.cuni 3893   Tr wtr 4187
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-v 2804  df-in 3206  df-ss 3213  df-pw 3654  df-uni 3894  df-tr 4188
This theorem is referenced by:  tr0  4198  pwtr  4311  pw1on  7443
  Copyright terms: Public domain W3C validator