Theorem fnopfv 5777

Description: Ordered pair with function value. Part of Theorem 4.3(i) of [Monk1] p. 41. (Contributed by NM, 30-Sep-2004.)

Assertion

Ref	Expression
fnopfv	⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ⟨𝐵, (𝐹‘𝐵)⟩ ∈ 𝐹)

Proof of Theorem fnopfv

Step	Hyp	Ref	Expression
1		funfvop 5759	. 2 ⊢ ((Fun 𝐹 ∧ 𝐵 ∈ dom 𝐹) → ⟨𝐵, (𝐹‘𝐵)⟩ ∈ 𝐹)
2	1	funfni 5431	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ∈ 𝐴) → ⟨𝐵, (𝐹‘𝐵)⟩ ∈ 𝐹)

Syntax hints:   → wi 4   ∧ wa 104   ∈ wcel 2201  ⟨cop 3671   Fn wfn 5320  ‘cfv 5325

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2204  ax-ext 2212  ax-sep 4206  ax-pow 4263  ax-pr 4298

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ral 2514  df-rex 2515  df-v 2803  df-sbc 3031  df-un 3203  df-in 3205  df-ss 3212  df-pw 3653  df-sn 3674  df-pr 3675  df-op 3677  df-uni 3893  df-br 4088  df-opab 4150  df-id 4389  df-xp 4730  df-rel 4731  df-cnv 4732  df-co 4733  df-dm 4734  df-iota 5285  df-fun 5327  df-fn 5328  df-fv 5333

This theorem is referenced by:  foeqcnvco  5933  acfun  7424  ccfunen  7485