![]() |
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 5292 | . . 3 ⊢ ({𝑥 ∈ On ∣ 𝜑} ≠ ∅ ↔ ∩ {𝑥 ∈ On ∣ 𝜑} ∈ V) | |
2 | ssrab2 4035 | . . . 4 ⊢ {𝑥 ∈ On ∣ 𝜑} ⊆ On | |
3 | oninton 7726 | . . . 4 ⊢ (({𝑥 ∈ On ∣ 𝜑} ⊆ On ∧ {𝑥 ∈ On ∣ 𝜑} ≠ ∅) → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ On) | |
4 | 2, 3 | mpan 688 | . . 3 ⊢ ({𝑥 ∈ On ∣ 𝜑} ≠ ∅ → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ On) |
5 | 1, 4 | sylbir 234 | . 2 ⊢ (∩ {𝑥 ∈ On ∣ 𝜑} ∈ V → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ On) |
6 | elex 3461 | . 2 ⊢ (∩ {𝑥 ∈ On ∣ 𝜑} ∈ On → ∩ {𝑥 ∈ On ∣ 𝜑} ∈ V) | |
7 | 5, 6 | impbii 208 | 1 ⊢ (∩ {𝑥 ∈ On ∣ 𝜑} ∈ V ↔ ∩ {𝑥 ∈ On ∣ 𝜑} ∈ On) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∈ wcel 2106 ≠ wne 2941 {crab 3405 Vcvv 3443 ⊆ wss 3908 ∅c0 4280 ∩ cint 4905 Oncon0 6315 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2707 ax-sep 5254 ax-nul 5261 ax-pr 5382 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2714 df-cleq 2728 df-clel 2814 df-ne 2942 df-ral 3063 df-rex 3072 df-rab 3406 df-v 3445 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3927 df-nul 4281 df-if 4485 df-pw 4560 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4864 df-int 4906 df-br 5104 df-opab 5166 df-tr 5221 df-eprel 5535 df-po 5543 df-so 5544 df-fr 5586 df-we 5588 df-ord 6318 df-on 6319 |
This theorem is referenced by: onintrab2 7728 sltval2 26988 sltres 26994 |
Copyright terms: Public domain | W3C validator |