| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > funiun | Structured version Visualization version GIF version | ||
| Description: A function is a union of singletons of ordered pairs indexed by its domain. (Contributed by AV, 18-Sep-2020.) |
| Ref | Expression |
|---|---|
| funiun | ⊢ (Fun 𝐹 → 𝐹 = ∪ 𝑥 ∈ dom 𝐹{〈𝑥, (𝐹‘𝑥)〉}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | funfn 6523 | . . 3 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹) | |
| 2 | dffn5 6893 | . . 3 ⊢ (𝐹 Fn dom 𝐹 ↔ 𝐹 = (𝑥 ∈ dom 𝐹 ↦ (𝐹‘𝑥))) | |
| 3 | 1, 2 | sylbb 219 | . 2 ⊢ (Fun 𝐹 → 𝐹 = (𝑥 ∈ dom 𝐹 ↦ (𝐹‘𝑥))) |
| 4 | fvex 6848 | . . 3 ⊢ (𝐹‘𝑥) ∈ V | |
| 5 | 4 | dfmpt 7092 | . 2 ⊢ (𝑥 ∈ dom 𝐹 ↦ (𝐹‘𝑥)) = ∪ 𝑥 ∈ dom 𝐹{〈𝑥, (𝐹‘𝑥)〉} |
| 6 | 3, 5 | eqtrdi 2788 | 1 ⊢ (Fun 𝐹 → 𝐹 = ∪ 𝑥 ∈ dom 𝐹{〈𝑥, (𝐹‘𝑥)〉}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 {csn 4568 〈cop 4574 ∪ ciun 4934 ↦ cmpt 5167 dom cdm 5625 Fun wfun 6487 Fn wfn 6488 ‘cfv 6493 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pr 5371 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 |
| This theorem is referenced by: funopsn 7096 |
| Copyright terms: Public domain | W3C validator |