| 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 3419 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ∩ (𝐶 × V)) = (𝐵 ∩ (𝐶 × V))) | |
| 2 | df-res 4766 | . 2 ⊢ (𝐴 ↾ 𝐶) = (𝐴 ∩ (𝐶 × V)) | |
| 3 | df-res 4766 | . 2 ⊢ (𝐵 ↾ 𝐶) = (𝐵 ∩ (𝐶 × V)) | |
| 4 | 1, 2, 3 | 3eqtr4g 2292 | 1 ⊢ (𝐴 = 𝐵 → (𝐴 ↾ 𝐶) = (𝐵 ↾ 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 Vcvv 2815 ∩ cin 3213 × cxp 4752 ↾ cres 4756 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2216 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-v 2817 df-in 3220 df-res 4766 |
| This theorem is referenced by: reseq1i 5039 reseq1d 5042 imaeq1 5101 relcoi1 5299 tfr0dm 6566 tfrlemiex 6575 tfr1onlemex 6591 tfr1onlemaccex 6592 tfrcllemsucaccv 6598 tfrcllembxssdm 6600 tfrcllemex 6604 tfrcllemaccex 6605 tfrcllemres 6606 pmresg 6923 mapunen 7117 lmbr 15204 |
| Copyright terms: Public domain | W3C validator |