Theorem trssord 6334

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 5611	. . . . 5 ⊢ (𝐴 ⊆ 𝐵 → ( E We 𝐵 → E We 𝐴))
2		ordwe 6330	. . . . 5 ⊢ (Ord 𝐵 → E We 𝐵)
3	1, 2	impel 510	. . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ Ord 𝐵) → E We 𝐴)
4	3	anim2i 623	. . 3 ⊢ ((Tr 𝐴 ∧ (𝐴 ⊆ 𝐵 ∧ Ord 𝐵)) → (Tr 𝐴 ∧ E We 𝐴))
5	4	3impb 1120	. 2 ⊢ ((Tr 𝐴 ∧ 𝐴 ⊆ 𝐵 ∧ Ord 𝐵) → (Tr 𝐴 ∧ E We 𝐴))
6		df-ord 6320	. 2 ⊢ (Ord 𝐴 ↔ (Tr 𝐴 ∧ E We 𝐴))
7	5, 6	sylibr 235	1 ⊢ ((Tr 𝐴 ∧ 𝐴 ⊆ 𝐵 ∧ Ord 𝐵) → Ord 𝐴)

Syntax hints:   → wi 4   ∧ wa 396   ∧ w3a 1092   ⊆ wss 3890  Tr wtr 5186   E cep 5524   We wwe 5577  Ord word 6316

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917

This theorem depends on definitions:  df-bi 208  df-an 397  df-3an 1094  df-ral 3055  df-ss 3907  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-ord 6320

This theorem is referenced by:  ordin  6347  ssorduni  7729  ordsuci  7758  ordom  7823  ordtypelem2  9431  hartogs  9456  card2on  9466  tskwe  9872  ondomon  10483  dford3lem2  43473  dford3  43474  iunord  50167