Theorem fnbrovb 7304

Description: Value of a binary operation expressed as a binary relation. See also fnbrfvb 6804 for functions on Cartesian products. (Contributed by BJ, 15-Feb-2022.)

Assertion

Ref	Expression
fnbrovb	⊢ ((𝐹 Fn (𝑉 × 𝑊) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) → ((𝐴𝐹𝐵) = 𝐶 ↔ ⟨𝐴, 𝐵⟩𝐹𝐶))

Proof of Theorem fnbrovb

Step	Hyp	Ref	Expression
1		df-ov 7258	. . 3 ⊢ (𝐴𝐹𝐵) = (𝐹‘⟨𝐴, 𝐵⟩)
2	1	eqeq1i 2743	. 2 ⊢ ((𝐴𝐹𝐵) = 𝐶 ↔ (𝐹‘⟨𝐴, 𝐵⟩) = 𝐶)
3		fnbrfvb2 6808	. 2 ⊢ ((𝐹 Fn (𝑉 × 𝑊) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) → ((𝐹‘⟨𝐴, 𝐵⟩) = 𝐶 ↔ ⟨𝐴, 𝐵⟩𝐹𝐶))
4	2, 3	syl5bb 282	1 ⊢ ((𝐹 Fn (𝑉 × 𝑊) ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊)) → ((𝐴𝐹𝐵) = 𝐶 ↔ ⟨𝐴, 𝐵⟩𝐹𝐶))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1539   ∈ wcel 2108  ⟨cop 4564   class class class wbr 5070   × cxp 5578   Fn wfn 6413  ‘cfv 6418  (class class class)co 7255

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-iota 6376  df-fun 6420  df-fn 6421  df-fv 6426  df-ov 7258

This theorem is referenced by:  fnotovb  7305