Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ovres | GIF version |
Description: The value of a restricted operation. (Contributed by FL, 10-Nov-2006.) |
Ref | Expression |
---|---|
ovres | ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴(𝐹 ↾ (𝐶 × 𝐷))𝐵) = (𝐴𝐹𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opelxpi 4636 | . . 3 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → 〈𝐴, 𝐵〉 ∈ (𝐶 × 𝐷)) | |
2 | fvres 5510 | . . 3 ⊢ (〈𝐴, 𝐵〉 ∈ (𝐶 × 𝐷) → ((𝐹 ↾ (𝐶 × 𝐷))‘〈𝐴, 𝐵〉) = (𝐹‘〈𝐴, 𝐵〉)) | |
3 | 1, 2 | syl 14 | . 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ((𝐹 ↾ (𝐶 × 𝐷))‘〈𝐴, 𝐵〉) = (𝐹‘〈𝐴, 𝐵〉)) |
4 | df-ov 5845 | . 2 ⊢ (𝐴(𝐹 ↾ (𝐶 × 𝐷))𝐵) = ((𝐹 ↾ (𝐶 × 𝐷))‘〈𝐴, 𝐵〉) | |
5 | df-ov 5845 | . 2 ⊢ (𝐴𝐹𝐵) = (𝐹‘〈𝐴, 𝐵〉) | |
6 | 3, 4, 5 | 3eqtr4g 2224 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝐴(𝐹 ↾ (𝐶 × 𝐷))𝐵) = (𝐴𝐹𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1343 ∈ wcel 2136 〈cop 3579 × cxp 4602 ↾ cres 4606 ‘cfv 5188 (class class class)co 5842 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-nf 1449 df-sb 1751 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ral 2449 df-rex 2450 df-v 2728 df-un 3120 df-in 3122 df-ss 3129 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-uni 3790 df-br 3983 df-opab 4044 df-xp 4610 df-res 4616 df-iota 5153 df-fv 5196 df-ov 5845 |
This theorem is referenced by: ovresd 5982 oprssov 5983 ofmresval 6061 elq 9560 mgmsscl 12592 xmetres2 13019 blres 13074 xmetresbl 13080 mscl 13105 xmscl 13106 xmsge0 13107 xmseq0 13108 divcnap 13195 cncfmet 13219 |
Copyright terms: Public domain | W3C validator |