Theorem fnopafv2b 47376

Description: Equivalence of function value and ordered pair membership, analogous to fnopfvb 6881. (Contributed by AV, 6-Sep-2022.)

Assertion

Ref	Expression
fnopafv2b	⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹''''𝐵) = 𝐶 ↔ ⟨𝐵, 𝐶⟩ ∈ 𝐹))

Proof of Theorem fnopafv2b

Step	Hyp	Ref	Expression
1		fnbrafv2b 47375	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹''''𝐵) = 𝐶 ↔ 𝐵𝐹𝐶))
2		df-br 5096	. 2 ⊢ (𝐵𝐹𝐶 ↔ ⟨𝐵, 𝐶⟩ ∈ 𝐹)
3	1, 2	bitrdi 287	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝐹''''𝐵) = 𝐶 ↔ ⟨𝐵, 𝐶⟩ ∈ 𝐹))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2113  ⟨cop 4583   class class class wbr 5095   Fn wfn 6483  ''''cafv2 47335

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-rab 3397  df-v 3439  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-br 5096  df-opab 5158  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-res 5633  df-iota 6444  df-fun 6490  df-fn 6491  df-dfat 47246  df-afv2 47336

This theorem is referenced by:  funopafv2b  47378