| 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 6222 elovmporab1w 6223 mpoxopoveq 6406 diffitest 7076 supex2g 7232 cc4f 7488 omctfn 13069 ismhm 13549 mhmex 13550 issubm 13560 issubg 13765 subgex 13768 isnsg 13794 isrim0 14181 issubrng 14219 issubrg 14241 rrgval 14282 lssex 14374 lsssetm 14376 psrval 14686 psrplusgg 14698 psraddcl 14700 epttop 14820 cldval 14829 neif 14871 neival 14873 cnfval 14924 cnovex 14926 cnpval 14928 hmeofn 15032 hmeofvalg 15033 ispsmet 15053 ismet 15074 isxmet 15075 blvalps 15118 blval 15119 cncfval 15302 clwwlkg 16250 clwwlknon 16286 |
| Copyright terms: Public domain | W3C validator |