| 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 6031 | . 2 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐵) “ 𝐶) = ran (𝑥 ∈ (𝐴 ∩ 𝐶) ↦ 𝐵) | |
| 2 | mptimass.1 | . . . . 5 ⊢ (𝜑 → 𝐶 ⊆ 𝐴) | |
| 3 | sseqin2 4175 | . . . . 5 ⊢ (𝐶 ⊆ 𝐴 ↔ (𝐴 ∩ 𝐶) = 𝐶) | |
| 4 | 2, 3 | sylib 218 | . . . 4 ⊢ (𝜑 → (𝐴 ∩ 𝐶) = 𝐶) |
| 5 | 4 | mpteq1d 5188 | . . 3 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ∩ 𝐶) ↦ 𝐵) = (𝑥 ∈ 𝐶 ↦ 𝐵)) |
| 6 | 5 | rneqd 5887 | . 2 ⊢ (𝜑 → ran (𝑥 ∈ (𝐴 ∩ 𝐶) ↦ 𝐵) = ran (𝑥 ∈ 𝐶 ↦ 𝐵)) |
| 7 | 1, 6 | eqtrid 2783 | 1 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ↦ 𝐵) “ 𝐶) = ran (𝑥 ∈ 𝐶 ↦ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∩ cin 3900 ⊆ wss 3901 ↦ cmpt 5179 ran crn 5625 “ cima 5627 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-br 5099 df-opab 5161 df-mpt 5180 df-xp 5630 df-rel 5631 df-cnv 5632 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 |
| This theorem is referenced by: pzriprnglem10 21445 limsupresico 45940 limsupvaluz 45948 liminfresico 46011 |
| Copyright terms: Public domain | W3C validator |