| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rnexd | Structured version Visualization version GIF version | ||
| Description: The range of a set is a set. Deduction version of rnexd 7848. (Contributed by Thierry Arnoux, 14-Feb-2025.) |
| Ref | Expression |
|---|---|
| rnexd.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| Ref | Expression |
|---|---|
| rnexd | ⊢ (𝜑 → ran 𝐴 ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rnexd.1 | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 2 | rnexg 7835 | . 2 ⊢ (𝐴 ∈ 𝑉 → ran 𝐴 ∈ V) | |
| 3 | 1, 2 | syl 17 | 1 ⊢ (𝜑 → ran 𝐴 ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∈ wcel 2109 Vcvv 3436 ran crn 5620 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 ax-sep 5235 ax-nul 5245 ax-pr 5371 ax-un 7671 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-rab 3395 df-v 3438 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4285 df-if 4477 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-br 5093 df-opab 5155 df-cnv 5627 df-dm 5629 df-rn 5630 |
| This theorem is referenced by: qusrn 33346 |
| Copyright terms: Public domain | W3C validator |