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

Theorem funiunfv 7196
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 6531 . . . 4 (Fun 𝐹 → Fun (𝐹𝐴))
21funfnd 6520 . . 3 (Fun 𝐹 → (𝐹𝐴) Fn dom (𝐹𝐴))
3 fniunfv 7195 . . 3 ((𝐹𝐴) Fn dom (𝐹𝐴) → 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) = ran (𝐹𝐴))
42, 3syl 17 . 2 (Fun 𝐹 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) = ran (𝐹𝐴))
5 undif2 4408 . . . . 5 (dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴))) = (dom (𝐹𝐴) ∪ 𝐴)
6 dmres 5971 . . . . . . 7 dom (𝐹𝐴) = (𝐴 ∩ dom 𝐹)
7 inss1 4168 . . . . . . 7 (𝐴 ∩ dom 𝐹) ⊆ 𝐴
86, 7eqsstri 3963 . . . . . 6 dom (𝐹𝐴) ⊆ 𝐴
9 ssequn1 4118 . . . . . 6 (dom (𝐹𝐴) ⊆ 𝐴 ↔ (dom (𝐹𝐴) ∪ 𝐴) = 𝐴)
108, 9mpbi 232 . . . . 5 (dom (𝐹𝐴) ∪ 𝐴) = 𝐴
115, 10eqtri 2764 . . . 4 (dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴))) = 𝐴
12 iuneq1 4941 . . . 4 ((dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴))) = 𝐴 𝑥 ∈ (dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴)))((𝐹𝐴)‘𝑥) = 𝑥𝐴 ((𝐹𝐴)‘𝑥))
1311, 12ax-mp 5 . . 3 𝑥 ∈ (dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴)))((𝐹𝐴)‘𝑥) = 𝑥𝐴 ((𝐹𝐴)‘𝑥)
14 iunxun 5026 . . . 4 𝑥 ∈ (dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴)))((𝐹𝐴)‘𝑥) = ( 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))((𝐹𝐴)‘𝑥))
15 eldifn 4065 . . . . . . . . 9 (𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴)) → ¬ 𝑥 ∈ dom (𝐹𝐴))
16 ndmfv 6863 . . . . . . . . 9 𝑥 ∈ dom (𝐹𝐴) → ((𝐹𝐴)‘𝑥) = ∅)
1715, 16syl 17 . . . . . . . 8 (𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴)) → ((𝐹𝐴)‘𝑥) = ∅)
1817iuneq2i 4946 . . . . . . 7 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))((𝐹𝐴)‘𝑥) = 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))∅
19 iun0 4994 . . . . . . 7 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))∅ = ∅
2018, 19eqtri 2764 . . . . . 6 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))((𝐹𝐴)‘𝑥) = ∅
2120uneq2i 4098 . . . . 5 ( 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))((𝐹𝐴)‘𝑥)) = ( 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) ∪ ∅)
22 un0 4325 . . . . 5 ( 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) ∪ ∅) = 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥)
2321, 22eqtri 2764 . . . 4 ( 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))((𝐹𝐴)‘𝑥)) = 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥)
2414, 23eqtri 2764 . . 3 𝑥 ∈ (dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴)))((𝐹𝐴)‘𝑥) = 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥)
25 fvres 6850 . . . 4 (𝑥𝐴 → ((𝐹𝐴)‘𝑥) = (𝐹𝑥))
2625iuneq2i 4946 . . 3 𝑥𝐴 ((𝐹𝐴)‘𝑥) = 𝑥𝐴 (𝐹𝑥)
2713, 24, 263eqtr3ri 2773 . 2 𝑥𝐴 (𝐹𝑥) = 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥)
28 df-ima 5634 . . 3 (𝐹𝐴) = ran (𝐹𝐴)
2928unieqi 4853 . 2 (𝐹𝐴) = ran (𝐹𝐴)
304, 27, 293eqtr4g 2801 1 (Fun 𝐹 𝑥𝐴 (𝐹𝑥) = (𝐹𝐴))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1548  wcel 2121  cdif 3882  cun 3883  cin 3884  wss 3885  c0 4264   cuni 4841   ciun 4924  dom cdm 5621  ran crn 5622  cres 5623  cima 5624  Fun wfun 6483   Fn wfn 6484  cfv 6489
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-sep 5221  ax-nul 5231  ax-pr 5365
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4265  df-if 4458  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-iun 4926  df-br 5076  df-opab 5138  df-mpt 5157  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-iota 6445  df-fun 6491  df-fn 6492  df-fv 6497
This theorem is referenced by:  funiunfvf  7197  eluniima  7198  marypha2lem4  9345  r1limg  9690  r1elssi  9724  r1elss  9725  ackbij2  10159  r1om  10160  ttukeylem6  10431  isacs2  17614  mreacs  17619  acsfn  17620  isacs5  18509  dprdss  20001  dprd2dlem1  20013  dmdprdsplit2lem  20017  uniioombllem3a  25573  uniioombllem4  25575  uniioombllem5  25576  dyadmbl  25589  oldlim  27901  precsexlem10  28230  precsexlem11  28231  r1omfv  35306  ttcmin  36739  dfttc2g  36749  mblfinlem1  38039  ovoliunnfl  38044  voliunnfl  38046  uniimafveqt  47870  imasetpreimafvbijlemfv  47891
  Copyright terms: Public domain W3C validator