![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > resindi | GIF version |
Description: Class restriction distributes over intersection. (Contributed by FL, 6-Oct-2008.) |
Ref | Expression |
---|---|
resindi | ⊢ (𝐴 ↾ (𝐵 ∩ 𝐶)) = ((𝐴 ↾ 𝐵) ∩ (𝐴 ↾ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | xpindir 4765 | . . . 4 ⊢ ((𝐵 ∩ 𝐶) × V) = ((𝐵 × V) ∩ (𝐶 × V)) | |
2 | 1 | ineq2i 3335 | . . 3 ⊢ (𝐴 ∩ ((𝐵 ∩ 𝐶) × V)) = (𝐴 ∩ ((𝐵 × V) ∩ (𝐶 × V))) |
3 | inindi 3354 | . . 3 ⊢ (𝐴 ∩ ((𝐵 × V) ∩ (𝐶 × V))) = ((𝐴 ∩ (𝐵 × V)) ∩ (𝐴 ∩ (𝐶 × V))) | |
4 | 2, 3 | eqtri 2198 | . 2 ⊢ (𝐴 ∩ ((𝐵 ∩ 𝐶) × V)) = ((𝐴 ∩ (𝐵 × V)) ∩ (𝐴 ∩ (𝐶 × V))) |
5 | df-res 4640 | . 2 ⊢ (𝐴 ↾ (𝐵 ∩ 𝐶)) = (𝐴 ∩ ((𝐵 ∩ 𝐶) × V)) | |
6 | df-res 4640 | . . 3 ⊢ (𝐴 ↾ 𝐵) = (𝐴 ∩ (𝐵 × V)) | |
7 | df-res 4640 | . . 3 ⊢ (𝐴 ↾ 𝐶) = (𝐴 ∩ (𝐶 × V)) | |
8 | 6, 7 | ineq12i 3336 | . 2 ⊢ ((𝐴 ↾ 𝐵) ∩ (𝐴 ↾ 𝐶)) = ((𝐴 ∩ (𝐵 × V)) ∩ (𝐴 ∩ (𝐶 × V))) |
9 | 4, 5, 8 | 3eqtr4i 2208 | 1 ⊢ (𝐴 ↾ (𝐵 ∩ 𝐶)) = ((𝐴 ↾ 𝐵) ∩ (𝐴 ↾ 𝐶)) |
Colors of variables: wff set class |
Syntax hints: = wceq 1353 Vcvv 2739 ∩ cin 3130 × cxp 4626 ↾ cres 4630 |
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 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-14 2151 ax-ext 2159 ax-sep 4123 ax-pow 4176 ax-pr 4211 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rex 2461 df-v 2741 df-un 3135 df-in 3137 df-ss 3144 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-opab 4067 df-xp 4634 df-rel 4635 df-res 4640 |
This theorem is referenced by: resindm 4951 |
Copyright terms: Public domain | W3C validator |