![]() |
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 6577 | . . 3 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹) | |
2 | dffn5 6949 | . . 3 ⊢ (𝐹 Fn dom 𝐹 ↔ 𝐹 = (𝑥 ∈ dom 𝐹 ↦ (𝐹‘𝑥))) | |
3 | 1, 2 | sylbb 218 | . 2 ⊢ (Fun 𝐹 → 𝐹 = (𝑥 ∈ dom 𝐹 ↦ (𝐹‘𝑥))) |
4 | fvex 6903 | . . 3 ⊢ (𝐹‘𝑥) ∈ V | |
5 | 4 | dfmpt 7143 | . 2 ⊢ (𝑥 ∈ dom 𝐹 ↦ (𝐹‘𝑥)) = ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩} |
6 | 3, 5 | eqtrdi 2786 | 1 ⊢ (Fun 𝐹 → 𝐹 = ∪ 𝑥 ∈ dom 𝐹{⟨𝑥, (𝐹‘𝑥)⟩}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 {csn 4627 ⟨cop 4633 ∪ ciun 4996 ↦ cmpt 5230 dom cdm 5675 Fun wfun 6536 Fn wfn 6537 ‘cfv 6542 |
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 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-sep 5298 ax-nul 5305 ax-pr 5426 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-ral 3060 df-rex 3069 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5573 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 |
This theorem is referenced by: funopsn 7147 |
Copyright terms: Public domain | W3C validator |