Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > df-tr | Structured version Visualization version GIF version |
Description: Define the transitive class predicate. Not to be confused with a transitive relation (see cotr 5427). Definition of [Enderton] p. 71 extended to arbitrary classes. For alternate definitions, see dftr2 4682 (which is suggestive of the word "transitive"), dftr3 4684, dftr4 4685, dftr5 4683, and (when 𝐴 is a set) unisuc 5718. The term "complete" is used instead of "transitive" in Definition 3 of [Suppes] p. 130. (Contributed by NM, 29-Aug-1993.) |
Ref | Expression |
---|---|
df-tr | ⊢ (Tr 𝐴 ↔ ∪ 𝐴 ⊆ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cA | . . 3 class 𝐴 | |
2 | 1 | wtr 4680 | . 2 wff Tr 𝐴 |
3 | 1 | cuni 4372 | . . 3 class ∪ 𝐴 |
4 | 3, 1 | wss 3540 | . 2 wff ∪ 𝐴 ⊆ 𝐴 |
5 | 2, 4 | wb 195 | 1 wff (Tr 𝐴 ↔ ∪ 𝐴 ⊆ 𝐴) |
Colors of variables: wff setvar class |
This definition is referenced by: dftr2 4682 dftr4 4685 treq 4686 trv 4693 pwtr 4848 unisuc 5718 orduniss 5738 onuninsuci 6932 trcl 8487 tc2 8501 r1tr2 8523 tskuni 9484 untangtr 30845 hfuni 31461 |
Copyright terms: Public domain | W3C validator |