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

Theorem ordin 6393
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
StepHypRef Expression
1 ordtr 6376 . . 3 (Ord 𝐴 → Tr 𝐴)
2 ordtr 6376 . . 3 (Ord 𝐵 → Tr 𝐵)
3 trin 5231 . . 3 ((Tr 𝐴 ∧ Tr 𝐵) → Tr (𝐴𝐵))
41, 2, 3syl2an 607 . 2 ((Ord 𝐴 ∧ Ord 𝐵) → Tr (𝐴𝐵))
5 inss2 4191 . . 3 (𝐴𝐵) ⊆ 𝐵
6 trssord 6379 . . 3 ((Tr (𝐴𝐵) ∧ (𝐴𝐵) ⊆ 𝐵 ∧ Ord 𝐵) → Ord (𝐴𝐵))
75, 6mp3an2 1478 . 2 ((Tr (𝐴𝐵) ∧ Ord 𝐵) → Ord (𝐴𝐵))
84, 7sylancom 599 1 ((Ord 𝐴 ∧ Ord 𝐵) → Ord (𝐴𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  cin 3905  wss 3906  Tr wtr 5219  Ord word 6361
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735
This theorem depends on definitions:  df-bi 210  df-an 401  df-3an 1105  df-tru 1573  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rab 3417  df-v 3457  df-in 3913  df-ss 3923  df-uni 4874  df-tr 5220  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-ord 6365
This theorem is referenced by:  onin  6394  ordtri3or  6395  ordelinel  6466  smores  8340  smores2  8342  ordtypelem5  9485  ordtypelem7  9487
  Copyright terms: Public domain W3C validator