| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > res0 | 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 4786 | . 2 ⊢ (𝐴 ↾ ∅) = (𝐴 ∩ (∅ × V)) | |
| 2 | 0xp 4855 | . . 3 ⊢ (∅ × V) = ∅ | |
| 3 | 2 | ineq2i 3429 | . 2 ⊢ (𝐴 ∩ (∅ × V)) = (𝐴 ∩ ∅) |
| 4 | in0 3557 | . 2 ⊢ (𝐴 ∩ ∅) = ∅ | |
| 5 | 1, 3, 4 | 3eqtri 2263 | 1 ⊢ (𝐴 ↾ ∅) = ∅ |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: = wceq 1402 Vcvv 2821 ∩ cin 3219 ∅c0 3520 × cxp 4772 ↾ cres 4776 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-v 2823 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-opab 4193 df-xp 4780 df-res 4786 |
| This theorem is used by: ima0 5146 resdisj 5216 smo0 6569 tfr0dm 6593 tfr0 6594 fnfi 7250 setsslid 13405 gzsumsplit0 14150 gsumclfi 14161 gsummptfidmadd 14163 gsumsubmclfi 14165 egrsubgr 16516 0grsubgr 16517 eupth2lembfi 16730 |
| Copyright terms: Public domain | W3C validator |