Theorem ordin 4387

Description: The intersection of two ordinal classes is ordinal. Proposition 7.9 of [TakeutiZaring] p. 37. (Contributed by NM, 9-May-1994.)

Assertion

Ref	Expression
ordin	⊢ ((Ord 𝐴 ∧ Ord 𝐵) → Ord (𝐴 ∩ 𝐵))

Proof of Theorem ordin

Step	Hyp	Ref	Expression
1		ordtr 4380	. . 3 ⊢ (Ord 𝐴 → Tr 𝐴)
2		ordtr 4380	. . 3 ⊢ (Ord 𝐵 → Tr 𝐵)
3		trin 4113	. . 3 ⊢ ((Tr 𝐴 ∧ Tr 𝐵) → Tr (𝐴 ∩ 𝐵))
4	1, 2, 3	syl2an 289	. 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → Tr (𝐴 ∩ 𝐵))
5		inss2 3358	. . 3 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵
6		trssord 4382	. . 3 ⊢ ((Tr (𝐴 ∩ 𝐵) ∧ (𝐴 ∩ 𝐵) ⊆ 𝐵 ∧ Ord 𝐵) → Ord (𝐴 ∩ 𝐵))
7	5, 6	mp3an2 1325	. 2 ⊢ ((Tr (𝐴 ∩ 𝐵) ∧ Ord 𝐵) → Ord (𝐴 ∩ 𝐵))
8	4, 7	sylancom 420	1 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → Ord (𝐴 ∩ 𝐵))

Syntax hints:   → wi 4   ∧ wa 104   ∩ cin 3130   ⊆ wss 3131  Tr wtr 4103  Ord word 4364

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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-v 2741  df-in 3137  df-ss 3144  df-uni 3812  df-tr 4104  df-iord 4368

This theorem is referenced by:  onin  4388  smores  6295  smores2  6297