Theorem dffn5f 6959

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 6946	. 2 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹 = (𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧)))
2		dffn5f.1	. . . . 5 ⊢ Ⅎ𝑥𝐹
3		nfcv 2928	. . . . 5 ⊢ Ⅎ𝑥𝑧
4	2, 3	nffv 6898	. . . 4 ⊢ Ⅎ𝑥(𝐹‘𝑧)
5		nfcv 2928	. . . 4 ⊢ Ⅎ𝑧(𝐹‘𝑥)
6		fveq2 6888	. . . 4 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥))
7	4, 5, 6	cbvmpt 5218	. . 3 ⊢ (𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧)) = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))
8	7	eqeq2i 2779	. 2 ⊢ (𝐹 = (𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧)) ↔ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
9	1, 8	bitri 278	1 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570  Ⅎwnfc 2913   ↦ cmpt 5197   Fn wfn 6538  ‘cfv 6543

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409

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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-iota 6499  df-fun 6545  df-fn 6546  df-fv 6551

This theorem is used by:  prdsgsum  20082  pwsgprod  20444  lgamgulm2  27237  fcomptf  33040  esumsup  34510  poimirlem16  38328  poimirlem19  38331  refsum2cnlem1  45798  etransclem2  46991