| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ssres | GIF version | ||
| Description: Subclass theorem for restriction. (Contributed by NM, 16-Aug-1994.) |
| Ref | Expression |
|---|---|
| ssres | ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ↾ 𝐶) ⊆ (𝐵 ↾ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssrin 3456 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∩ (𝐶 × V)) ⊆ (𝐵 ∩ (𝐶 × V))) | |
| 2 | df-res 4781 | . 2 ⊢ (𝐴 ↾ 𝐶) = (𝐴 ∩ (𝐶 × V)) | |
| 3 | df-res 4781 | . 2 ⊢ (𝐵 ↾ 𝐶) = (𝐵 ∩ (𝐶 × V)) | |
| 4 | 1, 2, 3 | 3sstr4g 3291 | 1 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ↾ 𝐶) ⊆ (𝐵 ↾ 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 Vcvv 2821 ∩ cin 3219 ⊆ wss 3220 × cxp 4767 ↾ cres 4771 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This theorem depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-v 2823 df-in 3226 df-ss 3233 df-res 4781 |
| This theorem is referenced by: imass1 5157 |
| Copyright terms: Public domain | W3C validator |