| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > inxpssres | Structured version Visualization version GIF version | ||
| Description: Intersection with a Cartesian product is a subclass of restriction. (Contributed by Peter Mazsa, 19-Jul-2019.) |
| Ref | Expression |
|---|---|
| inxpssres | ⊢ (𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ↾ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssid 3960 | . . . 4 ⊢ 𝐴 ⊆ 𝐴 | |
| 2 | ssv 3962 | . . . 4 ⊢ 𝐵 ⊆ V | |
| 3 | xpss12 5664 | . . . 4 ⊢ ((𝐴 ⊆ 𝐴 ∧ 𝐵 ⊆ V) → (𝐴 × 𝐵) ⊆ (𝐴 × V)) | |
| 4 | 1, 2, 3 | mp2an 702 | . . 3 ⊢ (𝐴 × 𝐵) ⊆ (𝐴 × V) |
| 5 | sslin 4196 | . . 3 ⊢ ((𝐴 × 𝐵) ⊆ (𝐴 × V) → (𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ∩ (𝐴 × V))) | |
| 6 | 4, 5 | ax-mp 5 | . 2 ⊢ (𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ∩ (𝐴 × V)) |
| 7 | df-res 5661 | . 2 ⊢ (𝑅 ↾ 𝐴) = (𝑅 ∩ (𝐴 × V)) | |
| 8 | 6, 7 | sseqtrri 3987 | 1 ⊢ (𝑅 ∩ (𝐴 × 𝐵)) ⊆ (𝑅 ↾ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: Vcvv 3456 ∩ cin 3905 ⊆ wss 3906 × cxp 5647 ↾ cres 5651 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-ext 2736 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1565 df-ex 1802 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-rab 3417 df-v 3458 df-in 3913 df-ss 3923 df-opab 5165 df-xp 5655 df-res 5661 |
| This theorem is referenced by: ssrnres 6166 idreseqidinxp 38819 refrelsredund4 39220 refrelredund4 39223 |
| Copyright terms: Public domain | W3C validator |