Theorem dffn5f 6948

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 6935	. 2 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹 = (𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧)))
2		dffn5f.1	. . . . 5 ⊢ Ⅎ𝑥𝐹
3		nfcv 2923	. . . . 5 ⊢ Ⅎ𝑥𝑧
4	2, 3	nffv 6887	. . . 4 ⊢ Ⅎ𝑥(𝐹‘𝑧)
5		nfcv 2923	. . . 4 ⊢ Ⅎ𝑧(𝐹‘𝑥)
6		fveq2 6877	. . . 4 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥))
7	4, 5, 6	cbvmpt 5207	. . 3 ⊢ (𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧)) = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))
8	7	eqeq2i 2774	. 2 ⊢ (𝐹 = (𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧)) ↔ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
9	1, 8	bitri 278	1 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570  Ⅎwnfc 2908   ↦ cmpt 5186   Fn wfn 6526  ‘cfv 6531

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 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6487  df-fun 6533  df-fn 6534  df-fv 6539

This theorem is used by:  prdsgsum  20175  pwsgprod  20539  lgamgulm2  27345  fcomptf  33234  esumsup  34703  poimirlem16  38522  poimirlem19  38525  refsum2cnlem1  45997  etransclem2  47190