| 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 5216 | . 2 ⊢ (Tr 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝐴) | |
| 2 | dfss3 3920 | . . 3 ⊢ (𝑥 ⊆ 𝐴 ↔ ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝐴) | |
| 3 | 2 | ralbii 3108 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝐴) |
| 4 | 1, 3 | bitr4i 281 | 1 ⊢ (Tr 𝐴 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∈ wcel 2145 ∀wral 3076 ⊆ wss 3899 Tr wtr 5212 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-v 3452 df-ss 3916 df-uni 4868 df-tr 5213 |
| This theorem is used by: trss 5222 trun 5223 trin 5224 triun 5227 triin 5229 tron 6380 ssorduni 7778 dfrecs3 8361 ordtypelem2 9491 tcwf 9865 itunitc 10423 wunex2 10747 wfgru 10825 axtco 37090 axtco1g 37095 ttciunun 37130 regsfromregtco 37157 nadd2rabtr 44225 trwf 45782 |
| Copyright terms: Public domain | W3C validator |