| 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 3371 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ∩ (𝐶 × V)) = (𝐵 ∩ (𝐶 × V))) | |
| 2 | df-res 4695 | . 2 ⊢ (𝐴 ↾ 𝐶) = (𝐴 ∩ (𝐶 × V)) | |
| 3 | df-res 4695 | . 2 ⊢ (𝐵 ↾ 𝐶) = (𝐵 ∩ (𝐶 × V)) | |
| 4 | 1, 2, 3 | 3eqtr4g 2264 | 1 ⊢ (𝐴 = 𝐵 → (𝐴 ↾ 𝐶) = (𝐵 ↾ 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1373 Vcvv 2773 ∩ cin 3169 × cxp 4681 ↾ cres 4685 |
| 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 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-ext 2188 |
| This theorem depends on definitions: df-bi 117 df-tru 1376 df-nf 1485 df-sb 1787 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-v 2775 df-in 3176 df-res 4695 |
| This theorem is referenced by: reseq1i 4964 reseq1d 4967 imaeq1 5026 relcoi1 5223 tfr0dm 6421 tfrlemiex 6430 tfr1onlemex 6446 tfr1onlemaccex 6447 tfrcllemsucaccv 6453 tfrcllembxssdm 6455 tfrcllemex 6459 tfrcllemaccex 6460 tfrcllemres 6461 pmresg 6776 lmbr 14760 |
| Copyright terms: Public domain | W3C validator |