| 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 6506 | . . 3 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹) | |
| 2 | dffn5 6874 | . . 3 ⊢ (𝐹 Fn dom 𝐹 ↔ 𝐹 = (𝑥 ∈ dom 𝐹 ↦ (𝐹‘𝑥))) | |
| 3 | 1, 2 | sylbb 219 | . 2 ⊢ (Fun 𝐹 → 𝐹 = (𝑥 ∈ dom 𝐹 ↦ (𝐹‘𝑥))) |
| 4 | fvex 6829 | . . 3 ⊢ (𝐹‘𝑥) ∈ V | |
| 5 | 4 | dfmpt 7071 | . 2 ⊢ (𝑥 ∈ dom 𝐹 ↦ (𝐹‘𝑥)) = ∪ 𝑥 ∈ dom 𝐹{〈𝑥, (𝐹‘𝑥)〉} |
| 6 | 3, 5 | eqtrdi 2780 | 1 ⊢ (Fun 𝐹 → 𝐹 = ∪ 𝑥 ∈ dom 𝐹{〈𝑥, (𝐹‘𝑥)〉}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 {csn 4573 〈cop 4579 ∪ ciun 4938 ↦ cmpt 5169 dom cdm 5613 Fun wfun 6470 Fn wfn 6471 ‘cfv 6476 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5231 ax-nul 5241 ax-pr 5367 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-reu 3344 df-rab 3393 df-v 3435 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4281 df-if 4473 df-sn 4574 df-pr 4576 df-op 4580 df-uni 4857 df-iun 4940 df-br 5089 df-opab 5151 df-mpt 5170 df-id 5508 df-xp 5619 df-rel 5620 df-cnv 5621 df-co 5622 df-dm 5623 df-rn 5624 df-iota 6432 df-fun 6478 df-fn 6479 df-f 6480 df-f1 6481 df-fo 6482 df-f1o 6483 df-fv 6484 |
| This theorem is referenced by: funopsn 7075 |
| Copyright terms: Public domain | W3C validator |