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

Theorem tron 6384
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.
StepHypRef Expression
1 dftr3 5221 . 2 (Tr On ↔ ∀𝑥 ∈ On 𝑥 ⊆ On)
2 vex 3457 . . . . . . 7 𝑥 ∈ V
32elon 6370 . . . . . 6 (𝑥 ∈ On ↔ Ord 𝑥)
4 ordelord 6383 . . . . . 6 ((Ord 𝑥𝑦𝑥) → Ord 𝑦)
53, 4sylanb 593 . . . . 5 ((𝑥 ∈ On ∧ 𝑦𝑥) → Ord 𝑦)
65ex 418 . . . 4 (𝑥 ∈ On → (𝑦𝑥 → Ord 𝑦))
7 vex 3457 . . . . 5 𝑦 ∈ V
87elon 6370 . . . 4 (𝑦 ∈ On ↔ Ord 𝑦)
96, 8imbitrrdi 255 . . 3 (𝑥 ∈ On → (𝑦𝑥𝑦 ∈ On))
109ssrdv 3940 . 2 (𝑥 ∈ On → 𝑥 ⊆ On)
111, 10mprgbir 3085 1 Tr On
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wcel 2145  wss 3902  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  ax-sep 5255  ax-pr 5402
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 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-tr 5217  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-ord 6364  df-on 6365
This theorem is used by:  ordon  7780  predon  7789  onuninsuci  7840  gruina  10831
  Copyright terms: Public domain W3C validator