Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > abrexex | Structured version Visualization version GIF version |
Description: Existence of a class abstraction of existentially restricted sets. See the comment of abrexexg 7656. See also abrexex2 7664. (Contributed by NM, 16-Oct-2003.) (Proof shortened by Mario Carneiro, 31-Aug-2015.) |
Ref | Expression |
---|---|
abrexex.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
abrexex | ⊢ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ V |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | abrexex.1 | . 2 ⊢ 𝐴 ∈ V | |
2 | abrexexg 7656 | . 2 ⊢ (𝐴 ∈ V → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ V) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ V |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1533 ∈ wcel 2110 {cab 2799 ∃wrex 3139 Vcvv 3494 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pr 5321 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-id 5454 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 |
This theorem is referenced by: ab2rexex 7674 kmlem10 9579 shftfval 14423 dvdsrval 19389 cmpsublem 22001 cmpsub 22002 ptrescn 22241 satfvsuclem1 32601 fmlasuc0 32626 heibor1lem 35081 pointsetN 36871 eldiophb 39347 |
Copyright terms: Public domain | W3C validator |