Theorem ordelss 4476

Description: An element of an ordinal class is a subset of it. (Contributed by NM, 30-May-1994.)

Assertion

Ref	Expression
ordelss	⊢ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵 ⊆ 𝐴)

Proof of Theorem ordelss

Step	Hyp	Ref	Expression
1		ordtr 4475	. 2 ⊢ (Ord 𝐴 → Tr 𝐴)
2		trss 4196	. . 3 ⊢ (Tr 𝐴 → (𝐵 ∈ 𝐴 → 𝐵 ⊆ 𝐴))
3	2	imp 124	. 2 ⊢ ((Tr 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵 ⊆ 𝐴)
4	1, 3	sylan 283	1 ⊢ ((Ord 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵 ⊆ 𝐴)

Syntax hints:   → wi 4   ∧ wa 104   ∈ wcel 2202   ⊆ wss 3200  Tr wtr 4187  Ord word 4459

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213

This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-v 2804  df-in 3206  df-ss 3213  df-uni 3894  df-tr 4188  df-iord 4463

This theorem is referenced by:  ordelord  4478  onelss  4484  ordsuc  4661  smores3  6459  tfrlem1  6474  tfrlemisucaccv  6491  tfrlemiubacc  6496  tfr1onlemsucaccv  6507  tfr1onlemubacc  6512  tfrcllemsucaccv  6520  tfrcllemubacc  6525  nntri1  6664  nnsseleq  6669  fict  7055  infnfi  7084  isinfinf  7086  ordiso2  7234  hashinfuni  11040