| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > onminsb | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| onminsb.1 | ⊢ Ⅎ𝑥𝜓 |
| onminsb.2 | ⊢ (𝑥 = ∩ {𝑥 ∈ On ∣ 𝜑} → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| onminsb | ⊢ (∃𝑥 ∈ On 𝜑 → 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rabn0 4346 | . . 3 ⊢ ({𝑥 ∈ On ∣ 𝜑} ≠ ∅ ↔ ∃𝑥 ∈ On 𝜑) | |
| 2 | ssrab2 4036 | . . . 4 ⊢ {𝑥 ∈ On ∣ 𝜑} ⊆ On | |
| 3 | onint 7777 | . . . 4 ⊢ (({𝑥 ∈ On ∣ 𝜑} ⊆ On ∧ {𝑥 ∈ On ∣ 𝜑} ≠ ∅) → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑}) | |
| 4 | 2, 3 | mpan 702 | . . 3 ⊢ ({𝑥 ∈ On ∣ 𝜑} ≠ ∅ → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑}) |
| 5 | 1, 4 | sylbir 238 | . 2 ⊢ (∃𝑥 ∈ On 𝜑 → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑}) |
| 6 | nfrab1 3437 | . . . . 5 ⊢ Ⅎ𝑥{𝑥 ∈ On ∣ 𝜑} | |
| 7 | 6 | nfint 4918 | . . . 4 ⊢ Ⅎ𝑥∩ {𝑥 ∈ On ∣ 𝜑} |
| 8 | nfcv 2927 | . . . 4 ⊢ Ⅎ𝑥On | |
| 9 | onminsb.1 | . . . 4 ⊢ Ⅎ𝑥𝜓 | |
| 10 | onminsb.2 | . . . 4 ⊢ (𝑥 = ∩ {𝑥 ∈ On ∣ 𝜑} → (𝜑 ↔ 𝜓)) | |
| 11 | 7, 8, 9, 10 | elrabf 3650 | . . 3 ⊢ (∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑} ↔ (∩ {𝑥 ∈ On ∣ 𝜑} ∈ On ∧ 𝜓)) |
| 12 | 11 | simprbi 502 | . 2 ⊢ (∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑} → 𝜓) |
| 13 | 5, 12 | syl 18 | 1 ⊢ (∃𝑥 ∈ On 𝜑 → 𝜓) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 = wceq 1563 Ⅎwnf 1806 ∈ wcel 2145 ≠ wne 2960 ∃wrex 3089 {crab 3417 ⊆ wss 3907 ∅c0 4288 ∩ cint 4908 Oncon0 6350 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-pr 5395 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-int 4909 df-br 5106 df-opab 5168 df-tr 5213 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-we 5607 df-ord 6353 df-on 6354 |
| This theorem is referenced by: oawordeulem 8527 rankidb 9760 cardmin2 9973 cardaleph 10061 cardmin 10536 onvf1odlem2 35459 vonf1oonfo 35470 naddwordnexlem4 43990 |
| Copyright terms: Public domain | W3C validator |