| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > resres | GIF version | ||
| Description: The restriction of a restriction. (Contributed by NM, 27-Mar-2008.) |
| Ref | Expression |
|---|---|
| resres | ⊢ ((𝐴 ↾ 𝐵) ↾ 𝐶) = (𝐴 ↾ (𝐵 ∩ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-res 4781 | . 2 ⊢ ((𝐴 ↾ 𝐵) ↾ 𝐶) = ((𝐴 ↾ 𝐵) ∩ (𝐶 × V)) | |
| 2 | df-res 4781 | . . 3 ⊢ (𝐴 ↾ 𝐵) = (𝐴 ∩ (𝐵 × V)) | |
| 3 | 2 | ineq1i 3428 | . 2 ⊢ ((𝐴 ↾ 𝐵) ∩ (𝐶 × V)) = ((𝐴 ∩ (𝐵 × V)) ∩ (𝐶 × V)) |
| 4 | xpindir 4911 | . . . 4 ⊢ ((𝐵 ∩ 𝐶) × V) = ((𝐵 × V) ∩ (𝐶 × V)) | |
| 5 | 4 | ineq2i 3429 | . . 3 ⊢ (𝐴 ∩ ((𝐵 ∩ 𝐶) × V)) = (𝐴 ∩ ((𝐵 × V) ∩ (𝐶 × V))) |
| 6 | df-res 4781 | . . 3 ⊢ (𝐴 ↾ (𝐵 ∩ 𝐶)) = (𝐴 ∩ ((𝐵 ∩ 𝐶) × V)) | |
| 7 | inass 3441 | . . 3 ⊢ ((𝐴 ∩ (𝐵 × V)) ∩ (𝐶 × V)) = (𝐴 ∩ ((𝐵 × V) ∩ (𝐶 × V))) | |
| 8 | 5, 6, 7 | 3eqtr4ri 2270 | . 2 ⊢ ((𝐴 ∩ (𝐵 × V)) ∩ (𝐶 × V)) = (𝐴 ↾ (𝐵 ∩ 𝐶)) |
| 9 | 1, 3, 8 | 3eqtri 2263 | 1 ⊢ ((𝐴 ↾ 𝐵) ↾ 𝐶) = (𝐴 ↾ (𝐵 ∩ 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1402 Vcvv 2821 ∩ cin 3219 × 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-14 2212 ax-ext 2220 ax-sep 4244 ax-pow 4306 ax-pr 4341 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-opab 4188 df-xp 4775 df-rel 4776 df-res 4781 |
| This theorem is referenced by: rescom 5083 resabs1 5087 resima2 5092 resmpt3 5107 resdisj 5211 rescnvcnv 5245 funimaexg 5460 fresin 5563 resdif 5656 pmresg 6947 setsslid 13381 |
| Copyright terms: Public domain | W3C validator |