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

Theorem dfimafn2 6940
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 6939 . . 3 ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦})
2 iunab 5010 . . 3 ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ (𝐹‘𝑥) = 𝑦} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦}
31, 2eqtr4di 2814 . 2 ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ (𝐹‘𝑥) = 𝑦})
4 df-sn 4585 . . . . 5 {(𝐹‘𝑥)} = {𝑦 ∣ 𝑦 = (𝐹‘𝑥)}
5 eqcom 2768 . . . . . 6 (𝑦 = (𝐹‘𝑥) ↔ (𝐹‘𝑥) = 𝑦)
65abbii 2828 . . . . 5 {𝑦 ∣ 𝑦 = (𝐹‘𝑥)} = {𝑦 ∣ (𝐹‘𝑥) = 𝑦}
74, 6eqtri 2784 . . . 4 {(𝐹‘𝑥)} = {𝑦 ∣ (𝐹‘𝑥) = 𝑦}
87a1i 11 . . 3 (𝑥 ∈ 𝐴 → {(𝐹‘𝑥)} = {𝑦 ∣ (𝐹‘𝑥) = 𝑦})
98iuneq2i 4973 . 2 ∪ 𝑥 ∈ 𝐴 {(𝐹‘𝑥)} = ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ (𝐹‘𝑥) = 𝑦}
103, 9eqtr4di 2814 1 ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = ∪ 𝑥 ∈ 𝐴 {(𝐹‘𝑥)})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2739  ∃wrex 3087   ⊆ wss 3899  {csn 4584  ∪ ciun 4951  dom cdm 5651   “ cima 5654  Fun wfun 6525  ‘cfv 6531
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-fv 6539
This theorem is used by:  uniiccdif  25879
  Copyright terms: Public domain W3C validator