| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mptss | Structured version Visualization version GIF version | ||
| Description: Sufficient condition for inclusion among two functions in maps-to notation. (Contributed by Glauco Siliprandi, 17-Aug-2020.) |
| Ref | Expression |
|---|---|
| mptss | ⊢ (𝐴 ⊆ 𝐵 → (𝑥 ∈ 𝐴 ↦ 𝐶) ⊆ (𝑥 ∈ 𝐵 ↦ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | resmpt 6023 | . 2 ⊢ (𝐴 ⊆ 𝐵 → ((𝑥 ∈ 𝐵 ↦ 𝐶) ↾ 𝐴) = (𝑥 ∈ 𝐴 ↦ 𝐶)) | |
| 2 | resss 5985 | . 2 ⊢ ((𝑥 ∈ 𝐵 ↦ 𝐶) ↾ 𝐴) ⊆ (𝑥 ∈ 𝐵 ↦ 𝐶) | |
| 3 | 1, 2 | eqsstrrdi 3981 | 1 ⊢ (𝐴 ⊆ 𝐵 → (𝑥 ∈ 𝐴 ↦ 𝐶) ⊆ (𝑥 ∈ 𝐵 ↦ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ⊆ wss 3904 ↦ cmpt 5180 ↾ cres 5647 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-12 2211 ax-ext 2733 ax-sep 5245 ax-pr 5389 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-rab 3414 df-v 3455 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4480 df-sn 4582 df-pr 4584 df-op 4588 df-opab 5162 df-mpt 5181 df-xp 5651 df-rel 5652 df-res 5657 |
| This theorem is referenced by: tdeglem4 26100 carsgclctunlem2 34577 mhphf 43143 sge0less 46930 |
| Copyright terms: Public domain | W3C validator |