Theorem dffn5f 6953

Description: Representation of a function in terms of its values. (Contributed by Mario Carneiro, 3-Jul-2015.)

Hypothesis

Ref	Expression
dffn5f.1	⊢ Ⅎ𝑥𝐹

Assertion

Ref	Expression
dffn5f	⊢ (𝐹 Fn 𝐴 ↔ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))

Distinct variable group:   𝑥,𝐴

Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem dffn5f

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dffn5 6940	. 2 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹 = (𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧)))
2		dffn5f.1	. . . . 5 ⊢ Ⅎ𝑥𝐹
3		nfcv 2924	. . . . 5 ⊢ Ⅎ𝑥𝑧
4	2, 3	nffv 6892	. . . 4 ⊢ Ⅎ𝑥(𝐹‘𝑧)
5		nfcv 2924	. . . 4 ⊢ Ⅎ𝑧(𝐹‘𝑥)
6		fveq2 6882	. . . 4 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥))
7	4, 5, 6	cbvmpt 5211	. . 3 ⊢ (𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧)) = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))
8	7	eqeq2i 2775	. 2 ⊢ (𝐹 = (𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧)) ↔ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
9	1, 8	bitri 278	1 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570  Ⅎwnfc 2909   ↦ cmpt 5190   Fn wfn 6532  ‘cfv 6537

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6493  df-fun 6539  df-fn 6540  df-fv 6545

This theorem is used by:  prdsgsum  20114  pwsgprod  20476  lgamgulm2  27280  fcomptf  33139  esumsup  34607  poimirlem16  38393  poimirlem19  38396  refsum2cnlem1  45879  etransclem2  47072