![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > dfimafn2 | Structured version Visualization version GIF version |
Description: Alternate definition of the image of a function as an indexed union of singletons of function values. (Contributed by Raph Levien, 20-Nov-2006.) |
Ref | Expression |
---|---|
dfimafn2 | ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = ∪ 𝑥 ∈ 𝐴 {(𝐹‘𝑥)}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfimafn 6971 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦}) | |
2 | iunab 5056 | . . 3 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ (𝐹‘𝑥) = 𝑦} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦} | |
3 | 1, 2 | eqtr4di 2793 | . 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ (𝐹‘𝑥) = 𝑦}) |
4 | df-sn 4632 | . . . . 5 ⊢ {(𝐹‘𝑥)} = {𝑦 ∣ 𝑦 = (𝐹‘𝑥)} | |
5 | eqcom 2742 | . . . . . 6 ⊢ (𝑦 = (𝐹‘𝑥) ↔ (𝐹‘𝑥) = 𝑦) | |
6 | 5 | abbii 2807 | . . . . 5 ⊢ {𝑦 ∣ 𝑦 = (𝐹‘𝑥)} = {𝑦 ∣ (𝐹‘𝑥) = 𝑦} |
7 | 4, 6 | eqtri 2763 | . . . 4 ⊢ {(𝐹‘𝑥)} = {𝑦 ∣ (𝐹‘𝑥) = 𝑦} |
8 | 7 | a1i 11 | . . 3 ⊢ (𝑥 ∈ 𝐴 → {(𝐹‘𝑥)} = {𝑦 ∣ (𝐹‘𝑥) = 𝑦}) |
9 | 8 | iuneq2i 5018 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 {(𝐹‘𝑥)} = ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ (𝐹‘𝑥) = 𝑦} |
10 | 3, 9 | eqtr4di 2793 | 1 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = ∪ 𝑥 ∈ 𝐴 {(𝐹‘𝑥)}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2106 {cab 2712 ∃wrex 3068 ⊆ wss 3963 {csn 4631 ∪ ciun 4996 dom cdm 5689 “ cima 5692 Fun wfun 6557 ‘cfv 6563 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-id 5583 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-iota 6516 df-fun 6565 df-fn 6566 df-fv 6571 |
This theorem is referenced by: uniiccdif 25627 |
Copyright terms: Public domain | W3C validator |