![]() |
Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > df-trrels | Structured version Visualization version GIF version |
Description: Define the class of
transitive relations. For sets, being an element of
the class of transitive relations is equivalent to satisfying the
transitive relation predicate, see eltrrelsrel 37116. Alternate definitions
are dftrrels2 37110 and dftrrels3 37111.
This definition is similar to the definitions of the classes of reflexive (df-refrels 37046) and symmetric (df-symrels 37078) relations. (Contributed by Peter Mazsa, 7-Jul-2019.) |
Ref | Expression |
---|---|
df-trrels | ⊢ TrRels = ( Trs ∩ Rels ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ctrrels 36721 | . 2 class TrRels | |
2 | ctrs 36720 | . . 3 class Trs | |
3 | crels 36709 | . . 3 class Rels | |
4 | 2, 3 | cin 3912 | . 2 class ( Trs ∩ Rels ) |
5 | 1, 4 | wceq 1541 | 1 wff TrRels = ( Trs ∩ Rels ) |
Colors of variables: wff setvar class |
This definition is referenced by: dftrrels2 37110 |
Copyright terms: Public domain | W3C validator |