| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mptimass | Structured version Visualization version GIF version | ||
| Description: Image of a function in maps-to notation for a subset. (Contributed by Glauco Siliprandi, 23-Oct-2021.) |
| Ref | Expression |
|---|---|
| mptimass.1 | ⊢ (𝜑 → 𝐶 ⊆ 𝐴) |
| Ref | Expression |
|---|---|
| mptimass | ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) “ 𝐶) = ran (𝑥 ∈ 𝐶 ↦ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mptima 6076 | . 2 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) “ 𝐶) = ran (𝑥 ∈ (𝐴 ∩ 𝐶) ↦ 𝐵) | |
| 2 | mptimass.1 | . . . . 5 ⊢ (𝜑 → 𝐶 ⊆ 𝐴) | |
| 3 | sseqin2 4177 | . . . . 5 ⊢ (𝐶 ⊆ 𝐴 ↔ (𝐴 ∩ 𝐶) = 𝐶) | |
| 4 | 2, 3 | sylib 221 | . . . 4 ⊢ (𝜑 → (𝐴 ∩ 𝐶) = 𝐶) |
| 5 | 4 | mpteq1d 5202 | . . 3 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∩ 𝐶) ↦ 𝐵) = (𝑥 ∈ 𝐶 ↦ 𝐵)) |
| 6 | 5 | rneqd 5930 | . 2 ⊢ (𝜑 → ran (𝑥 ∈ (𝐴 ∩ 𝐶) ↦ 𝐵) = ran (𝑥 ∈ 𝐶 ↦ 𝐵)) |
| 7 | 1, 6 | eqtrid 2810 | 1 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) “ 𝐶) = ran (𝑥 ∈ 𝐶 ↦ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1570 ∩ cin 3905 ⊆ wss 3906 ↦ cmpt 5193 ran crn 5664 “ cima 5666 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-pr 5406 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-sn 4591 df-pr 4593 df-op 4597 df-br 5111 df-opab 5175 df-mpt 5194 df-xp 5669 df-rel 5670 df-cnv 5671 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 |
| This theorem is referenced by: pzriprnglem10 21621 limsupresico 46397 limsupvaluz 46405 liminfresico 46468 |
| Copyright terms: Public domain | W3C validator |