| 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 6017 | . . . 4 ⊢ (𝜑 → ((𝑓‘𝑥)𝑅(𝑔‘𝑥)) = ((𝑓‘𝑥)𝑆(𝑔‘𝑥))) |
| 3 | 2 | mpteq2dv 4174 | . . 3 ⊢ (𝜑 → (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥))) = (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑆(𝑔‘𝑥)))) |
| 4 | 3 | mpoeq3dv 6069 | . 2 ⊢ (𝜑 → (𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) = (𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑆(𝑔‘𝑥))))) |
| 5 | df-of 6216 | . 2 ⊢ ∘𝑓 𝑅 = (𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥)))) | |
| 6 | df-of 6216 | . 2 ⊢ ∘𝑓 𝑆 = (𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑆(𝑔‘𝑥)))) | |
| 7 | 4, 5, 6 | 3eqtr4g 2287 | 1 ⊢ (𝜑 → ∘𝑓 𝑅 = ∘𝑓 𝑆) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1395 Vcvv 2799 ∩ cin 3196 ↦ cmpt 4144 dom cdm 4718 ‘cfv 5317 (class class class)co 6000 ∈ cmpo 6002 ∘𝑓 cof 6214 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-rex 2514 df-uni 3888 df-br 4083 df-opab 4145 df-mpt 4146 df-iota 5277 df-fv 5325 df-ov 6003 df-oprab 6004 df-mpo 6005 df-of 6216 |
| This theorem is referenced by: psrval 14624 lgseisenlem3 15745 lgseisenlem4 15746 |
| Copyright terms: Public domain | W3C validator |