| 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 6044 | . 2 ⊢ (𝐴 ⊆ 𝐵 → ((𝑥 ∈ 𝐵 ↦ 𝐶) ↾ 𝐴) = (𝑥 ∈ 𝐴 ↦ 𝐶)) | |
| 2 | resss 6005 | . 2 ⊢ ((𝑥 ∈ 𝐵 ↦ 𝐶) ↾ 𝐴) ⊆ (𝑥 ∈ 𝐵 ↦ 𝐶) | |
| 3 | 1, 2 | eqsstrrdi 3985 | 1 ⊢ (𝐴 ⊆ 𝐵 → (𝑥 ∈ 𝐴 ↦ 𝐶) ⊆ (𝑥 ∈ 𝐵 ↦ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ⊆ wss 3908 ↦ cmpt 5197 ↾ cres 5668 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-pr 5409 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-opab 5179 df-mpt 5198 df-xp 5672 df-rel 5673 df-res 5678 |
| This theorem is used by: tdeglem4 26254 carsgclctunlem2 34741 mhphf 43370 sge0less 47147 |
| Copyright terms: Public domain | W3C validator |