| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elrnmptdv | Structured version Visualization version GIF version | ||
| Description: Elementhood in the range of a function in maps-to notation, deduction form. (Contributed by Rohan Ridenour, 3-Aug-2023.) |
| Ref | Expression |
|---|---|
| elrnmptdv.1 | ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) |
| elrnmptdv.2 | ⊢ (𝜑 → 𝐶 ∈ 𝐴) |
| elrnmptdv.3 | ⊢ (𝜑 → 𝐷 ∈ 𝑉) |
| elrnmptdv.4 | ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐷 = 𝐵) |
| Ref | Expression |
|---|---|
| elrnmptdv | ⊢ (𝜑 → 𝐷 ∈ ran 𝐹) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elrnmptdv.4 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐶) → 𝐷 = 𝐵) | |
| 2 | elrnmptdv.2 | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝐴) | |
| 3 | 1, 2 | rspcime 3572 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 𝐷 = 𝐵) |
| 4 | elrnmptdv.3 | . . 3 ⊢ (𝜑 → 𝐷 ∈ 𝑉) | |
| 5 | elrnmptdv.1 | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
| 6 | 5 | elrnmpt 5907 | . . 3 ⊢ (𝐷 ∈ 𝑉 → (𝐷 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 𝐷 = 𝐵)) |
| 7 | 4, 6 | syl 17 | . 2 ⊢ (𝜑 → (𝐷 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 𝐷 = 𝐵)) |
| 8 | 3, 7 | mpbird 258 | 1 ⊢ (𝜑 → 𝐷 ∈ ran 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∃wrex 3064 ↦ cmpt 5160 ran crn 5626 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-pr 5369 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ral 3055 df-rex 3065 df-rab 3393 df-v 3434 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-sn 4563 df-pr 4565 df-op 4569 df-br 5080 df-opab 5142 df-mpt 5161 df-cnv 5633 df-dm 5635 df-rn 5636 |
| This theorem is referenced by: cycsubggend 19178 nsgqusf1olem3 33505 zart0 34070 rr-elrnmpt3d 44653 |
| Copyright terms: Public domain | W3C validator |