| 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 5674 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 × V) ⊆ (𝐵 × V)) | |
| 2 | sslin 4188 | . . 3 ⊢ ((𝐴 × V) ⊆ (𝐵 × V) → (𝐶 ∩ (𝐴 × V)) ⊆ (𝐶 ∩ (𝐵 × V))) | |
| 3 | 1, 2 | syl 18 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (𝐶 ∩ (𝐴 × V)) ⊆ (𝐶 ∩ (𝐵 × V))) |
| 4 | df-res 5667 | . 2 ⊢ (𝐶 ↾ 𝐴) = (𝐶 ∩ (𝐴 × V)) | |
| 5 | df-res 5667 | . 2 ⊢ (𝐶 ↾ 𝐵) = (𝐶 ∩ (𝐵 × V)) | |
| 6 | 3, 4, 5 | 3sstr4g 3984 | 1 ⊢ (𝐴 ⊆ 𝐵 → (𝐶 ↾ 𝐴) ⊆ (𝐶 ↾ 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 Vcvv 3450 ∩ cin 3898 ⊆ wss 3899 × cxp 5653 ↾ cres 5657 |
| 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-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-in 3906 df-ss 3916 df-opab 5168 df-xp 5661 df-res 5667 |
| This theorem is used by: imass2 6098 imadifssran 6197 1stcof 8017 2ndcof 8018 tfrlem15 8382 gsum2dlem2 20099 txkgen 23879 funpsstri 36346 eldisjss 39587 resnonrel 44433 mptrcllem 44454 rtrclexi 44462 cnvrcl0 44466 relexpss1d 44546 relexp0a 44557 supcnvlimsup 46569 |
| Copyright terms: Public domain | W3C validator |