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

Theorem ontr 6457
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 6356 . 2 (𝐴 ∈ On → Ord 𝐴)
2 ordtr 6360 . 2 (Ord 𝐴 → Tr 𝐴)
31, 2syl 17 1 (𝐴 ∈ On → Tr 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2142  Tr wtr 5207  Ord word 6345  Oncon0 6346
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734
This theorem depends on definitions:  df-bi 209  df-an 400  df-tru 1563  df-ex 1800  df-sb 2091  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3077  df-v 3456  df-ss 3921  df-uni 4866  df-tr 5208  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-ord 6349  df-on 6350
This theorem is referenced by:  onunisuc  6458  onuninsuci  7820  hfuni  36534
  Copyright terms: Public domain W3C validator