| 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 3309 | . 2 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 | |
| 2 | ssexg 4223 | . 2 ⊢ (({𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 ∧ 𝐴 ∈ 𝑉) → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V) | |
| 3 | 1, 2 | mpan 424 | 1 ⊢ (𝐴 ∈ 𝑉 → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∈ wcel 2200 {crab 2512 Vcvv 2799 ⊆ wss 3197 |
| 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 4202 |
| 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 2801 df-in 3203 df-ss 3210 |
| This theorem is referenced by: rabex 4228 rabexd 4229 exmidsssnc 4287 exse 4427 frind 4443 elfvmptrab1 5731 elovmporab 6211 elovmporab1w 6212 mpoxopoveq 6392 diffitest 7057 supex2g 7211 cc4f 7466 omctfn 13029 ismhm 13509 mhmex 13510 issubm 13520 issubg 13725 subgex 13728 isnsg 13754 isrim0 14140 issubrng 14178 issubrg 14200 rrgval 14241 lssex 14333 lsssetm 14335 psrval 14645 psrplusgg 14657 psraddcl 14659 epttop 14779 cldval 14788 neif 14830 neival 14832 cnfval 14883 cnovex 14885 cnpval 14887 hmeofn 14991 hmeofvalg 14992 ispsmet 15012 ismet 15033 isxmet 15034 blvalps 15077 blval 15078 cncfval 15261 clwwlkg 16131 |
| Copyright terms: Public domain | W3C validator |