| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ssres2 | Structured version Visualization version GIF version | ||
| Description: Subclass theorem for restriction. (Contributed by NM, 22-Mar-1998.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) |
| Ref | Expression |
|---|---|
| ssres2 | ⊢ (𝐴 ⊆ 𝐵 → (𝐶 ↾ 𝐴) ⊆ (𝐶 ↾ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xpss1 5673 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 × V) ⊆ (𝐵 × V)) | |
| 2 | sslin 4141 | . . 3 ⊢ ((𝐴 × V) ⊆ (𝐵 × V) → (𝐶 ∩ (𝐴 × V)) ⊆ (𝐶 ∩ (𝐵 × V))) | |
| 3 | 1, 2 | syl 18 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (𝐶 ∩ (𝐴 × V)) ⊆ (𝐶 ∩ (𝐵 × V))) |
| 4 | df-res 5666 | . 2 ⊢ (𝐶 ↾ 𝐴) = (𝐶 ∩ (𝐴 × V)) | |
| 5 | df-res 5666 | . 2 ⊢ (𝐶 ↾ 𝐵) = (𝐶 ∩ (𝐵 × V)) | |
| 6 | 3, 4, 5 | 3sstr4g 3965 | 1 ⊢ (𝐴 ⊆ 𝐵 → (𝐶 ↾ 𝐴) ⊆ (𝐶 ↾ 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 Vcvv 3453 ⊆ wss 3899 ∩ cin 4091 × cxp 5652 ↾ cres 5656 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1572 df-ex 1812 df-sb 2101 df-clab 2742 df-cleq 2755 df-clel 2838 df-rab 3416 df-v 3455 df-ss 3900 df-in 4093 df-opab 5170 df-xp 5660 df-res 5666 |
| This theorem is used by: imass2 6060 imadifssranOLD 6208 1stcof 8038 2ndcof 8039 tfrlem15 8411 gsum2dlem2 20197 txkgen 23983 funpsstri 36658 eldisjss 39910 resnonrel 44732 mptrcllem 44753 rtrclexi 44761 cnvrcl0 44765 relexpss1d 44845 relexp0a 44856 supcnvlimsup 46889 |
| Copyright terms: Public domain | W3C validator |