| 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 3313 | . 2 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 | |
| 2 | ssexg 4233 | . 2 ⊢ (({𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 ∧ 𝐴 ∈ 𝑉) → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V) | |
| 3 | 1, 2 | mpan 424 | 1 ⊢ (𝐴 ∈ 𝑉 → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∈ wcel 2202 {crab 2515 Vcvv 2803 ⊆ wss 3201 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 ax-sep 4212 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-rab 2520 df-v 2805 df-in 3207 df-ss 3214 |
| This theorem is referenced by: rabex 4239 rabexd 4240 exmidsssnc 4299 exse 4439 frind 4455 elfvmptrab1 5750 elovmporab 6232 elovmporab1w 6233 suppval 6415 mpoxopoveq 6449 diffitest 7119 supex2g 7275 cc4f 7531 omctfn 13127 ismhm 13607 mhmex 13608 issubm 13618 issubg 13823 subgex 13826 isnsg 13852 isrim0 14239 issubrng 14277 issubrg 14299 rrgval 14340 lssex 14433 lsssetm 14435 psrval 14745 psrplusgg 14762 psraddcl 14764 epttop 14884 cldval 14893 neif 14935 neival 14937 cnfval 14988 cnovex 14990 cnpval 14992 hmeofn 15096 hmeofvalg 15097 ispsmet 15117 ismet 15138 isxmet 15139 blvalps 15182 blval 15183 cncfval 15366 clwwlkg 16317 clwwlknon 16353 |
| Copyright terms: Public domain | W3C validator |