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

Theorem onintrab2 6894
 Description: An existence condition equivalent to an intersection's being an ordinal number. (Contributed by NM, 6-Nov-2003.)
Assertion
Ref Expression
onintrab2 (∃𝑥 ∈ On 𝜑 {𝑥 ∈ On ∣ 𝜑} ∈ On)

Proof of Theorem onintrab2
StepHypRef Expression
1 intexrab 4750 . 2 (∃𝑥 ∈ On 𝜑 {𝑥 ∈ On ∣ 𝜑} ∈ V)
2 onintrab 6893 . 2 ( {𝑥 ∈ On ∣ 𝜑} ∈ V ↔ {𝑥 ∈ On ∣ 𝜑} ∈ On)
31, 2bitri 263 1 (∃𝑥 ∈ On 𝜑 {𝑥 ∈ On ∣ 𝜑} ∈ On)
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 195   ∈ wcel 1977  ∃wrex 2897  {crab 2900  Vcvv 3173  ∩ cint 4410  Oncon0 5640 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833  ax-un 6847 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-tp 4130  df-op 4132  df-uni 4373  df-int 4411  df-br 4584  df-opab 4644  df-tr 4681  df-eprel 4949  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-ord 5643  df-on 5644 This theorem is referenced by:  oeeulem  7568  cardmin2  8707  cardaleph  8795  cardmin  9265  nosepon  31066  nobndlem2  31092  nobndlem4  31094  nobndlem6  31096  nofulllem4  31104
 Copyright terms: Public domain W3C validator