Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > abrexexgOLD | Structured version Visualization version GIF version |
Description: Obsolete version of abrexexg 7803 as of 11-Dec-2024. EDITORIAL: Comment
kept since the line of equivalences to ax-rep 5209 is different.
Existence of a class abstraction of existentially restricted sets. The class 𝐵 can be thought of as an expression in 𝑥 (which is typically a free variable in the class expression substituted for 𝐵) and the class abstraction appearing in the statement as the class of values 𝐵 as 𝑥 varies through 𝐴. If the "domain" 𝐴 is a set, then the abstraction is also a set. Therefore, this statement is a kind of Replacement. This can be seen by tracing back through the path mptexg 7097, funex 7095, fnex 7093, resfunexg 7091, and funimaexg 6520. See also abrexex2g 7807. There are partial converses under additional conditions, see for instance abnexg 7606. (Contributed by NM, 3-Nov-2003.) (Proof shortened by Mario Carneiro, 31-Aug-2015.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
abrexexgOLD | ⊢ (𝐴 ∈ 𝑉 → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2738 | . . 3 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
2 | 1 | rnmpt 5864 | . 2 ⊢ ran (𝑥 ∈ 𝐴 ↦ 𝐵) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} |
3 | mptexg 7097 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) | |
4 | rnexg 7751 | . . 3 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) | |
5 | 3, 4 | syl 17 | . 2 ⊢ (𝐴 ∈ 𝑉 → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ V) |
6 | 2, 5 | eqeltrrid 2844 | 1 ⊢ (𝐴 ∈ 𝑉 → {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = 𝐵} ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2106 {cab 2715 ∃wrex 3065 Vcvv 3432 ↦ cmpt 5157 ran crn 5590 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |