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

Theorem funiunfv 6410
 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 5843 . . . 4 (Fun 𝐹 → Fun (𝐹𝐴))
2 funfn 5833 . . . 4 (Fun (𝐹𝐴) ↔ (𝐹𝐴) Fn dom (𝐹𝐴))
31, 2sylib 207 . . 3 (Fun 𝐹 → (𝐹𝐴) Fn dom (𝐹𝐴))
4 fniunfv 6409 . . 3 ((𝐹𝐴) Fn dom (𝐹𝐴) → 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) = ran (𝐹𝐴))
53, 4syl 17 . 2 (Fun 𝐹 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) = ran (𝐹𝐴))
6 undif2 3996 . . . . 5 (dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴))) = (dom (𝐹𝐴) ∪ 𝐴)
7 dmres 5339 . . . . . . 7 dom (𝐹𝐴) = (𝐴 ∩ dom 𝐹)
8 inss1 3795 . . . . . . 7 (𝐴 ∩ dom 𝐹) ⊆ 𝐴
97, 8eqsstri 3598 . . . . . 6 dom (𝐹𝐴) ⊆ 𝐴
10 ssequn1 3745 . . . . . 6 (dom (𝐹𝐴) ⊆ 𝐴 ↔ (dom (𝐹𝐴) ∪ 𝐴) = 𝐴)
119, 10mpbi 219 . . . . 5 (dom (𝐹𝐴) ∪ 𝐴) = 𝐴
126, 11eqtri 2632 . . . 4 (dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴))) = 𝐴
13 iuneq1 4470 . . . 4 ((dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴))) = 𝐴 𝑥 ∈ (dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴)))((𝐹𝐴)‘𝑥) = 𝑥𝐴 ((𝐹𝐴)‘𝑥))
1412, 13ax-mp 5 . . 3 𝑥 ∈ (dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴)))((𝐹𝐴)‘𝑥) = 𝑥𝐴 ((𝐹𝐴)‘𝑥)
15 iunxun 4541 . . . 4 𝑥 ∈ (dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴)))((𝐹𝐴)‘𝑥) = ( 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))((𝐹𝐴)‘𝑥))
16 eldifn 3695 . . . . . . . . 9 (𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴)) → ¬ 𝑥 ∈ dom (𝐹𝐴))
17 ndmfv 6128 . . . . . . . . 9 𝑥 ∈ dom (𝐹𝐴) → ((𝐹𝐴)‘𝑥) = ∅)
1816, 17syl 17 . . . . . . . 8 (𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴)) → ((𝐹𝐴)‘𝑥) = ∅)
1918iuneq2i 4475 . . . . . . 7 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))((𝐹𝐴)‘𝑥) = 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))∅
20 iun0 4512 . . . . . . 7 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))∅ = ∅
2119, 20eqtri 2632 . . . . . 6 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))((𝐹𝐴)‘𝑥) = ∅
2221uneq2i 3726 . . . . 5 ( 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))((𝐹𝐴)‘𝑥)) = ( 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) ∪ ∅)
23 un0 3919 . . . . 5 ( 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) ∪ ∅) = 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥)
2422, 23eqtri 2632 . . . 4 ( 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥) ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹𝐴))((𝐹𝐴)‘𝑥)) = 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥)
2515, 24eqtri 2632 . . 3 𝑥 ∈ (dom (𝐹𝐴) ∪ (𝐴 ∖ dom (𝐹𝐴)))((𝐹𝐴)‘𝑥) = 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥)
26 fvres 6117 . . . 4 (𝑥𝐴 → ((𝐹𝐴)‘𝑥) = (𝐹𝑥))
2726iuneq2i 4475 . . 3 𝑥𝐴 ((𝐹𝐴)‘𝑥) = 𝑥𝐴 (𝐹𝑥)
2814, 25, 273eqtr3ri 2641 . 2 𝑥𝐴 (𝐹𝑥) = 𝑥 ∈ dom (𝐹𝐴)((𝐹𝐴)‘𝑥)
29 df-ima 5051 . . 3 (𝐹𝐴) = ran (𝐹𝐴)
3029unieqi 4381 . 2 (𝐹𝐴) = ran (𝐹𝐴)
315, 28, 303eqtr4g 2669 1 (Fun 𝐹 𝑥𝐴 (𝐹𝑥) = (𝐹𝐴))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   = wceq 1475   ∈ wcel 1977   ∖ cdif 3537   ∪ cun 3538   ∩ cin 3539   ⊆ wss 3540  ∅c0 3874  ∪ cuni 4372  ∪ ciun 4455  dom cdm 5038  ran crn 5039   ↾ cres 5040   “ cima 5041  Fun wfun 5798   Fn wfn 5799  ‘cfv 5804 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-fv 5812 This theorem is referenced by:  funiunfvf  6411  eluniima  6412  marypha2lem4  8227  r1limg  8517  r1elssi  8551  r1elss  8552  ackbij2  8948  r1om  8949  ttukeylem6  9219  isacs2  16137  mreacs  16142  acsfn  16143  isacs5  16995  dprdss  18251  dprd2dlem1  18263  dmdprdsplit2lem  18267  uniioombllem3a  23158  uniioombllem4  23160  uniioombllem5  23161  dyadmbl  23174  mblfinlem1  32616  ovoliunnfl  32621  voliunnfl  32623
 Copyright terms: Public domain W3C validator