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

Theorem funiunfv 7252
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 6582 . . . 4 (Fun 𝐹 → Fun (𝐹 ↾ 𝐴))
21funfnd 6571 . . 3 (Fun 𝐹 → (𝐹 ↾ 𝐴) Fn dom (𝐹 ↾ 𝐴))
3 fniunfv 7251 . . 3 ((𝐹 ↾ 𝐴) Fn dom (𝐹 ↾ 𝐴) → ∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥) = ∪ ran (𝐹 ↾ 𝐴))
42, 3syl 18 . 2 (Fun 𝐹 → ∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥) = ∪ ran (𝐹 ↾ 𝐴))
5 undif2 4430 . . . . 5 (dom (𝐹 ↾ 𝐴) ∪ (𝐴 ∖ dom (𝐹 ↾ 𝐴))) = (dom (𝐹 ↾ 𝐴) ∪ 𝐴)
6 dmres 6002 . . . . . . 7 dom (𝐹 ↾ 𝐴) = (𝐴 ∩ dom 𝐹)
7 inss1 4133 . . . . . . 7 (𝐴 ∩ dom 𝐹) ⊆ 𝐴
86, 7eqsstri 3954 . . . . . 6 dom (𝐹 ↾ 𝐴) ⊆ 𝐴
9 ssequn1 4184 . . . . . 6 (dom (𝐹 ↾ 𝐴) ⊆ 𝐴 ↔ (dom (𝐹 ↾ 𝐴) ∪ 𝐴) = 𝐴)
108, 9mpbi 233 . . . . 5 (dom (𝐹 ↾ 𝐴) ∪ 𝐴) = 𝐴
115, 10eqtri 2783 . . . 4 (dom (𝐹 ↾ 𝐴) ∪ (𝐴 ∖ dom (𝐹 ↾ 𝐴))) = 𝐴
12 iuneq1 4967 . . . 4 ((dom (𝐹 ↾ 𝐴) ∪ (𝐴 ∖ dom (𝐹 ↾ 𝐴))) = 𝐴 → ∪ 𝑥 ∈ (dom (𝐹 ↾ 𝐴) ∪ (𝐴 ∖ dom (𝐹 ↾ 𝐴)))((𝐹 ↾ 𝐴)‘𝑥) = ∪ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐴)‘𝑥))
1311, 12ax-mp 5 . . 3 ∪ 𝑥 ∈ (dom (𝐹 ↾ 𝐴) ∪ (𝐴 ∖ dom (𝐹 ↾ 𝐴)))((𝐹 ↾ 𝐴)‘𝑥) = ∪ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐴)‘𝑥)
14 iunxun 5053 . . . 4 ∪ 𝑥 ∈ (dom (𝐹 ↾ 𝐴) ∪ (𝐴 ∖ dom (𝐹 ↾ 𝐴)))((𝐹 ↾ 𝐴)‘𝑥) = (∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥) ∪ ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹 ↾ 𝐴))((𝐹 ↾ 𝐴)‘𝑥))
15 eldifn 4068 . . . . . . . . 9 (𝑥 ∈ (𝐴 ∖ dom (𝐹 ↾ 𝐴)) → ¬ 𝑥 ∈ dom (𝐹 ↾ 𝐴))
16 ndmfv 6917 . . . . . . . . 9 (¬ 𝑥 ∈ dom (𝐹 ↾ 𝐴) → ((𝐹 ↾ 𝐴)‘𝑥) = ∅)
1715, 16syl 18 . . . . . . . 8 (𝑥 ∈ (𝐴 ∖ dom (𝐹 ↾ 𝐴)) → ((𝐹 ↾ 𝐴)‘𝑥) = ∅)
1817iuneq2i 4972 . . . . . . 7 ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹 ↾ 𝐴))((𝐹 ↾ 𝐴)‘𝑥) = ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹 ↾ 𝐴))∅
19 iun0 5019 . . . . . . 7 ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹 ↾ 𝐴))∅ = ∅
2018, 19eqtri 2783 . . . . . 6 ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹 ↾ 𝐴))((𝐹 ↾ 𝐴)‘𝑥) = ∅
2120uneq2i 4164 . . . . 5 (∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥) ∪ ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹 ↾ 𝐴))((𝐹 ↾ 𝐴)‘𝑥)) = (∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥) ∪ ∅)
22 un0 4343 . . . . 5 (∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥) ∪ ∅) = ∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥)
2321, 22eqtri 2783 . . . 4 (∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥) ∪ ∪ 𝑥 ∈ (𝐴 ∖ dom (𝐹 ↾ 𝐴))((𝐹 ↾ 𝐴)‘𝑥)) = ∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥)
2414, 23eqtri 2783 . . 3 ∪ 𝑥 ∈ (dom (𝐹 ↾ 𝐴) ∪ (𝐴 ∖ dom (𝐹 ↾ 𝐴)))((𝐹 ↾ 𝐴)‘𝑥) = ∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥)
25 fvres 6904 . . . 4 (𝑥 ∈ 𝐴 → ((𝐹 ↾ 𝐴)‘𝑥) = (𝐹‘𝑥))
2625iuneq2i 4972 . . 3 ∪ 𝑥 ∈ 𝐴 ((𝐹 ↾ 𝐴)‘𝑥) = ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥)
2713, 24, 263eqtr3ri 2792 . 2 ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∪ 𝑥 ∈ dom (𝐹 ↾ 𝐴)((𝐹 ↾ 𝐴)‘𝑥)
28 df-ima 5663 . . 3 (𝐹 “ 𝐴) = ran (𝐹 ↾ 𝐴)
2928unieqi 4878 . 2 ∪ (𝐹 “ 𝐴) = ∪ ran (𝐹 ↾ 𝐴)
304, 27, 293eqtr4g 2820 1 (Fun 𝐹 → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∪ (𝐹 “ 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   = wceq 1569   ∈ wcel 2144   ⊆ wss 3895   ∖ cdif 4045   ∩ cin 4089   ∪ cun 4149  ∅c0 4278  ∪ cuni 4866  ∪ ciun 4950  dom cdm 5650  ran crn 5651   ↾ cres 5652   “ cima 5653  Fun wfun 6532   Fn wfn 6533  ‘cfv 6538
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-fv 6546
This theorem is used by:  funiunfvf  7253  eluniima  7254  marypha2lem4  9430  r1limg  9778  r1elssi  9813  r1elss  9814  jech9.3  9822  dfhf2  9906  ackbij2  10320  ttukeylem6  10592  isacs2  17827  mreacs  17832  acsfn  17833  isacs5  18722  dprdss  20245  dprd2dlem1  20257  dmdprdsplit2lem  20261  uniioombllem3a  25905  uniioombllem4  25907  uniioombllem5  25908  dyadmbl  25921  oldlim  28273  precsexlem10  28602  precsexlem11  28603  ttcmin  37284  dfttc2g  37294  mblfinlem1  38576  ovoliunnfl  38581  voliunnfl  38583  uniimafveqt  48463  imasetpreimafvbijlemfv  48484
  Copyright terms: Public domain W3C validator