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 5874 | . 2 ⊢ ((𝐴 ∩ 𝐵) = ∅ → (𝐶 ↾ (𝐴 ∩ 𝐵)) = (𝐶 ↾ ∅)) | |
2 | resres 5892 | . 2 ⊢ ((𝐶 ↾ 𝐴) ↾ 𝐵) = (𝐶 ↾ (𝐴 ∩ 𝐵)) | |
3 | res0 5883 | . . 3 ⊢ (𝐶 ↾ ∅) = ∅ | |
4 | 3 | eqcomi 2748 | . 2 ⊢ ∅ = (𝐶 ↾ ∅) |
5 | 1, 2, 4 | 3eqtr4g 2805 | 1 ⊢ ((𝐴 ∩ 𝐵) = ∅ → ((𝐶 ↾ 𝐴) ↾ 𝐵) = ∅) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1543 ∩ cin 3883 ∅c0 4254 ↾ cres 5581 |
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 1976 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-12 2177 ax-ext 2710 ax-sep 5216 ax-nul 5223 ax-pr 5346 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-clab 2717 df-cleq 2731 df-clel 2818 df-rab 3073 df-v 3425 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-nul 4255 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-opab 5133 df-xp 5585 df-rel 5586 df-res 5591 |
This theorem is referenced by: fvsnun1 7033 |
Copyright terms: Public domain | W3C validator |