MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dfimafn2 Structured version   Visualization version   GIF version

Theorem dfimafn2 6948
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.)
Assertion
Ref Expression
dfimafn2 ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = ∪ 𝑥 ∈ 𝐴 {(𝐹‘𝑥)})
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹

Proof of Theorem dfimafn2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 dfimafn 6947 . . 3 ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦})
2 iunab 5009 . . 3 ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ (𝐹‘𝑥) = 𝑦} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦}
31, 2eqtr4di 2813 . 2 ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ (𝐹‘𝑥) = 𝑦})
4 df-sn 4585 . . . . 5 {(𝐹‘𝑥)} = {𝑦 ∣ 𝑦 = (𝐹‘𝑥)}
5 eqcom 2767 . . . . . 6 (𝑦 = (𝐹‘𝑥) ↔ (𝐹‘𝑥) = 𝑦)
65abbii 2827 . . . . 5 {𝑦 ∣ 𝑦 = (𝐹‘𝑥)} = {𝑦 ∣ (𝐹‘𝑥) = 𝑦}
74, 6eqtri 2783 . . . 4 {(𝐹‘𝑥)} = {𝑦 ∣ (𝐹‘𝑥) = 𝑦}
87a1i 11 . . 3 (𝑥 ∈ 𝐴 → {(𝐹‘𝑥)} = {𝑦 ∣ (𝐹‘𝑥) = 𝑦})
98iuneq2i 4972 . 2 ∪ 𝑥 ∈ 𝐴 {(𝐹‘𝑥)} = ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ (𝐹‘𝑥) = 𝑦}
103, 9eqtr4di 2813 1 ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = ∪ 𝑥 ∈ 𝐴 {(𝐹‘𝑥)})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {cab 2738  ∃wrex 3086   ⊆ wss 3895  {csn 4584  ∪ ciun 4950  dom cdm 5650   “ cima 5653  Fun wfun 6532  ‘cfv 6538
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-fv 6546
This theorem is used by:  uniiccdif  25904
  Copyright terms: Public domain W3C validator