Theorem dftr4 5218

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 5213	. 2 ⊢ (Tr 𝐴 ↔ ∪ 𝐴 ⊆ 𝐴)
2		sspwuni 5060	. 2 ⊢ (𝐴 ⊆ 𝒫 𝐴 ↔ ∪ 𝐴 ⊆ 𝐴)
3	1, 2	bitr4i 281	1 ⊢ (Tr 𝐴 ↔ 𝐴 ⊆ 𝒫 𝐴)

This proof depends on syntax axioms:   ↔ wb 209   ⊆ wss 3899  𝒫 cpw 4557  ∪ cuni 4867  Tr wtr 5212

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-v 3453  df-ss 3916  df-pw 4559  df-uni 4868  df-tr 5213

This theorem is used by:  tr0  5225  pwtr  5420  r1ordg  9768  r1sssuc  9773  r1val1  9776  ackbij2lem3  10299  tsktrss  10827