Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > res0 | Structured version Visualization version GIF version |
Description: A restriction to the empty set is empty. (Contributed by NM, 12-Nov-1994.) |
Ref | Expression |
---|---|
res0 | ⊢ (𝐴 ↾ ∅) = ∅ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-res 5050 | . 2 ⊢ (𝐴 ↾ ∅) = (𝐴 ∩ (∅ × V)) | |
2 | 0xp 5122 | . . 3 ⊢ (∅ × V) = ∅ | |
3 | 2 | ineq2i 3773 | . 2 ⊢ (𝐴 ∩ (∅ × V)) = (𝐴 ∩ ∅) |
4 | in0 3920 | . 2 ⊢ (𝐴 ∩ ∅) = ∅ | |
5 | 1, 3, 4 | 3eqtri 2636 | 1 ⊢ (𝐴 ↾ ∅) = ∅ |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1475 Vcvv 3173 ∩ cin 3539 ∅c0 3874 × cxp 5036 ↾ cres 5040 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-v 3175 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-opab 4644 df-xp 5044 df-res 5050 |
This theorem is referenced by: ima0 5400 resdisj 5482 smo0 7342 tfrlem16 7376 tz7.44-1 7389 mapunen 8014 fnfi 8123 ackbij2lem3 8946 hashf1lem1 13096 setsid 15742 meet0 16960 join0 16961 frmdplusg 17214 psgn0fv0 17754 gsum2dlem2 18193 ablfac1eulem 18294 ablfac1eu 18295 psrplusg 19202 ply1plusgfvi 19433 ptuncnv 21420 ptcmpfi 21426 ust0 21833 xrge0gsumle 22444 xrge0tsms 22445 jensen 24515 0pth 26100 1pthonlem1 26119 eupath2 26507 resf1o 28893 gsumle 29110 xrge0tsmsd 29116 esumsnf 29453 dfpo2 30898 eldm3 30905 rdgprc0 30943 zrdivrng 32922 eldioph4b 36393 diophren 36395 ismeannd 39360 psmeasure 39364 isomennd 39421 hoidmvlelem3 39487 egrsubgr 40501 0grsubgr 40502 pthdlem1 40972 0pth-av 41293 1pthdlem1 41302 eupth2lemb 41405 aacllem 42356 |
Copyright terms: Public domain | W3C validator |