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 6765 for functions on Cartesian products. (Contributed by BJ, 15-Feb-2022.) |
Ref | Expression |
---|---|
fnbrovb | ⊢ ((𝐹 Fn (𝑉 × 𝑊) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) → ((𝐴𝐹𝐵) = 𝐶 ↔ 〈𝐴, 𝐵〉𝐹𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-ov 7216 | . . 3 ⊢ (𝐴𝐹𝐵) = (𝐹‘〈𝐴, 𝐵〉) | |
2 | 1 | eqeq1i 2742 | . 2 ⊢ ((𝐴𝐹𝐵) = 𝐶 ↔ (𝐹‘〈𝐴, 𝐵〉) = 𝐶) |
3 | fnbrfvb2 6769 | . 2 ⊢ ((𝐹 Fn (𝑉 × 𝑊) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) → ((𝐹‘〈𝐴, 𝐵〉) = 𝐶 ↔ 〈𝐴, 𝐵〉𝐹𝐶)) | |
4 | 2, 3 | syl5bb 286 | 1 ⊢ ((𝐹 Fn (𝑉 × 𝑊) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) → ((𝐴𝐹𝐵) = 𝐶 ↔ 〈𝐴, 𝐵〉𝐹𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1543 ∈ wcel 2110 〈cop 4547 class class class wbr 5053 × cxp 5549 Fn wfn 6375 ‘cfv 6380 (class class class)co 7213 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 ax-sep 5192 ax-nul 5199 ax-pr 5322 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2886 df-ral 3066 df-rex 3067 df-rab 3070 df-v 3410 df-dif 3869 df-un 3871 df-in 3873 df-ss 3883 df-nul 4238 df-if 4440 df-sn 4542 df-pr 4544 df-op 4548 df-uni 4820 df-br 5054 df-opab 5116 df-id 5455 df-xp 5557 df-rel 5558 df-cnv 5559 df-co 5560 df-dm 5561 df-iota 6338 df-fun 6382 df-fn 6383 df-fv 6388 df-ov 7216 |
This theorem is referenced by: fnotovb 7263 |
Copyright terms: Public domain | W3C validator |