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 3222 | . 2 ⊢ {𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 | |
2 | ssexg 4115 | . 2 ⊢ (({𝑥 ∈ 𝐴 ∣ 𝜑} ⊆ 𝐴 ∧ 𝐴 ∈ 𝑉) → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V) | |
3 | 1, 2 | mpan 421 | 1 ⊢ (𝐴 ∈ 𝑉 → {𝑥 ∈ 𝐴 ∣ 𝜑} ∈ V) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∈ wcel 2135 {crab 2446 Vcvv 2721 ⊆ wss 3111 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-ext 2146 ax-sep 4094 |
This theorem depends on definitions: df-bi 116 df-tru 1345 df-nf 1448 df-sb 1750 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-rab 2451 df-v 2723 df-in 3117 df-ss 3124 |
This theorem is referenced by: rabex 4120 exmidsssnc 4176 exse 4308 frind 4324 elfvmptrab1 5574 mpoxopoveq 6199 diffitest 6844 supex2g 6989 cc4f 7201 omctfn 12313 epttop 12631 cldval 12640 neif 12682 neival 12684 cnfval 12735 cnovex 12737 cnpval 12739 hmeofn 12843 hmeofvalg 12844 ispsmet 12864 ismet 12885 isxmet 12886 blvalps 12929 blval 12930 cncfval 13100 |
Copyright terms: Public domain | W3C validator |