| 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 6037 | . 2 ⊢ (𝐴 ⊆ 𝐵 → ((𝑥 ∈ 𝐵 ↦ 𝐶) ↾ 𝐴) = (𝑥 ∈ 𝐴 ↦ 𝐶)) | |
| 2 | resss 5998 | . 2 ⊢ ((𝑥 ∈ 𝐵 ↦ 𝐶) ↾ 𝐴) ⊆ (𝑥 ∈ 𝐵 ↦ 𝐶) | |
| 3 | 1, 2 | eqsstrrdi 3979 | 1 ⊢ (𝐴 ⊆ 𝐵 → (𝑥 ∈ 𝐴 ↦ 𝐶) ⊆ (𝑥 ∈ 𝐵 ↦ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ⊆ wss 3902 ↦ cmpt 5190 ↾ cres 5661 |
| 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 2147 ax-9 2155 ax-10 2178 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-pr 5402 |
| 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 2741 df-cleq 2754 df-clel 2837 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-opab 5172 df-mpt 5191 df-xp 5665 df-rel 5666 df-res 5671 |
| This theorem is used by: tdeglem4 26292 carsgclctunlem2 34838 mhphf 43451 sge0less 47228 |
| Copyright terms: Public domain | W3C validator |