| 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 3310 | . 2 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 | |
| 2 | ssexg 4226 | . 2 ⊢ (({𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 ∧ 𝐴 ∈ 𝑉) → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V) | |
| 3 | 1, 2 | mpan 424 | 1 ⊢ (𝐴 ∈ 𝑉 → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∈ wcel 2200 {crab 2512 Vcvv 2800 ⊆ wss 3198 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 ax-sep 4205 |
| This theorem depends on definitions: df-bi 117 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-rab 2517 df-v 2802 df-in 3204 df-ss 3211 |
| This theorem is referenced by: rabex 4232 rabexd 4233 exmidsssnc 4291 exse 4431 frind 4447 elfvmptrab1 5737 elovmporab 6217 elovmporab1w 6218 mpoxopoveq 6401 diffitest 7069 supex2g 7223 cc4f 7478 omctfn 13054 ismhm 13534 mhmex 13535 issubm 13545 issubg 13750 subgex 13753 isnsg 13779 isrim0 14165 issubrng 14203 issubrg 14225 rrgval 14266 lssex 14358 lsssetm 14360 psrval 14670 psrplusgg 14682 psraddcl 14684 epttop 14804 cldval 14813 neif 14855 neival 14857 cnfval 14908 cnovex 14910 cnpval 14912 hmeofn 15016 hmeofvalg 15017 ispsmet 15037 ismet 15058 isxmet 15059 blvalps 15102 blval 15103 cncfval 15286 clwwlkg 16188 clwwlknon 16224 |
| Copyright terms: Public domain | W3C validator |