| 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 7908. (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 7908 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 “ 𝐵) ∈ V) | |
| 3 | 1, 2 | syl 18 | 1 ⊢ (𝜑 → (𝐴 “ 𝐵) ∈ V) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2142 Vcvv 3454 “ cima 5663 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5256 ax-pr 5403 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-br 5109 df-opab 5173 df-xp 5666 df-cnv 5668 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 |
| This theorem is used by: mptcnfimad 7981 ghmqusnsglem1 19356 ghmqusnsg 19358 ghmquskerlem1 19359 ghmquskerco 19360 ghmquskerlem3 19362 ghmqusker 19363 gsumfs2d 33390 algextdeglem4 34119 aks6d1c2lem4 42922 aks6d1c2 42925 aks6d1c6lem2 42966 aks6d1c6lem3 42967 aks6d1c7lem1 42975 aks6d1c7lem2 42976 sge0f1o 47124 isuspgrim0lem 48686 isubgr3stgrlem5 48763 imasubclem1 49910 |
| Copyright terms: Public domain | W3C validator |