| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > imaexd | Structured version Visualization version GIF version | ||
| Description: The image of a set is a set. Deduction version of imaexg 7914. (Contributed by Thierry Arnoux, 14-Feb-2025.) |
| Ref | Expression |
|---|---|
| rnexd.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| Ref | Expression |
|---|---|
| imaexd | ⊢ (𝜑 → (𝐴 “ 𝐵) ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rnexd.1 | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 2 | imaexg 7914 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 “ 𝐵) ∈ V) | |
| 3 | 1, 2 | syl 18 | 1 ⊢ (𝜑 → (𝐴 “ 𝐵) ∈ V) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2145 Vcvv 3453 “ cima 5662 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2734 ax-sep 5255 ax-pr 5402 ax-un 7740 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-xp 5665 df-cnv 5667 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 |
| This theorem is used by: mptcnfimad 7987 ghmqusnsglem1 19413 ghmqusnsg 19415 ghmquskerlem1 19416 ghmquskerco 19417 ghmquskerlem3 19419 ghmqusker 19420 gsumfs2d 33509 algextdeglem4 34238 aks6d1c2lem4 43001 aks6d1c2 43004 aks6d1c6lem2 43045 aks6d1c6lem3 43046 aks6d1c7lem1 43054 aks6d1c7lem2 43055 sge0f1o 47218 isuspgrim0lem 48817 isubgr3stgrlem5 48894 imasubclem1 50038 |
| Copyright terms: Public domain | W3C validator |