| 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 5670 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 × V) ⊆ (𝐵 × V)) | |
| 2 | sslin 4188 | . . 3 ⊢ ((𝐴 × V) ⊆ (𝐵 × V) → (𝐶 ∩ (𝐴 × V)) ⊆ (𝐶 ∩ (𝐵 × V))) | |
| 3 | 1, 2 | syl 18 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (𝐶 ∩ (𝐴 × V)) ⊆ (𝐶 ∩ (𝐵 × V))) |
| 4 | df-res 5663 | . 2 ⊢ (𝐶 ↾ 𝐴) = (𝐶 ∩ (𝐴 × V)) | |
| 5 | df-res 5663 | . 2 ⊢ (𝐶 ↾ 𝐵) = (𝐶 ∩ (𝐵 × V)) | |
| 6 | 3, 4, 5 | 3sstr4g 3984 | 1 ⊢ (𝐴 ⊆ 𝐵 → (𝐶 ↾ 𝐴) ⊆ (𝐶 ↾ 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 Vcvv 3451 ∩ cin 3898 ⊆ wss 3899 × cxp 5649 ↾ cres 5653 |
| 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 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-rab 3414 df-v 3453 df-in 3906 df-ss 3916 df-opab 5168 df-xp 5657 df-res 5663 |
| This theorem is used by: imass2 6055 imadifssranOLD 6202 1stcof 8031 2ndcof 8032 tfrlem15 8400 gsum2dlem2 20185 txkgen 23971 funpsstri 36531 eldisjss 39770 resnonrel 44591 mptrcllem 44612 rtrclexi 44620 cnvrcl0 44624 relexpss1d 44704 relexp0a 44715 supcnvlimsup 46749 |
| Copyright terms: Public domain | W3C validator |