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 4316 | . . 3 ⊢ ({𝑥 ∈ On ∣ 𝜑} ≠ ∅ ↔ ∃𝑥 ∈ On 𝜑) | |
2 | ssrab2 4009 | . . . 4 ⊢ {𝑥 ∈ On ∣ 𝜑} ⊆ On | |
3 | onint 7617 | . . . 4 ⊢ (({𝑥 ∈ On ∣ 𝜑} ⊆ On ∧ {𝑥 ∈ On ∣ 𝜑} ≠ ∅) → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑}) | |
4 | 2, 3 | mpan 686 | . . 3 ⊢ ({𝑥 ∈ On ∣ 𝜑} ≠ ∅ → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑}) |
5 | 1, 4 | sylbir 234 | . 2 ⊢ (∃𝑥 ∈ On 𝜑 → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ {𝑥 ∈ On ∣ 𝜑}) |
6 | nfrab1 3310 | . . . . 5 ⊢ Ⅎ𝑥{𝑥 ∈ On ∣ 𝜑} | |
7 | 6 | nfint 4886 | . . . 4 ⊢ Ⅎ𝑥∩ {𝑥 ∈ On ∣ 𝜑} |
8 | nfcv 2906 | . . . 4 ⊢ Ⅎ𝑥On | |
9 | onminsb.1 | . . . 4 ⊢ Ⅎ𝑥𝜓 | |
10 | onminsb.2 | . . . 4 ⊢ (𝑥 = ∩ {𝑥 ∈ On ∣ 𝜑} → (𝜑 ↔ 𝜓)) | |
11 | 7, 8, 9, 10 | elrabf 3613 | . . 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 205 = wceq 1539 Ⅎwnf 1787 ∈ wcel 2108 ≠ wne 2942 ∃wrex 3064 {crab 3067 ⊆ wss 3883 ∅c0 4253 ∩ cint 4876 Oncon0 6251 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-br 5071 df-opab 5133 df-tr 5188 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-ord 6254 df-on 6255 |
This theorem is referenced by: oawordeulem 8347 rankidb 9489 cardmin2 9688 cardaleph 9776 cardmin 10251 |
Copyright terms: Public domain | W3C validator |