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 2165 | . . 3 ⊢ 𝐶 = 𝐶 | |
2 | elrnmpt1s.1 | . . . . 5 ⊢ (𝑥 = 𝐷 → 𝐵 = 𝐶) | |
3 | 2 | eqeq2d 2177 | . . . 4 ⊢ (𝑥 = 𝐷 → (𝐶 = 𝐵 ↔ 𝐶 = 𝐶)) |
4 | 3 | rspcev 2830 | . . 3 ⊢ ((𝐷 ∈ 𝐴 ∧ 𝐶 = 𝐶) → ∃𝑥 ∈ 𝐴 𝐶 = 𝐵) |
5 | 1, 4 | mpan2 422 | . 2 ⊢ (𝐷 ∈ 𝐴 → ∃𝑥 ∈ 𝐴 𝐶 = 𝐵) |
6 | rnmpt.1 | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
7 | 6 | elrnmpt 4853 | . . 3 ⊢ (𝐶 ∈ 𝑉 → (𝐶 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 𝐶 = 𝐵)) |
8 | 7 | biimparc 297 | . 2 ⊢ ((∃𝑥 ∈ 𝐴 𝐶 = 𝐵 ∧ 𝐶 ∈ 𝑉) → 𝐶 ∈ ran 𝐹) |
9 | 5, 8 | sylan 281 | 1 ⊢ ((𝐷 ∈ 𝐴 ∧ 𝐶 ∈ 𝑉) → 𝐶 ∈ ran 𝐹) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1343 ∈ wcel 2136 ∃wrex 2445 ↦ cmpt 4043 ran crn 4605 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-rex 2450 df-v 2728 df-un 3120 df-in 3122 df-ss 3129 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-br 3983 df-opab 4044 df-mpt 4045 df-cnv 4612 df-dm 4614 df-rn 4615 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |