Theorem onin 6389

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 6367	. . 3 ⊢ (𝐴 ∈ On → Ord 𝐴)
2		eloni 6367	. . 3 ⊢ (𝐵 ∈ On → Ord 𝐵)
3		ordin 6388	. . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → Ord (𝐴 ∩ 𝐵))
4	1, 2, 3	syl2an 608	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → Ord (𝐴 ∩ 𝐵))
5		simpl 488	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐴 ∈ On)
6		inex1g 5282	. . 3 ⊢ (𝐴 ∈ On → (𝐴 ∩ 𝐵) ∈ V)
7		elong 6365	. . 3 ⊢ ((𝐴 ∩ 𝐵) ∈ V → ((𝐴 ∩ 𝐵) ∈ On ↔ Ord (𝐴 ∩ 𝐵)))
8	5, 6, 7	3syl 19	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 ∩ 𝐵) ∈ On ↔ Ord (𝐴 ∩ 𝐵)))
9	4, 8	mpbird 260	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∩ 𝐵) ∈ On)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2145  Vcvv 3450   ∩ cin 3898  Ord word 6356  Oncon0 6357

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732  ax-sep 5251

This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rab 3413  df-v 3452  df-in 3906  df-ss 3916  df-uni 4868  df-tr 5213  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-ord 6360  df-on 6361

This theorem is used by:  tfrlem5  8368  noreson  27896  ontopbas  37047