| 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 3415 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ∩ (𝐶 × V)) = (𝐵 ∩ (𝐶 × V))) | |
| 2 | df-res 4761 | . 2 ⊢ (𝐴 ↾ 𝐶) = (𝐴 ∩ (𝐶 × V)) | |
| 3 | df-res 4761 | . 2 ⊢ (𝐵 ↾ 𝐶) = (𝐵 ∩ (𝐶 × V)) | |
| 4 | 1, 2, 3 | 3eqtr4g 2290 | 1 ⊢ (𝐴 = 𝐵 → (𝐴 ↾ 𝐶) = (𝐵 ↾ 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 Vcvv 2813 ∩ cin 3210 × cxp 4747 ↾ cres 4751 |
| 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 2214 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-v 2815 df-in 3217 df-res 4761 |
| This theorem is referenced by: reseq1i 5034 reseq1d 5037 imaeq1 5096 relcoi1 5294 tfr0dm 6553 tfrlemiex 6562 tfr1onlemex 6578 tfr1onlemaccex 6579 tfrcllemsucaccv 6585 tfrcllembxssdm 6587 tfrcllemex 6591 tfrcllemaccex 6592 tfrcllemres 6593 pmresg 6910 mapunen 7104 lmbr 15078 |
| Copyright terms: Public domain | W3C validator |