Theorem trssord 6379

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 5636	. . . . 5 ⊢ (𝐴 ⊆ 𝐵 → ( E We 𝐵 → E We 𝐴))
2		ordwe 6375	. . . . 5 ⊢ (Ord 𝐵 → E We 𝐵)
3	1, 2	impel 515	. . . 4 ⊢ ((𝐴 ⊆ 𝐵 ∧ Ord 𝐵) → E We 𝐴)
4	3	anim2i 629	. . 3 ⊢ ((Tr 𝐴 ∧ (𝐴 ⊆ 𝐵 ∧ Ord 𝐵)) → (Tr 𝐴 ∧ E We 𝐴))
5	4	3impb 1132	. 2 ⊢ ((Tr 𝐴 ∧ 𝐴 ⊆ 𝐵 ∧ Ord 𝐵) → (Tr 𝐴 ∧ E We 𝐴))
6		df-ord 6365	. 2 ⊢ (Ord 𝐴 ↔ (Tr 𝐴 ∧ E We 𝐴))
7	5, 6	sylibr 237	1 ⊢ ((Tr 𝐴 ∧ 𝐴 ⊆ 𝐵 ∧ Ord 𝐵) → Ord 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   ⊆ wss 3895  Tr wtr 5211   E cep 5549   We wwe 5602  Ord word 6361

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942

This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-ral 3077  df-ss 3896  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-ord 6365

This theorem is used by:  ordin  6393  ssorduni  7793  ordsuci  7822  ordom  7887  ordtypelem2  9514  hartogs  9539  card2on  9549  tskwe  10032  ondomon  10648  dford3lem2  44110  dford3  44111  iunord  50860