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 7777. See also abrexex2 7785. (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 7777 | . 2 ⊢ (𝐴 ∈ V → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ V) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ V |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1539 ∈ wcel 2108 {cab 2715 ∃wrex 3064 Vcvv 3422 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 |
This theorem is referenced by: ab2rexex 7795 kmlem10 9846 shftfval 14709 dvdsrval 19802 cmpsublem 22458 cmpsub 22459 ptrescn 22698 satfvsuclem1 33221 fmlasuc0 33246 heibor1lem 35894 pointsetN 37682 eldiophb 40495 |
Copyright terms: Public domain | W3C validator |