| 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 5202 | . 2 ⊢ (Tr 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝐴) | |
| 2 | dfss3 3923 | . . 3 ⊢ (𝑥 ⊆ 𝐴 ↔ ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝐴) | |
| 3 | 2 | ralbii 3078 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝐴) |
| 4 | 1, 3 | bitr4i 278 | 1 ⊢ (Tr 𝐴 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∈ wcel 2111 ∀wral 3047 ⊆ wss 3902 Tr wtr 5198 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-ral 3048 df-v 3438 df-ss 3919 df-uni 4860 df-tr 5199 |
| This theorem is referenced by: trss 5208 trin 5209 triun 5212 triin 5214 tron 6329 ssorduni 7712 dfrecs3 8292 ordtypelem2 9405 tcwf 9773 itunitc 10309 wunex2 10626 wfgru 10704 nadd2rabtr 43416 trwf 44991 |
| Copyright terms: Public domain | W3C validator |