Theorem ontr 6473

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

Step	Hyp	Ref	Expression
1		eloni 6371	. 2 ⊢ (𝐴 ∈ On → Ord 𝐴)
2		ordtr 6375	. 2 ⊢ (Ord 𝐴 → Tr 𝐴)
3	1, 2	syl 18	1 ⊢ (𝐴 ∈ On → Tr 𝐴)

This proof depends on syntax axioms:   → wi 4   ∈ wcel 2145  Tr wtr 5216  Ord word 6360  Oncon0 6361

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-v 3455  df-ss 3919  df-uni 4871  df-tr 5217  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-ord 6364  df-on 6365

This theorem is used by:  onunisuc  6474  onuninsuci  7840  hfuni  36772  nmuladdss  36801