| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > reseq1 | GIF version | ||
| Description: Equality theorem for restrictions. (Contributed by NM, 7-Aug-1994.) |
| Ref | Expression |
|---|---|
| reseq1 | ⊢ (𝐴 = 𝐵 → (𝐴 ↾ 𝐶) = (𝐵 ↾ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ineq1 3425 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ∩ (𝐶 × V)) = (𝐵 ∩ (𝐶 × V))) | |
| 2 | df-res 4788 | . 2 ⊢ (𝐴 ↾ 𝐶) = (𝐴 ∩ (𝐶 × V)) | |
| 3 | df-res 4788 | . 2 ⊢ (𝐵 ↾ 𝐶) = (𝐵 ∩ (𝐶 × V)) | |
| 4 | 1, 2, 3 | 3eqtr4g 2296 | 1 ⊢ (𝐴 = 𝐵 → (𝐴 ↾ 𝐶) = (𝐵 ↾ 𝐶)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 = wceq 1402 Vcvv 2821 ∩ cin 3219 × cxp 4774 ↾ cres 4778 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 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-ext 2220 |
| This proof depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-v 2823 df-in 3226 df-res 4788 |
| This theorem is used by: reseq1i 5061 reseq1d 5064 imaeq1 5124 relcoi1 5322 tfr0dm 6598 tfrlemiex 6607 tfr1onlemex 6623 tfr1onlemaccex 6624 tfrcllemsucaccv 6630 tfrcllembxssdm 6632 tfrcllemex 6636 tfrcllemaccex 6637 tfrcllemres 6638 pmresg 6962 mapunen 7157 hashf1lem1 11306 lmbr 15456 |
| Copyright terms: Public domain | W3C validator |