Theorem dftr4 5224

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 𝐴 ↔ 𝐴 ⊆ 𝒫 𝐴)

Proof of Theorem dftr4

Step	Hyp	Ref	Expression
1		df-tr 5218	. 2 ⊢ (Tr 𝐴 ↔ ∪ 𝐴 ⊆ 𝐴)
2		sspwuni 5067	. 2 ⊢ (𝐴 ⊆ 𝒫 𝐴 ↔ ∪ 𝐴 ⊆ 𝐴)
3	1, 2	bitr4i 278	1 ⊢ (Tr 𝐴 ↔ 𝐴 ⊆ 𝒫 𝐴)

Syntax hints:   ↔ wb 206   ⊆ wss 3917  𝒫 cpw 4566  ∪ cuni 4874  Tr wtr 5217

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2702

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1543  df-ex 1780  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-ral 3046  df-v 3452  df-ss 3934  df-pw 4568  df-uni 4875  df-tr 5218

This theorem is referenced by:  tr0  5230  pwtr  5415  r1ordg  9738  r1sssuc  9743  r1val1  9746  ackbij2lem3  10200  tsktrss  10721