| 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 6873 for functions on Cartesian products. (Contributed by BJ, 15-Feb-2022.) |
| Ref | Expression |
|---|---|
| fnbrovb | ⊢ ((𝐹 Fn (𝑉 × 𝑊) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) → ((𝐴𝐹𝐵) = 𝐶 ↔ 〈𝐴, 𝐵〉𝐹𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ov 7352 | . . 3 ⊢ (𝐴𝐹𝐵) = (𝐹‘〈𝐴, 𝐵〉) | |
| 2 | 1 | eqeq1i 2734 | . 2 ⊢ ((𝐴𝐹𝐵) = 𝐶 ↔ (𝐹‘〈𝐴, 𝐵〉) = 𝐶) |
| 3 | fnbrfvb2 6878 | . 2 ⊢ ((𝐹 Fn (𝑉 × 𝑊) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) → ((𝐹‘〈𝐴, 𝐵〉) = 𝐶 ↔ 〈𝐴, 𝐵〉𝐹𝐶)) | |
| 4 | 2, 3 | bitrid 283 | 1 ⊢ ((𝐹 Fn (𝑉 × 𝑊) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) → ((𝐴𝐹𝐵) = 𝐶 ↔ 〈𝐴, 𝐵〉𝐹𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 〈cop 4583 class class class wbr 5092 × cxp 5617 Fn wfn 6477 ‘cfv 6482 (class class class)co 7349 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-12 2178 ax-ext 2701 ax-sep 5235 ax-nul 5245 ax-pr 5371 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3395 df-v 3438 df-dif 3906 df-un 3908 df-ss 3920 df-nul 4285 df-if 4477 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-br 5093 df-opab 5155 df-id 5514 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-iota 6438 df-fun 6484 df-fn 6485 df-fv 6490 df-ov 7352 |
| This theorem is referenced by: fnotovb 7401 sectpropdlem 49021 invpropdlem 49023 isopropdlem 49025 |
| Copyright terms: Public domain | W3C validator |