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

Theorem onssmin 7787
Description: A nonempty class of ordinal numbers has the smallest member. Exercise 9 of [TakeutiZaring] p. 40. (Contributed by NM, 3-Oct-2003.)
Assertion
Ref Expression
onssmin ((𝐴 ⊆ On ∧ 𝐴 ≠ ∅) → ∃𝑥𝐴𝑦𝐴 𝑥𝑦)
Distinct variable group:   𝑥,𝑦,𝐴

Proof of Theorem onssmin
StepHypRef Expression
1 onint 7785 . 2 ((𝐴 ⊆ On ∧ 𝐴 ≠ ∅) → 𝐴𝐴)
2 intss1 4928 . . 3 (𝑦𝐴 𝐴𝑦)
32rgen 3081 . 2 𝑦𝐴 𝐴𝑦
4 sseq1 3962 . . . 4 (𝑥 = 𝐴 → (𝑥𝑦 𝐴𝑦))
54ralbidv 3188 . . 3 (𝑥 = 𝐴 → (∀𝑦𝐴 𝑥𝑦 ↔ ∀𝑦𝐴 𝐴𝑦))
65rspcev 3581 . 2 (( 𝐴𝐴 ∧ ∀𝑦𝐴 𝐴𝑦) → ∃𝑥𝐴𝑦𝐴 𝑥𝑦)
71, 3, 6sylancl 597 1 ((𝐴 ⊆ On ∧ 𝐴 ≠ ∅) → ∃𝑥𝐴𝑦𝐴 𝑥𝑦)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1570  wcel 2143  wne 2958  wral 3079  wrex 3089  wss 3905  c0 4286   cint 4912  Oncon0 6360
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  ax-sep 5257  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-br 5110  df-opab 5174  df-tr 5219  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-ord 6363  df-on 6364
This theorem is referenced by:  nummin  35484  vonf1wev  35592  vonf1owevOLD  35594
  Copyright terms: Public domain W3C validator