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 2040 | . . 3 ⊢ 𝐶 = 𝐶 | |
2 | elrnmpt1s.1 | . . . . 5 ⊢ (𝑥 = 𝐷 → 𝐵 = 𝐶) | |
3 | 2 | eqeq2d 2051 | . . . 4 ⊢ (𝑥 = 𝐷 → (𝐶 = 𝐵 ↔ 𝐶 = 𝐶)) |
4 | 3 | rspcev 2656 | . . 3 ⊢ ((𝐷 ∈ 𝐴 ∧ 𝐶 = 𝐶) → ∃𝑥 ∈ 𝐴 𝐶 = 𝐵) |
5 | 1, 4 | mpan2 401 | . 2 ⊢ (𝐷 ∈ 𝐴 → ∃𝑥 ∈ 𝐴 𝐶 = 𝐵) |
6 | rnmpt.1 | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
7 | 6 | elrnmpt 4583 | . . 3 ⊢ (𝐶 ∈ 𝑉 → (𝐶 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 𝐶 = 𝐵)) |
8 | 7 | biimparc 283 | . 2 ⊢ ((∃𝑥 ∈ 𝐴 𝐶 = 𝐵 ∧ 𝐶 ∈ 𝑉) → 𝐶 ∈ ran 𝐹) |
9 | 5, 8 | sylan 267 | 1 ⊢ ((𝐷 ∈ 𝐴 ∧ 𝐶 ∈ 𝑉) → 𝐶 ∈ ran 𝐹) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 97 = wceq 1243 ∈ wcel 1393 ∃wrex 2307 ↦ cmpt 3818 ran crn 4346 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-sep 3875 ax-pow 3927 ax-pr 3944 |
This theorem depends on definitions: df-bi 110 df-3an 887 df-tru 1246 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-rex 2312 df-v 2559 df-un 2922 df-in 2924 df-ss 2931 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-br 3765 df-opab 3819 df-mpt 3820 df-cnv 4353 df-dm 4355 df-rn 4356 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |