| 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 5243 | . 2 ⊢ (Tr 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝐴) | |
| 2 | dfss3 3952 | . . 3 ⊢ (𝑥 ⊆ 𝐴 ↔ ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝐴) | |
| 3 | 2 | ralbii 3081 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝐴) |
| 4 | 1, 3 | bitr4i 278 | 1 ⊢ (Tr 𝐴 ↔ ∀𝑥 ∈ 𝐴 𝑥 ⊆ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∈ wcel 2107 ∀wral 3050 ⊆ wss 3931 Tr wtr 5239 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1542 df-ex 1779 df-sb 2064 df-clab 2713 df-cleq 2726 df-clel 2808 df-ral 3051 df-v 3465 df-ss 3948 df-uni 4888 df-tr 5240 |
| This theorem is referenced by: trss 5250 trin 5251 triun 5254 triin 5256 tron 6386 ssorduni 7781 sucexeloniOLD 7812 suceloniOLD 7814 dfrecs3 8394 dfrecs3OLD 8395 ordtypelem2 9541 tcwf 9905 itunitc 10443 wunex2 10760 wfgru 10838 nadd2rabtr 43374 trwf 44948 |
| Copyright terms: Public domain | W3C validator |