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

Theorem funiunfv 7272
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 6599 . . . 4 (Fun 𝐹 → Fun (𝐹 ↾ 𝐴))
21funfnd 6588 . . 3 (Fun 𝐹 → (𝐹 ↾ 𝐴) Fn dom (𝐹 ↾ 𝐴))
3 fniunfv 7271 . . 3 ((𝐹 ↾ 𝐴) Fn dom (𝐹 ↾ 𝐴) → ∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥) = ∪ ran (𝐹 ↾ 𝐴))
42, 3syl 18 . 2 (Fun 𝐹 → ∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥) = ∪ ran (𝐹 ↾ 𝐴))
5 undif2 4434 . . . . 5 (dom (𝐹 ↾ 𝐴) ∪ (𝐴 ∖ dom (𝐹 ↾ 𝐴))) = (dom (𝐹 ↾ 𝐴) ∪ 𝐴)
6 dmres 6014 . . . . . . 7 dom (𝐹 ↾ 𝐴) = (𝐴 ∩ dom 𝐹)
7 inss1 4136 . . . . . . 7 (𝐴 ∩ dom 𝐹) ⊆ 𝐴
86, 7eqsstri 3959 . . . . . 6 dom (𝐹 ↾ 𝐴) ⊆ 𝐴
9 ssequn1 4187 . . . . . 6 (dom (𝐹 ↾ 𝐴) ⊆ 𝐴 ↔ (dom (𝐹 ↾ 𝐴) ∪ 𝐴) = 𝐴)
108, 9mpbi 233 . . . . 5 (dom (𝐹 ↾ 𝐴) ∪ 𝐴) = 𝐴
115, 10eqtri 2786 . . . 4 (dom (𝐹 ↾ 𝐴) ∪ (𝐴 ∖ dom (𝐹 ↾ 𝐴))) = 𝐴
12 iuneq1 4971 . . . 4 ((dom (𝐹 ↾ 𝐴) ∪ (𝐴 ∖ dom (𝐹 ↾ 𝐴))) = 𝐴 → ∪ 𝑥 ∈ (dom (𝐹 ↾ 𝐴) ∪ (𝐴 ∖ dom (𝐹 ↾ 𝐴)))((𝐹 ↾ 𝐴)‘𝑥) = ∪ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐴)‘𝑥))
1311, 12ax-mp 5 . . 3 ∪ 𝑥 ∈ (dom (𝐹 ↾ 𝐴) ∪ (𝐴 ∖ dom (𝐹 ↾ 𝐴)))((𝐹 ↾ 𝐴)‘𝑥) = ∪ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐴)‘𝑥)
14 iunxun 5057 . . . 4 ∪ 𝑥 ∈ (dom (𝐹 ↾ 𝐴) ∪ (𝐴 ∖ dom (𝐹 ↾ 𝐴)))((𝐹 ↾ 𝐴)‘𝑥) = (∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥) ∪ ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹 ↾ 𝐴))((𝐹 ↾ 𝐴)‘𝑥))
15 eldifn 4071 . . . . . . . . 9 (𝑥 ∈ (𝐴 ∖ dom (𝐹 ↾ 𝐴)) → ¬ 𝑥 ∈ dom (𝐹 ↾ 𝐴))
16 ndmfv 6937 . . . . . . . . 9 (¬ 𝑥 ∈ dom (𝐹 ↾ 𝐴) → ((𝐹 ↾ 𝐴)‘𝑥) = ∅)
1715, 16syl 18 . . . . . . . 8 (𝑥 ∈ (𝐴 ∖ dom (𝐹 ↾ 𝐴)) → ((𝐹 ↾ 𝐴)‘𝑥) = ∅)
1817iuneq2i 4976 . . . . . . 7 ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹 ↾ 𝐴))((𝐹 ↾ 𝐴)‘𝑥) = ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹 ↾ 𝐴))∅
19 iun0 5023 . . . . . . 7 ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹 ↾ 𝐴))∅ = ∅
2018, 19eqtri 2786 . . . . . 6 ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹 ↾ 𝐴))((𝐹 ↾ 𝐴)‘𝑥) = ∅
2120uneq2i 4167 . . . . 5 (∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥) ∪ ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹 ↾ 𝐴))((𝐹 ↾ 𝐴)‘𝑥)) = (∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥) ∪ ∅)
22 un0 4347 . . . . 5 (∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥) ∪ ∅) = ∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥)
2321, 22eqtri 2786 . . . 4 (∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥) ∪ ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹 ↾ 𝐴))((𝐹 ↾ 𝐴)‘𝑥)) = ∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥)
2414, 23eqtri 2786 . . 3 ∪ 𝑥 ∈ (dom (𝐹 ↾ 𝐴) ∪ (𝐴 ∖ dom (𝐹 ↾ 𝐴)))((𝐹 ↾ 𝐴)‘𝑥) = ∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥)
25 fvres 6924 . . . 4 (𝑥 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝑥) = (𝐹‘𝑥))
2625iuneq2i 4976 . . 3 ∪ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐴)‘𝑥) = ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥)
2713, 24, 263eqtr3ri 2795 . 2 ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥)
28 df-ima 5668 . . 3 (𝐹 “ 𝐴) = ran (𝐹 ↾ 𝐴)
2928unieqi 4882 . 2 ∪ (𝐹 “ 𝐴) = ∪ ran (𝐹 ↾ 𝐴)
304, 27, 293eqtr4g 2823 1 (Fun 𝐹 → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∪ (𝐹 “ 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900   ∖ cdif 4048   ∩ cin 4092   ∪ cun 4152  ∅c0 4281  ∪ cuni 4870  ∪ ciun 4954  dom cdm 5655  ran crn 5656   ↾ cres 5657   “ cima 5658  Fun wfun 6549   Fn wfn 6550  ‘cfv 6555
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-fv 6563
This theorem is used by:  funiunfvf  7273  eluniima  7274  marypha2lem4  9454  r1limg  9802  r1elssi  9837  r1elss  9838  jech9.3  9846  dfhf2  9930  ackbij2  10344  ttukeylem6  10616  isacs2  17853  mreacs  17858  acsfn  17859  isacs5  18748  dprdss  20272  dprd2dlem1  20284  dmdprdsplit2lem  20288  uniioombllem3a  25932  uniioombllem4  25934  uniioombllem5  25935  dyadmbl  25948  oldlim  28300  precsexlem10  28629  precsexlem11  28630  ttcmin  37461  dfttc2g  37471  mblfinlem1  38766  ovoliunnfl  38771  voliunnfl  38773  uniimafveqt  48666  imasetpreimafvbijlemfv  48687
  Copyright terms: Public domain W3C validator