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

Theorem funiunfv 7182
Description: The indexed union of a function's values is the union of its image under the index class.

Note: This theorem depends on the fact that our function value is the empty set outside of its domain. If the antecedent is changed to 𝐹 Fn 𝐴, the theorem can be proved without this dependency. (Contributed by NM, 26-Mar-2006.) (Proof shortened by Mario Carneiro, 31-Aug-2015.)

Assertion
Ref Expression
funiunfv (Fun 𝐹 𝑥𝐴 (𝐹𝑥) = (𝐹𝐴))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹

Proof of Theorem funiunfv
StepHypRef Expression
1 funres 6523 . . . 4 (Fun 𝐹 → Fun (𝐹𝐴))
21funfnd 6512 . . 3 (Fun 𝐹 → (𝐹𝐴) Fn dom (𝐹𝐴))
3 fniunfv 7181 . . 3 ((𝐹𝐴) Fn dom (𝐹𝐴) → 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) = ran (𝐹𝐴))
42, 3syl 17 . 2 (Fun 𝐹 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) = ran (𝐹𝐴))
5 undif2 4424 . . . . 5 (dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴))) = (dom (𝐹𝐴) ∪ 𝐴)
6 dmres 5960 . . . . . . 7 dom (𝐹𝐴) = (𝐴 ∩ dom 𝐹)
7 inss1 4184 . . . . . . 7 (𝐴 ∩ dom 𝐹) ⊆ 𝐴
86, 7eqsstri 3976 . . . . . 6 dom (𝐹𝐴) ⊆ 𝐴
9 ssequn1 4133 . . . . . 6 (dom (𝐹𝐴) ⊆ 𝐴 ↔ (dom (𝐹𝐴) ∪ 𝐴) = 𝐴)
108, 9mpbi 230 . . . . 5 (dom (𝐹𝐴) ∪ 𝐴) = 𝐴
115, 10eqtri 2754 . . . 4 (dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴))) = 𝐴
12 iuneq1 4956 . . . 4 ((dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴))) = 𝐴 𝑥 ∈ (dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴)))((𝐹𝐴)‘𝑥) = 𝑥𝐴 ((𝐹𝐴)‘𝑥))
1311, 12ax-mp 5 . . 3 𝑥 ∈ (dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴)))((𝐹𝐴)‘𝑥) = 𝑥𝐴 ((𝐹𝐴)‘𝑥)
14 iunxun 5040 . . . 4 𝑥 ∈ (dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴)))((𝐹𝐴)‘𝑥) = ( 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))((𝐹𝐴)‘𝑥))
15 eldifn 4079 . . . . . . . . 9 (𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴)) → ¬ 𝑥 ∈ dom (𝐹𝐴))
16 ndmfv 6854 . . . . . . . . 9 𝑥 ∈ dom (𝐹𝐴) → ((𝐹𝐴)‘𝑥) = ∅)
1715, 16syl 17 . . . . . . . 8 (𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴)) → ((𝐹𝐴)‘𝑥) = ∅)
1817iuneq2i 4961 . . . . . . 7 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))((𝐹𝐴)‘𝑥) = 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))∅
19 iun0 5008 . . . . . . 7 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))∅ = ∅
2018, 19eqtri 2754 . . . . . 6 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))((𝐹𝐴)‘𝑥) = ∅
2120uneq2i 4112 . . . . 5 ( 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))((𝐹𝐴)‘𝑥)) = ( 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) ∪ ∅)
22 un0 4341 . . . . 5 ( 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) ∪ ∅) = 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥)
2321, 22eqtri 2754 . . . 4 ( 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))((𝐹𝐴)‘𝑥)) = 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥)
2414, 23eqtri 2754 . . 3 𝑥 ∈ (dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴)))((𝐹𝐴)‘𝑥) = 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥)
25 fvres 6841 . . . 4 (𝑥𝐴 → ((𝐹𝐴)‘𝑥) = (𝐹𝑥))
2625iuneq2i 4961 . . 3 𝑥𝐴 ((𝐹𝐴)‘𝑥) = 𝑥𝐴 (𝐹𝑥)
2713, 24, 263eqtr3ri 2763 . 2 𝑥𝐴 (𝐹𝑥) = 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥)
28 df-ima 5627 . . 3 (𝐹𝐴) = ran (𝐹𝐴)
2928unieqi 4868 . 2 (𝐹𝐴) = ran (𝐹𝐴)
304, 27, 293eqtr4g 2791 1 (Fun 𝐹 𝑥𝐴 (𝐹𝑥) = (𝐹𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1541  wcel 2111  cdif 3894  cun 3895  cin 3896  wss 3897  c0 4280   cuni 4856   ciun 4939  dom cdm 5614  ran crn 5615  cres 5616  cima 5617  Fun wfun 6475   Fn wfn 6476  cfv 6481
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pr 5368
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4281  df-if 4473  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-iun 4941  df-br 5090  df-opab 5152  df-mpt 5171  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-iota 6437  df-fun 6483  df-fn 6484  df-fv 6489
This theorem is referenced by:  funiunfvf  7183  eluniima  7184  marypha2lem4  9322  r1limg  9664  r1elssi  9698  r1elss  9699  ackbij2  10133  r1om  10134  ttukeylem6  10405  isacs2  17559  mreacs  17564  acsfn  17565  isacs5  18454  dprdss  19943  dprd2dlem1  19955  dmdprdsplit2lem  19959  uniioombllem3a  25512  uniioombllem4  25514  uniioombllem5  25515  dyadmbl  25528  oldlim  27832  precsexlem10  28154  precsexlem11  28155  r1omfv  35121  mblfinlem1  37696  ovoliunnfl  37701  voliunnfl  37703  uniimafveqt  47480  imasetpreimafvbijlemfv  47501
  Copyright terms: Public domain W3C validator