| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tr0 | Structured version Visualization version GIF version | ||
| Description: The empty set is transitive. (Contributed by NM, 16-Sep-1993.) |
| Ref | Expression |
|---|---|
| tr0 | ⊢ Tr ∅ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0ss 4354 | . 2 ⊢ ∅ ⊆ 𝒫 ∅ | |
| 2 | dftr4 5213 | . 2 ⊢ (Tr ∅ ↔ ∅ ⊆ 𝒫 ∅) | |
| 3 | 1, 2 | mpbir 231 | 1 ⊢ Tr ∅ |
| Colors of variables: wff setvar class |
| Syntax hints: ⊆ wss 3903 ∅c0 4287 𝒫 cpw 4556 Tr wtr 5207 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-v 3444 df-dif 3906 df-ss 3920 df-nul 4288 df-pw 4558 df-uni 4866 df-tr 5208 |
| This theorem is referenced by: ord0 6379 tctr 9659 tc0 9666 r1tr 9700 |
| Copyright terms: Public domain | W3C validator |