| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: An alternate way of defining a transitive class. Definition 7.1 of [TakeutiZaring] p. 35. |
| Ref | Expression |
|---|---|
| dftr3 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dftr5 2688 |
. 2
| |
| 2 | dfss3 2062 |
. . 3
| |
| 3 | 2 | ralbii 1670 |
. 2
|
| 4 | 1, 3 | bitr4 176 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: dftr4 2690 trss 2694 trin 2695 ordon 2993 ssorduni 2999 suceloni 3068 r1tr 4664 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 964 ax-gen 965 ax-8 966 ax-10 968 ax-12 970 ax-17 973 ax-4 975 ax-5o 977 ax-6o 980 ax-9o 1125 ax-10o 1142 ax-16 1212 ax-11o 1220 ax-ext 1462 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 983 df-sb 1174 df-clab 1467 df-cleq 1472 df-clel 1475 df-ral 1652 df-v 1815 df-in 2054 df-ss 2056 df-uni 2508 df-tr 2686 |