| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > resdisj | Structured version Visualization version GIF version | ||
| Description: A double restriction to disjoint classes is the empty set. (Contributed by NM, 7-Oct-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) |
| Ref | Expression |
|---|---|
| resdisj | ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐶 ↾ 𝐴) ↾ 𝐵) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | reseq2 5933 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐶 ↾ (𝐴 ∩ 𝐵)) = (𝐶 ↾ ∅)) | |
| 2 | resres 5951 | . 2 ⊢ ((𝐶 ↾ 𝐴) ↾ 𝐵) = (𝐶 ↾ (𝐴 ∩ 𝐵)) | |
| 3 | res0 5942 | . . 3 ⊢ (𝐶 ↾ ∅) = ∅ | |
| 4 | 3 | eqcomi 2750 | . 2 ⊢ ∅ = (𝐶 ↾ ∅) |
| 5 | 1, 2, 4 | 3eqtr4g 2801 | 1 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐶 ↾ 𝐴) ↾ 𝐵) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1548 ∩ cin 3884 ∅c0 4264 ↾ cres 5623 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-ext 2713 ax-sep 5221 ax-pr 5365 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-sb 2075 df-clab 2720 df-cleq 2733 df-clel 2816 df-ral 3056 df-rex 3066 df-rab 3394 df-v 3435 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-nul 4265 df-if 4458 df-sn 4559 df-pr 4561 df-op 4565 df-opab 5138 df-xp 5627 df-rel 5628 df-res 5633 |
| This theorem is referenced by: fvsnun1 7130 |
| Copyright terms: Public domain | W3C validator |