| 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 7913. (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 7900 | . 2 ⊢ (𝐴 ∈ 𝑉 → ran 𝐴 ∈ V) | |
| 3 | 1, 2 | syl 18 | 1 ⊢ (𝜑 → ran 𝐴 ∈ V) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2145 Vcvv 3450 ran crn 5656 |
| 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 2732 ax-sep 5251 ax-pr 5398 ax-un 7737 |
| 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 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-cnv 5663 df-dm 5665 df-rn 5666 |
| This theorem is used by: qusrn 33839 |
| Copyright terms: Public domain | W3C validator |