| 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 4352 | . . 3 ⊢ ({𝑥 ∈ On ∣ 𝜑} ≠ ∅ ↔ ∃𝑥 ∈ On 𝜑) | |
| 2 | ssrab2 4043 | . . . 4 ⊢ {𝑥 ∈ On ∣ 𝜑} ⊆ On | |
| 3 | onint 7766 | . . . 4 ⊢ (({𝑥 ∈ On ∣ 𝜑} ⊆ On ∧ {𝑥 ∈ On ∣ 𝜑} ≠ ∅) → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑}) | |
| 4 | 2, 3 | mpan 690 | . . 3 ⊢ ({𝑥 ∈ On ∣ 𝜑} ≠ ∅ → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑}) |
| 5 | 1, 4 | sylbir 235 | . 2 ⊢ (∃𝑥 ∈ On 𝜑 → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑}) |
| 6 | nfrab1 3426 | . . . . 5 ⊢ Ⅎ𝑥{𝑥 ∈ On ∣ 𝜑} | |
| 7 | 6 | nfint 4920 | . . . 4 ⊢ Ⅎ𝑥∩ {𝑥 ∈ On ∣ 𝜑} |
| 8 | nfcv 2891 | . . . 4 ⊢ Ⅎ𝑥On | |
| 9 | onminsb.1 | . . . 4 ⊢ Ⅎ𝑥𝜓 | |
| 10 | onminsb.2 | . . . 4 ⊢ (𝑥 = ∩ {𝑥 ∈ On ∣ 𝜑} → (𝜑 ↔ 𝜓)) | |
| 11 | 7, 8, 9, 10 | elrabf 3655 | . . 3 ⊢ (∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑} ↔ (∩ {𝑥 ∈ On ∣ 𝜑} ∈ On ∧ 𝜓)) |
| 12 | 11 | simprbi 496 | . 2 ⊢ (∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑} → 𝜓) |
| 13 | 5, 12 | syl 17 | 1 ⊢ (∃𝑥 ∈ On 𝜑 → 𝜓) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1540 Ⅎwnf 1783 ∈ wcel 2109 ≠ wne 2925 ∃wrex 3053 {crab 3405 ⊆ wss 3914 ∅c0 4296 ∩ cint 4910 Oncon0 6332 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-int 4911 df-br 5108 df-opab 5170 df-tr 5215 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-ord 6335 df-on 6336 |
| This theorem is referenced by: oawordeulem 8518 rankidb 9753 cardmin2 9952 cardaleph 10042 cardmin 10517 onvf1odlem2 35091 naddwordnexlem4 43390 |
| Copyright terms: Public domain | W3C validator |