Theorem tron 6390

Description: The class of all ordinal numbers is transitive. (Contributed by NM, 4-May-2009.)

Assertion

Ref	Expression
tron	⊢ Tr On

Proof of Theorem tron

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dftr3 5228	. 2 ⊢ (Tr On ↔ ∀𝑥 ∈ On 𝑥 ⊆ On)
2		vex 3462	. . . . . . 7 ⊢ 𝑥 ∈ V
3	2	elon 6376	. . . . . 6 ⊢ (𝑥 ∈ On ↔ Ord 𝑥)
4		ordelord 6389	. . . . . 6 ⊢ ((Ord 𝑥 ∧ 𝑦 ∈ 𝑥) → Ord 𝑦)
5	3, 4	sylanb 593	. . . . 5 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ 𝑥) → Ord 𝑦)
6	5	ex 418	. . . 4 ⊢ (𝑥 ∈ On → (𝑦 ∈ 𝑥 → Ord 𝑦))
7		vex 3462	. . . . 5 ⊢ 𝑦 ∈ V
8	7	elon 6376	. . . 4 ⊢ (𝑦 ∈ On ↔ Ord 𝑦)
9	6, 8	imbitrrdi 255	. . 3 ⊢ (𝑥 ∈ On → (𝑦 ∈ 𝑥 → 𝑦 ∈ On))
10	9	ssrdv 3946	. 2 ⊢ (𝑥 ∈ On → 𝑥 ⊆ On)
11	1, 10	mprgbir 3089	1 ⊢ Tr On

This proof depends on syntax axioms:   ∈ wcel 2146   ⊆ wss 3908  Tr wtr 5223  Ord word 6366  Oncon0 6367

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 2148  ax-9 2156  ax-ext 2738  ax-sep 5262  ax-pr 5409

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-ral 3083  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-tr 5224  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-we 5621  df-ord 6370  df-on 6371

This theorem is used by:  ordon  7785  predon  7794  onuninsuci  7845  gruina  10821