| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > onintrab | Structured version Visualization version GIF version | ||
| Description: The intersection of a class of ordinal numbers exists iff it is an ordinal number. (Contributed by NM, 6-Nov-2003.) |
| Ref | Expression |
|---|---|
| onintrab | ⊢ (∩ {𝑥 ∈ On ∣ 𝜑} ∈ V ↔ ∩ {𝑥 ∈ On ∣ 𝜑} ∈ On) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | intex 5312 | . . 3 ⊢ ({𝑥 ∈ On ∣ 𝜑} ≠ ∅ ↔ ∩ {𝑥 ∈ On ∣ 𝜑} ∈ V) | |
| 2 | ssrab2 4031 | . . . 4 ⊢ {𝑥 ∈ On ∣ 𝜑} ⊆ On | |
| 3 | oninton 7798 | . . . 4 ⊢ (({𝑥 ∈ On ∣ 𝜑} ⊆ On ∧ {𝑥 ∈ On ∣ 𝜑} ≠ ∅) → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ On) | |
| 4 | 2, 3 | mpan 703 | . . 3 ⊢ ({𝑥 ∈ On ∣ 𝜑} ≠ ∅ → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ On) |
| 5 | 1, 4 | sylbir 238 | . 2 ⊢ (∩ {𝑥 ∈ On ∣ 𝜑} ∈ V → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ On) |
| 6 | elex 3474 | . 2 ⊢ (∩ {𝑥 ∈ On ∣ 𝜑} ∈ On → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ V) | |
| 7 | 5, 6 | impbii 212 | 1 ⊢ (∩ {𝑥 ∈ On ∣ 𝜑} ∈ V ↔ ∩ {𝑥 ∈ On ∣ 𝜑} ∈ On) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∈ wcel 2145 ≠ wne 2957 {crab 3414 Vcvv 3453 ⊆ 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-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-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 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: onintrab2 7800 ltsval2 27900 ltsres 27906 |
| Copyright terms: Public domain | W3C validator |