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

Theorem onminsb 7809
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 Ⅎ𝑥𝜓
onminsb.2 (𝑥 = ∩ {𝑥 ∈ On ∣ 𝜑} → (𝜑 ↔ 𝜓))
Assertion
Ref Expression
onminsb (∃𝑥 ∈ On 𝜑 → 𝜓)

Proof of Theorem onminsb
StepHypRef Expression
1 rabn0 4338 . . 3 ({𝑥 ∈ On ∣ 𝜑} ≠ ∅ ↔ ∃𝑥 ∈ On 𝜑)
2 ssrab2 4005 . . . 4 {𝑥 ∈ On ∣ 𝜑} ⊆ On
3 onint 7805 . . . 4 (({𝑥 ∈ On ∣ 𝜑} ⊆ On ∧ {𝑥 ∈ On ∣ 𝜑} ≠ ∅) → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑})
42, 3mpan 703 . . 3 ({𝑥 ∈ On ∣ 𝜑} ≠ ∅ → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑})
51, 4sylbir 238 . 2 (∃𝑥 ∈ On 𝜑 → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑})
6 nfrab1 3431 . . . . 5 Ⅎ𝑥{𝑥 ∈ On ∣ 𝜑}
76nfint 4916 . . . 4 Ⅎ𝑥∩ {𝑥 ∈ On ∣ 𝜑}
8 nfcv 2922 . . . 4 Ⅎ𝑥On
9 onminsb.1 . . . 4 Ⅎ𝑥𝜓
10 onminsb.2 . . . 4 (𝑥 = ∩ {𝑥 ∈ On ∣ 𝜑} → (𝜑 ↔ 𝜓))
117, 8, 9, 10elrabf 3641 . . 3 (∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑} ↔ (∩ {𝑥 ∈ On ∣ 𝜑} ∈ On ∧ 𝜓))
1211simprbi 503 . 2 (∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑} → 𝜓)
135, 12syl 18 1 (∃𝑥 ∈ On 𝜑 → 𝜓)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569  Ⅎwnf 1815   ∈ wcel 2144   ≠ wne 2955  ∃wrex 3086  {crab 3412   ⊆ wss 3895  ∅c0 4278  ∩ cint 4906  Oncon0 6362
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  df-br 5103  df-opab 5167  df-tr 5212  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-ord 6365  df-on 6366
This theorem is used by:  oawordeulem  8566  rankidb  9812  cardmin2  10084  cardaleph  10172  cardmin  10652  onvf1odlem2  35952  onprcf1acwevdlem2  35966  vonf1oonfo  35969  onprcf1of1ord  35975  naddwordnexlem4  44497
  Copyright terms: Public domain W3C validator