| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dftr3 | Structured version Visualization version GIF version | ||
| Description: An alternate way of defining a transitive class. Definition 7.1 of [TakeutiZaring] p. 35. (Contributed by NM, 29-Aug-1993.) |
| Ref | Expression |
|---|---|
| dftr3 | ⊢ (Tr 𝐴 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dftr5 5218 | . 2 ⊢ (Tr 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝐴) | |
| 2 | dfss3 3935 | . . 3 ⊢ (𝑥 ⊆ 𝐴 ↔ ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝐴) | |
| 3 | 2 | ralbii 3075 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝐴) |
| 4 | 1, 3 | bitr4i 278 | 1 ⊢ (Tr 𝐴 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∈ wcel 2109 ∀wral 3044 ⊆ wss 3914 Tr wtr 5214 |
| 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 2701 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1543 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-ral 3045 df-v 3449 df-ss 3931 df-uni 4872 df-tr 5215 |
| This theorem is referenced by: trss 5225 trin 5226 triun 5229 triin 5231 tron 6355 ssorduni 7755 sucexeloniOLD 7786 dfrecs3 8341 ordtypelem2 9472 tcwf 9836 itunitc 10374 wunex2 10691 wfgru 10769 nadd2rabtr 43373 trwf 44949 |
| Copyright terms: Public domain | W3C validator |