| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > elrnmptdv | 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 2937 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 𝐷 = 𝐵) |
| 4 | elrnmptdv.3 | . . 3 ⊢ (𝜑 → 𝐷 ∈ 𝑉) | |
| 5 | elrnmptdv.1 | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
| 6 | 5 | elrnmpt 5029 | . . 3 ⊢ (𝐷 ∈ 𝑉 → (𝐷 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 𝐷 = 𝐵)) |
| 7 | 4, 6 | syl 14 | . 2 ⊢ (𝜑 → (𝐷 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 𝐷 = 𝐵)) |
| 8 | 3, 7 | mpbird 167 | 1 ⊢ (𝜑 → 𝐷 ∈ ran 𝐹) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 ∃wrex 2529 ↦ cmpt 4190 ran crn 4773 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-pr 4344 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-rex 2534 df-v 2823 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-br 4129 df-opab 4191 df-mpt 4192 df-cnv 4780 df-dm 4782 df-rn 4783 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |