| 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 3333 | . 2 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 | |
| 2 | ssexg 4272 | . 2 ⊢ (({𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 ∧ 𝐴 ∈ 𝑉) → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V) | |
| 3 | 1, 2 | mpan 428 | 1 ⊢ (𝐴 ∈ 𝑉 → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2209 {crab 2532 Vcvv 2821 ⊆ wss 3220 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 ax-sep 4249 |
| This proof depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-rab 2537 df-v 2823 df-in 3226 df-ss 3233 |
| This theorem is used by: rabex 4280 rabexd 4281 exmidsssnc 4340 exse 4481 frind 4497 elfvmptrab1 5801 elovmporab 6289 elovmporab1w 6290 suppval 6477 mpoxopoveq 6511 diffitest 7191 supex2g 7373 cc4f 7635 omctfn 13334 ismhm 13768 mhmex 13769 issubm 13779 issubg 13976 subgex 13979 isnsg 14005 isrim0 14468 issubrng 14507 issubrg 14529 rrgval 14570 lssex 14691 lsssetm 14693 psrval 15050 psrplusgg 15069 psraddcl 15071 epttop 15191 cldval 15200 neif 15242 neival 15244 cnfval 15295 cnovex 15297 cnpval 15299 hmeofn 15403 hmeofvalg 15404 ispsmet 15424 ismet 15445 isxmet 15446 blvalps 15489 blval 15490 cncfval 15673 clwwlkg 16634 clwwlknon 16670 |
| Copyright terms: Public domain | W3C validator |