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

Theorem onminsb 4589
Description: If a property is true for some ordinal number, it is true for a minimal ordinal number. This version uses implicit substitution. Theorem Schema 62 of [Suppes] p. 228. (Contributed by NM, 3-Oct-2003.)
Hypotheses
Ref Expression
onminsb.1  |-  F/ x ps
onminsb.2  |-  ( x  =  |^| { x  e.  On  |  ph }  ->  ( ph  <->  ps )
)
Assertion
Ref Expression
onminsb  |-  ( E. x  e.  On  ph  ->  ps )

Proof of Theorem onminsb
StepHypRef Expression
1 rabn0 3475 . . 3  |-  ( { x  e.  On  |  ph }  =/=  (/)  <->  E. x  e.  On  ph )
2 ssrab2 3259 . . . 4  |-  { x  e.  On  |  ph }  C_  On
3 onint 4585 . . . 4  |-  ( ( { x  e.  On  |  ph }  C_  On  /\ 
{ x  e.  On  |  ph }  =/=  (/) )  ->  |^| { x  e.  On  |  ph }  e.  {
x  e.  On  |  ph } )
42, 3mpan 651 . . 3  |-  ( { x  e.  On  |  ph }  =/=  (/)  ->  |^| { x  e.  On  |  ph }  e.  { x  e.  On  |  ph } )
51, 4sylbir 204 . 2  |-  ( E. x  e.  On  ph  ->  |^| { x  e.  On  |  ph }  e.  { x  e.  On  |  ph } )
6 nfrab1 2721 . . . . 5  |-  F/_ x { x  e.  On  |  ph }
76nfint 3873 . . . 4  |-  F/_ x |^| { x  e.  On  |  ph }
8 nfcv 2420 . . . 4  |-  F/_ x On
9 onminsb.1 . . . 4  |-  F/ x ps
10 onminsb.2 . . . 4  |-  ( x  =  |^| { x  e.  On  |  ph }  ->  ( ph  <->  ps )
)
117, 8, 9, 10elrabf 2923 . . 3  |-  ( |^| { x  e.  On  |  ph }  e.  { x  e.  On  |  ph }  <->  (
|^| { x  e.  On  |  ph }  e.  On  /\ 
ps ) )
1211simprbi 450 . 2  |-  ( |^| { x  e.  On  |  ph }  e.  { x  e.  On  |  ph }  ->  ps )
135, 12syl 15 1  |-  ( E. x  e.  On  ph  ->  ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176   F/wnf 1531    = wceq 1623    e. wcel 1685    =/= wne 2447   E.wrex 2545   {crab 2548    C_ wss 3153   (/)c0 3456   |^|cint 3863   Oncon0 4391
This theorem is referenced by:  oawordeulem  6548  rankidb  7468  cardmin2  7627  cardaleph  7712  cardmin  8182
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1636  ax-8 1644  ax-13 1687  ax-14 1689  ax-6 1704  ax-7 1709  ax-11 1716  ax-12 1868  ax-ext 2265  ax-sep 4142  ax-nul 4150  ax-pr 4213  ax-un 4511
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1631  df-eu 2148  df-mo 2149  df-clab 2271  df-cleq 2277  df-clel 2280  df-nfc 2409  df-ne 2449  df-ral 2549  df-rex 2550  df-rab 2553  df-v 2791  df-sbc 2993  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-pss 3169  df-nul 3457  df-if 3567  df-sn 3647  df-pr 3648  df-tp 3649  df-op 3650  df-uni 3829  df-int 3864  df-br 4025  df-opab 4079  df-tr 4115  df-eprel 4304  df-po 4313  df-so 4314  df-fr 4351  df-we 4353  df-ord 4394  df-on 4395
  Copyright terms: Public domain W3C validator