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

Theorem tr0 4764
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 3972 . 2 ∅ ⊆ 𝒫 ∅
2 dftr4 4757 . 2 (Tr ∅ ↔ ∅ ⊆ 𝒫 ∅)
31, 2mpbir 221 1 Tr ∅
Colors of variables: wff setvar class
Syntax hints:  wss 3574  c0 3915  𝒫 cpw 4158  Tr wtr 4752
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-v 3202  df-dif 3577  df-in 3581  df-ss 3588  df-nul 3916  df-pw 4160  df-uni 4437  df-tr 4753
This theorem is referenced by:  ord0  5777  tctr  8616  tc0  8623  r1tr  8639
  Copyright terms: Public domain W3C validator