| 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 5678 | . 2 ⊢ (𝐴 ↾ ∅) = (𝐴 ∩ (∅ × V)) | |
| 2 | 0xp 5765 | . . 3 ⊢ (∅ × V) = ∅ | |
| 3 | 2 | ineq2i 4173 | . 2 ⊢ (𝐴 ∩ (∅ × V)) = (𝐴 ∩ ∅) |
| 4 | in0 4355 | . 2 ⊢ (𝐴 ∩ ∅) = ∅ | |
| 5 | 1, 3, 4 | 3eqtri 2793 | 1 ⊢ (𝐴 ↾ ∅) = ∅ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 Vcvv 3458 ∩ cin 3907 ∅c0 4289 × cxp 5664 ↾ cres 5668 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-rab 3420 df-v 3460 df-dif 3911 df-in 3915 df-nul 4290 df-opab 5179 df-xp 5672 df-res 5678 |
| This theorem is used by: ima0 6084 resdisj 6172 dfpo2 6304 smo0 8354 tfrlem16 8389 tz7.44-1 8402 rdg0n 8430 mapunen 9144 fnfi 9172 ackbij2lem3 10242 hashf1lem1 14512 setsid 17292 join0 18484 meet0 18485 frmdplusg 18944 psgn0fv0 19612 gsum2dlem2 20072 ablfac1eulem 20175 ablfac1eu 20176 gsumle 20246 psrplusg 22124 ply1plusgfvi 22438 ptuncnv 24001 ptcmpfi 24007 ust0 24414 xrge0gsumle 25028 xrge0tsms 25029 jensen 27190 egrsubgr 29664 0grsubgr 29665 pthdlem1 30152 0pth 30513 1pthdlem1 30523 eupth2lemb 30625 fressupp 33070 resf1o 33112 xrge0tsmsd 33424 rprmdvdsprod 33855 zarcmplem 34302 esumsnf 34485 satfv1lem 35875 eldm3 36274 rdgprc0 36304 bj-rdg0gALT 37748 zrdivrng 38645 disjresin 38933 eldioph4b 43579 diophren 43581 ismeannd 47222 psmeasure 47226 isomennd 47286 hoidmvlelem3 47352 stgr0 48766 tposres3 49700 setc1oid 50314 aacllem 50662 |
| Copyright terms: Public domain | W3C validator |