MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  onin Structured version   Visualization version   GIF version

Theorem onin 6415
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
StepHypRef Expression
1 eloni 6393 . . 3 (𝐴 ∈ On → Ord 𝐴)
2 eloni 6393 . . 3 (𝐵 ∈ On → Ord 𝐵)
3 ordin 6414 . . 3 ((Ord 𝐴 ∧ Ord 𝐵) → Ord (𝐴 ∩ 𝐵))
41, 2, 3syl2an 608 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → Ord (𝐴 ∩ 𝐵))
5 simpl 488 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐴 ∈ On)
6 inex1g 5284 . . 3 (𝐴 ∈ On → (𝐴 ∩ 𝐵) ∈ V)
7 elong 6391 . . 3 ((𝐴 ∩ 𝐵) ∈ V → ((𝐴 ∩ 𝐵) ∈ On ↔ Ord (𝐴 ∩ 𝐵)))
85, 6, 73syl 19 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 ∩ 𝐵) ∈ On ↔ Ord (𝐴 ∩ 𝐵)))
94, 8mpbird 260 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∩ 𝐵) ∈ On)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2147  Vcvv 3454   ∩ cin 4092  Ord word 6382  Oncon0 6383
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5253
This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rab 3417  df-v 3456  df-ss 3901  df-in 4094  df-uni 4871  df-tr 5217  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-ord 6386  df-on 6387
This theorem is used by:  tfrlem5  8418  noreson  28050  ontopbas  37407
  Copyright terms: Public domain W3C validator