Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dffn5f | Structured version Visualization version GIF version |
Description: Representation of a function in terms of its values. (Contributed by Mario Carneiro, 3-Jul-2015.) |
Ref | Expression |
---|---|
dffn5f.1 | ⊢ Ⅎ𝑥𝐹 |
Ref | Expression |
---|---|
dffn5f | ⊢ (𝐹 Fn 𝐴 ↔ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dffn5 6726 | . 2 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹 = (𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧))) | |
2 | dffn5f.1 | . . . . 5 ⊢ Ⅎ𝑥𝐹 | |
3 | nfcv 2979 | . . . . 5 ⊢ Ⅎ𝑥𝑧 | |
4 | 2, 3 | nffv 6682 | . . . 4 ⊢ Ⅎ𝑥(𝐹‘𝑧) |
5 | nfcv 2979 | . . . 4 ⊢ Ⅎ𝑧(𝐹‘𝑥) | |
6 | fveq2 6672 | . . . 4 ⊢ (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥)) | |
7 | 4, 5, 6 | cbvmpt 5169 | . . 3 ⊢ (𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧)) = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) |
8 | 7 | eqeq2i 2836 | . 2 ⊢ (𝐹 = (𝑧 ∈ 𝐴 ↦ (𝐹‘𝑧)) ↔ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))) |
9 | 1, 8 | bitri 277 | 1 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥))) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 = wceq 1537 Ⅎwnfc 2963 ↦ cmpt 5148 Fn wfn 6352 ‘cfv 6357 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pr 5332 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-iota 6316 df-fun 6359 df-fn 6360 df-fv 6365 |
This theorem is referenced by: prdsgsum 19103 lgamgulm2 25615 fcomptf 30405 esumsup 31350 poimirlem16 34910 poimirlem19 34913 refsum2cnlem1 41301 etransclem2 42528 |
Copyright terms: Public domain | W3C validator |