| 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 6035 | . 2 ⊢ (𝐴 ⊆ 𝐵 → ((𝑥 ∈ 𝐵 ↦ 𝐶) ↾ 𝐴) = (𝑥 ∈ 𝐴 ↦ 𝐶)) | |
| 2 | resss 5999 | . 2 ⊢ ((𝑥 ∈ 𝐵 ↦ 𝐶) ↾ 𝐴) ⊆ (𝑥 ∈ 𝐵 ↦ 𝐶) | |
| 3 | 1, 2 | eqsstrrdi 4009 | 1 ⊢ (𝐴 ⊆ 𝐵 → (𝑥 ∈ 𝐴 ↦ 𝐶) ⊆ (𝑥 ∈ 𝐵 ↦ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ⊆ wss 3931 ↦ cmpt 5205 ↾ cres 5667 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-12 2176 ax-ext 2706 ax-sep 5276 ax-nul 5286 ax-pr 5412 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-clab 2713 df-cleq 2726 df-clel 2808 df-rab 3420 df-v 3465 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-sn 4607 df-pr 4609 df-op 4613 df-opab 5186 df-mpt 5206 df-xp 5671 df-rel 5672 df-res 5677 |
| This theorem is referenced by: tdeglem4 26035 carsgclctunlem2 34280 mhphf 42570 sge0less 46364 |
| Copyright terms: Public domain | W3C validator |