Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  onnminsb Unicode version

Theorem onnminsb 6639
 Description: An ordinal number smaller than the minimum of a set of ordinal numbers does not have the property determining that set. is the wff resulting from the substitution of for in wff . (Contributed by NM, 9-Nov-2003.)
Hypothesis
Ref Expression
onnminsb.1
Assertion
Ref Expression
onnminsb
Distinct variable groups:   ,   ,

Proof of Theorem onnminsb
StepHypRef Expression
1 onnminsb.1 . . . . 5
21elrab 3257 . . . 4
3 ssrab2 3584 . . . . 5
4 onnmin 6638 . . . . 5
53, 4mpan 670 . . . 4
62, 5sylbir 213 . . 3
76ex 434 . 2
87con2d 115 1
 Colors of variables: wff setvar class Syntax hints:  -.wn 3  ->wi 4  <->wb 184  /\wa 369  =wceq 1395  e.wcel 1818  {crab 2811  C_wss 3475  |^|cint 4286   con0 4883 This theorem is referenced by:  onminex  6642  oawordeulem  7222  oeeulem  7269  nnawordex  7305  tcrank  8323  alephnbtwn  8473  cardaleph  8491  cardmin  8960  sltval2  29416 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1618  ax-4 1631  ax-5 1704  ax-6 1747  ax-7 1790  ax-8 1820  ax-9 1822  ax-10 1837  ax-11 1842  ax-12 1854  ax-13 1999  ax-ext 2435  ax-sep 4573  ax-nul 4581  ax-pr 4691  ax-un 6592 This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 974  df-3an 975  df-tru 1398  df-ex 1613  df-nf 1617  df-sb 1740  df-eu 2286  df-mo 2287  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ne 2654  df-ral 2812  df-rex 2813  df-rab 2816  df-v 3111  df-sbc 3328  df-dif 3478  df-un 3480  df-in 3482  df-ss 3489  df-pss 3491  df-nul 3785  df-if 3942  df-sn 4030  df-pr 4032  df-tp 4034  df-op 4036  df-uni 4250  df-int 4287  df-br 4453  df-opab 4511  df-tr 4546  df-eprel 4796  df-po 4805  df-so 4806  df-fr 4843  df-we 4845  df-ord 4886  df-on 4887
 Copyright terms: Public domain W3C validator