Theorem onin 4385

Description: The intersection of two ordinal numbers is an ordinal number. (Contributed by NM, 7-Apr-1995.)

Assertion

Ref	Expression
onin	⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∩ 𝐵) ∈ On)

Proof of Theorem onin

Step	Hyp	Ref	Expression
1		eloni 4374	. . 3 ⊢ (𝐴 ∈ On → Ord 𝐴)
2		eloni 4374	. . 3 ⊢ (𝐵 ∈ On → Ord 𝐵)
3		ordin 4384	. . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → Ord (𝐴 ∩ 𝐵))
4	1, 2, 3	syl2an 289	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → Ord (𝐴 ∩ 𝐵))
5		simpl 109	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐴 ∈ On)
6		inex1g 4138	. . 3 ⊢ (𝐴 ∈ On → (𝐴 ∩ 𝐵) ∈ V)
7		elong 4372	. . 3 ⊢ ((𝐴 ∩ 𝐵) ∈ V → ((𝐴 ∩ 𝐵) ∈ On ↔ Ord (𝐴 ∩ 𝐵)))
8	5, 6, 7	3syl 17	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 ∩ 𝐵) ∈ On ↔ Ord (𝐴 ∩ 𝐵)))
9	4, 8	mpbird 167	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∩ 𝐵) ∈ On)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∈ wcel 2148  Vcvv 2737   ∩ cin 3128  Ord word 4361  Oncon0 4362

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  ax-sep 4120

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-rex 2461  df-v 2739  df-in 3135  df-ss 3142  df-uni 3810  df-tr 4101  df-iord 4365  df-on 4367

This theorem is referenced by:  tfrlem5  6311