Theorem trssord 6381

Description: A transitive subclass of an ordinal class is ordinal. (Contributed by NM, 29-May-1994.)

Assertion

Ref	Expression
trssord	⊢ ((Tr 𝐴 ∧ 𝐴 ⊆ 𝐵 ∧ Ord 𝐵) → Ord 𝐴)

Proof of Theorem trssord

Step	Hyp	Ref	Expression
1		wess 5663	. . . . 5 ⊢ (𝐴 ⊆ 𝐵 → ( E We 𝐵 → E We 𝐴))
2		ordwe 6377	. . . . 5 ⊢ (Ord 𝐵 → E We 𝐵)
3	1, 2	impel 505	. . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ Ord 𝐵) → E We 𝐴)
4	3	anim2i 616	. . 3 ⊢ ((Tr 𝐴 ∧ (𝐴 ⊆ 𝐵 ∧ Ord 𝐵)) → (Tr 𝐴 ∧ E We 𝐴))
5	4	3impb 1114	. 2 ⊢ ((Tr 𝐴 ∧ 𝐴 ⊆ 𝐵 ∧ Ord 𝐵) → (Tr 𝐴 ∧ E We 𝐴))
6		df-ord 6367	. 2 ⊢ (Ord 𝐴 ↔ (Tr 𝐴 ∧ E We 𝐴))
7	5, 6	sylibr 233	1 ⊢ ((Tr 𝐴 ∧ 𝐴 ⊆ 𝐵 ∧ Ord 𝐵) → Ord 𝐴)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   ⊆ wss 3948  Tr wtr 5265   E cep 5579   We wwe 5630  Ord word 6363

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-ext 2702

This theorem depends on definitions:  df-bi 206  df-an 396  df-3an 1088  df-tru 1543  df-ex 1781  df-sb 2067  df-clab 2709  df-cleq 2723  df-clel 2809  df-ral 3061  df-v 3475  df-in 3955  df-ss 3965  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-ord 6367

This theorem is referenced by:  ordin  6394  ssorduni  7769  ordsuci  7799  sucexeloniOLD  7801  suceloniOLD  7803  ordom  7868  ordtypelem2  9517  hartogs  9542  card2on  9552  tskwe  9948  ondomon  10561  dford3lem2  42069  dford3  42070  iunord  47809