| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > elrnmpt1s | GIF version | ||
| Description: Elementhood in an image set. (Contributed by Mario Carneiro, 12-Sep-2015.) |
| Ref | Expression |
|---|---|
| rnmpt.1 | ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) |
| elrnmpt1s.1 | ⊢ (𝑥 = 𝐷 → 𝐵 = 𝐶) |
| Ref | Expression |
|---|---|
| elrnmpt1s | ⊢ ((𝐷 ∈ 𝐴 ∧ 𝐶 ∈ 𝑉) → 𝐶 ∈ ran 𝐹) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2238 | . . 3 ⊢ 𝐶 = 𝐶 | |
| 2 | elrnmpt1s.1 | . . . . 5 ⊢ (𝑥 = 𝐷 → 𝐵 = 𝐶) | |
| 3 | 2 | eqeq2d 2250 | . . . 4 ⊢ (𝑥 = 𝐷 → (𝐶 = 𝐵 ↔ 𝐶 = 𝐶)) |
| 4 | 3 | rspcev 2929 | . . 3 ⊢ ((𝐷 ∈ 𝐴 ∧ 𝐶 = 𝐶) → ∃𝑥 ∈ 𝐴 𝐶 = 𝐵) |
| 5 | 1, 4 | mpan2 429 | . 2 ⊢ (𝐷 ∈ 𝐴 → ∃𝑥 ∈ 𝐴 𝐶 = 𝐵) |
| 6 | rnmpt.1 | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
| 7 | 6 | elrnmpt 5026 | . . 3 ⊢ (𝐶 ∈ 𝑉 → (𝐶 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 𝐶 = 𝐵)) |
| 8 | 7 | biimparc 299 | . 2 ⊢ ((∃𝑥 ∈ 𝐴 𝐶 = 𝐵 ∧ 𝐶 ∈ 𝑉) → 𝐶 ∈ ran 𝐹) |
| 9 | 5, 8 | sylan 283 | 1 ⊢ ((𝐷 ∈ 𝐴 ∧ 𝐶 ∈ 𝑉) → 𝐶 ∈ ran 𝐹) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ∃wrex 2529 ↦ cmpt 4187 ran crn 4770 |
| 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 4244 ax-pow 4306 ax-pr 4341 |
| 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 3687 df-sn 3711 df-pr 3712 df-op 3714 df-br 4126 df-opab 4188 df-mpt 4189 df-cnv 4777 df-dm 4779 df-rn 4780 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |