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

Theorem onminsb 7797
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 4339 . . 3 ({𝑥 ∈ On ∣ 𝜑} ≠ ∅ ↔ ∃𝑥 ∈ On 𝜑)
2 ssrab2 4028 . . . 4 {𝑥 ∈ On ∣ 𝜑} ⊆ On
3 onint 7793 . . . 4 (({𝑥 ∈ On ∣ 𝜑} ⊆ On ∧ {𝑥 ∈ On ∣ 𝜑} ≠ ∅) → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑})
42, 3mpan 703 . . 3 ({𝑥 ∈ On ∣ 𝜑} ≠ ∅ → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑})
51, 4sylbir 238 . 2 (∃𝑥 ∈ On 𝜑 → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑})
6 nfrab1 3432 . . . . 5 Ⅎ𝑥{𝑥 ∈ On ∣ 𝜑}
76nfint 4917 . . . 4 Ⅎ𝑥∩ {𝑥 ∈ On ∣ 𝜑}
8 nfcv 2923 . . . 4 Ⅎ𝑥On
9 onminsb.1 . . . 4 Ⅎ𝑥𝜓
10 onminsb.2 . . . 4 (𝑥 = ∩ {𝑥 ∈ On ∣ 𝜑} → (𝜑 ↔ 𝜓))
117, 8, 9, 10elrabf 3642 . . 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 1570  Ⅎwnf 1816   ∈ wcel 2145   ≠ wne 2956  ∃wrex 3087  {crab 3413   ⊆ wss 3899  ∅c0 4279  ∩ cint 4907  Oncon0 6355
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-br 5104  df-opab 5168  df-tr 5213  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-ord 6358  df-on 6359
This theorem is used by:  oawordeulem  8546  rankidb  9790  cardmin2  10061  cardaleph  10149  cardmin  10629  onvf1odlem2  35856  vonf1oonfo  35867  naddwordnexlem4  44361
  Copyright terms: Public domain W3C validator