MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tr0 Structured version   Visualization version   GIF version

Theorem tr0 5175
Description: The empty set is transitive. (Contributed by NM, 16-Sep-1993.)
Assertion
Ref Expression
tr0 Tr ∅

Proof of Theorem tr0
StepHypRef Expression
1 0ss 4349 . 2 ∅ ⊆ 𝒫 ∅
2 dftr4 5169 . 2 (Tr ∅ ↔ ∅ ⊆ 𝒫 ∅)
31, 2mpbir 233 1 Tr ∅
Colors of variables: wff setvar class
Syntax hints:  wss 3935  c0 4290  𝒫 cpw 4538  Tr wtr 5164
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-v 3496  df-dif 3938  df-in 3942  df-ss 3951  df-nul 4291  df-pw 4540  df-uni 4832  df-tr 5165
This theorem is referenced by:  ord0  6237  tctr  9176  tc0  9183  r1tr  9199
  Copyright terms: Public domain W3C validator