| 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 5973 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐶 ↾ (𝐴 ∩ 𝐵)) = (𝐶 ↾ ∅)) | |
| 2 | resres 5991 | . 2 ⊢ ((𝐶 ↾ 𝐴) ↾ 𝐵) = (𝐶 ↾ (𝐴 ∩ 𝐵)) | |
| 3 | res0 5982 | . . 3 ⊢ (𝐶 ↾ ∅) = ∅ | |
| 4 | 3 | eqcomi 2772 | . 2 ⊢ ∅ = (𝐶 ↾ ∅) |
| 5 | 1, 2, 4 | 3eqtr4g 2823 | 1 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐶 ↾ 𝐴) ↾ 𝐵) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1570 ∩ cin 3904 ∅c0 4286 ↾ cres 5663 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5257 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-opab 5174 df-xp 5667 df-rel 5668 df-res 5673 |
| This theorem is referenced by: fvsnun1 7180 |
| Copyright terms: Public domain | W3C validator |