| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fnbrovb | Structured version Visualization version GIF version | ||
| Description: Value of a binary operation expressed as a binary relation. See also fnbrfvb 6892 for functions on Cartesian products. (Contributed by BJ, 15-Feb-2022.) |
| Ref | Expression |
|---|---|
| fnbrovb | ⊢ ((𝐹 Fn (𝑉 × 𝑊) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) → ((𝐴𝐹𝐵) = 𝐶 ↔ 〈𝐴, 𝐵〉𝐹𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ov 7371 | . . 3 ⊢ (𝐴𝐹𝐵) = (𝐹‘〈𝐴, 𝐵〉) | |
| 2 | 1 | eqeq1i 2742 | . 2 ⊢ ((𝐴𝐹𝐵) = 𝐶 ↔ (𝐹‘〈𝐴, 𝐵〉) = 𝐶) |
| 3 | fnbrfvb2 6897 | . 2 ⊢ ((𝐹 Fn (𝑉 × 𝑊) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) → ((𝐹‘〈𝐴, 𝐵〉) = 𝐶 ↔ 〈𝐴, 𝐵〉𝐹𝐶)) | |
| 4 | 2, 3 | bitrid 283 | 1 ⊢ ((𝐹 Fn (𝑉 × 𝑊) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) → ((𝐴𝐹𝐵) = 𝐶 ↔ 〈𝐴, 𝐵〉𝐹𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 〈cop 4588 class class class wbr 5100 × cxp 5630 Fn wfn 6495 ‘cfv 6500 (class class class)co 7368 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pr 5379 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-iota 6456 df-fun 6502 df-fn 6503 df-fv 6508 df-ov 7371 |
| This theorem is referenced by: fnotovb 7420 sectpropdlem 49389 invpropdlem 49391 isopropdlem 49393 |
| Copyright terms: Public domain | W3C validator |