| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rabexg | GIF version | ||
| Description: Separation Scheme in terms of a restricted class abstraction. (Contributed by NM, 23-Oct-1999.) |
| Ref | Expression |
|---|---|
| rabexg | ⊢ (𝐴 ∈ 𝑉 → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssrab2 3312 | . 2 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 | |
| 2 | ssexg 4228 | . 2 ⊢ (({𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 ∧ 𝐴 ∈ 𝑉) → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V) | |
| 3 | 1, 2 | mpan 424 | 1 ⊢ (𝐴 ∈ 𝑉 → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∈ wcel 2202 {crab 2514 Vcvv 2802 ⊆ wss 3200 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 ax-sep 4207 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-rab 2519 df-v 2804 df-in 3206 df-ss 3213 |
| This theorem is referenced by: rabex 4234 rabexd 4235 exmidsssnc 4293 exse 4433 frind 4449 elfvmptrab1 5741 elovmporab 6221 elovmporab1w 6222 mpoxopoveq 6405 diffitest 7075 supex2g 7231 cc4f 7487 omctfn 13063 ismhm 13543 mhmex 13544 issubm 13554 issubg 13759 subgex 13762 isnsg 13788 isrim0 14174 issubrng 14212 issubrg 14234 rrgval 14275 lssex 14367 lsssetm 14369 psrval 14679 psrplusgg 14691 psraddcl 14693 epttop 14813 cldval 14822 neif 14864 neival 14866 cnfval 14917 cnovex 14919 cnpval 14921 hmeofn 15025 hmeofvalg 15026 ispsmet 15046 ismet 15067 isxmet 15068 blvalps 15111 blval 15112 cncfval 15295 clwwlkg 16243 clwwlknon 16279 |
| Copyright terms: Public domain | W3C validator |