| 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 4342 | . . 3 ⊢ ({𝑥 ∈ On ∣ 𝜑} ≠ ∅ ↔ ∃𝑥 ∈ On 𝜑) | |
| 2 | ssrab2 4031 | . . . 4 ⊢ {𝑥 ∈ On ∣ 𝜑} ⊆ On | |
| 3 | onint 7793 | . . . 4 ⊢ (({𝑥 ∈ On ∣ 𝜑} ⊆ On ∧ {𝑥 ∈ On ∣ 𝜑} ≠ ∅) → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑}) | |
| 4 | 2, 3 | mpan 703 | . . 3 ⊢ ({𝑥 ∈ On ∣ 𝜑} ≠ ∅ → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑}) |
| 5 | 1, 4 | sylbir 238 | . 2 ⊢ (∃𝑥 ∈ On 𝜑 → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑}) |
| 6 | nfrab1 3434 | . . . . 5 ⊢ Ⅎ𝑥{𝑥 ∈ On ∣ 𝜑} | |
| 7 | 6 | nfint 4920 | . . . 4 ⊢ Ⅎ𝑥∩ {𝑥 ∈ On ∣ 𝜑} |
| 8 | nfcv 2924 | . . . 4 ⊢ Ⅎ𝑥On | |
| 9 | onminsb.1 | . . . 4 ⊢ Ⅎ𝑥𝜓 | |
| 10 | onminsb.2 | . . . 4 ⊢ (𝑥 = ∩ {𝑥 ∈ On ∣ 𝜑} → (𝜑 ↔ 𝜓)) | |
| 11 | 7, 8, 9, 10 | elrabf 3645 | . . 3 ⊢ (∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑} ↔ (∩ {𝑥 ∈ On ∣ 𝜑} ∈ On ∧ 𝜓)) |
| 12 | 11 | simprbi 503 | . 2 ⊢ (∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑} → 𝜓) |
| 13 | 5, 12 | syl 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 2957 ∃wrex 3088 {crab 3414 ⊆ wss 3902 ∅c0 4282 ∩ cint 4910 Oncon0 6361 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-pr 5402 |
| 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 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-br 5108 df-opab 5172 df-tr 5217 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-ord 6364 df-on 6365 |
| This theorem is used by: oawordeulem 8545 rankidb 9786 cardmin2 10008 cardaleph 10096 cardmin 10576 onvf1odlem2 35709 vonf1oonfo 35720 naddwordnexlem4 44250 |
| Copyright terms: Public domain | W3C validator |