| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ofeqd | GIF version | ||
| Description: Equality theorem for function operation, deduction form. (Contributed by SN, 11-Nov-2024.) |
| Ref | Expression |
|---|---|
| ofeqd.1 | ⊢ (𝜑 → 𝑅 = 𝑆) |
| Ref | Expression |
|---|---|
| ofeqd | ⊢ (𝜑 → ∘𝑓 𝑅 = ∘𝑓 𝑆) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ofeqd.1 | . . . . 5 ⊢ (𝜑 → 𝑅 = 𝑆) | |
| 2 | 1 | oveqd 5979 | . . . 4 ⊢ (𝜑 → ((𝑓‘𝑥)𝑅(𝑔‘𝑥)) = ((𝑓‘𝑥)𝑆(𝑔‘𝑥))) |
| 3 | 2 | mpteq2dv 4146 | . . 3 ⊢ (𝜑 → (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥))) = (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑆(𝑔‘𝑥)))) |
| 4 | 3 | mpoeq3dv 6029 | . 2 ⊢ (𝜑 → (𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) = (𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑆(𝑔‘𝑥))))) |
| 5 | df-of 6176 | . 2 ⊢ ∘𝑓 𝑅 = (𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) | |
| 6 | df-of 6176 | . 2 ⊢ ∘𝑓 𝑆 = (𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑆(𝑔‘𝑥)))) | |
| 7 | 4, 5, 6 | 3eqtr4g 2264 | 1 ⊢ (𝜑 → ∘𝑓 𝑅 = ∘𝑓 𝑆) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1373 Vcvv 2773 ∩ cin 3169 ↦ cmpt 4116 dom cdm 4688 ‘cfv 5285 (class class class)co 5962 ∈ cmpo 5964 ∘𝑓 cof 6174 |
| 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-3an 983 df-tru 1376 df-nf 1485 df-sb 1787 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ral 2490 df-rex 2491 df-uni 3860 df-br 4055 df-opab 4117 df-mpt 4118 df-iota 5246 df-fv 5293 df-ov 5965 df-oprab 5966 df-mpo 5967 df-of 6176 |
| This theorem is referenced by: psrval 14513 lgseisenlem3 15634 lgseisenlem4 15635 |
| Copyright terms: Public domain | W3C validator |