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

Theorem ontr 6443
Description: An ordinal number is a transitive class. (Contributed by NM, 11-Jun-1994.) Put in closed form. (Resised by BJ, 28-Dec-2024.)
Assertion
Ref Expression
ontr (𝐴 ∈ On → Tr 𝐴)

Proof of Theorem ontr
StepHypRef Expression
1 eloni 6342 . 2 (𝐴 ∈ On → Ord 𝐴)
2 ordtr 6346 . 2 (Ord 𝐴 → Tr 𝐴)
31, 2syl 17 1 (𝐴 ∈ On → Tr 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2109  Tr wtr 5214  Ord word 6331  Oncon0 6332
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1543  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-v 3449  df-ss 3931  df-uni 4872  df-tr 5215  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-ord 6335  df-on 6336
This theorem is referenced by:  onunisuc  6444  ontrciOLD  6446  onuninsuci  7816  hfuni  36172
  Copyright terms: Public domain W3C validator