HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem fniunfv 3860
Description: The indexed union of a function's values is the union of its range.
Assertion
Ref Expression
fniunfv |- (F Fn A -> U_x e. A (F` x) = U.ran F)
Distinct variable groups:   x,A   x,F

Proof of Theorem fniunfv
StepHypRef Expression
1 fnrnfv 3754 . . 3 |- (F Fn A -> ran F = {y | E.x e. A y = (F` x)})
21unieqd 2508 . 2 |- (F Fn A -> U.ran F = U.{y | E.x e. A y = (F` x)})
3 fvex 3727 . . 3 |- (F` x) e. V
43dfiun2 2583 . 2 |- U_x e. A (F` x) = U.{y | E.x e. A y = (F` x)}
52, 4syl6reqr 1524 1 |- (F Fn A -> U_x e. A (F` x) = U.ran F)
Colors of variables: wff set class
Syntax hints:   -> wi 3   = wceq 955  {cab 1462  E.wrex 1644  U.cuni 2499  U_ciun 2562  ran crn 3167   Fn wfn 3173  ` cfv 3178
This theorem is referenced by:  funiunfv 3861  unir1 4650  ubthlem6 8493
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 961  ax-gen 962  ax-8 963  ax-10 965  ax-11 966  ax-12 967  ax-13 968  ax-14 969  ax-17 970  ax-4 972  ax-5o 974  ax-6o 977  ax-9o 1122  ax-10o 1139  ax-16 1209  ax-11o 1217  ax-ext 1458  ax-sep 2699  ax-pow 2738  ax-pr 2775  ax-un 2862
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 980  df-sb 1171  df-eu 1381  df-mo 1382  df-clab 1463  df-cleq 1468  df-clel 1471  df-ne 1585  df-ral 1647  df-rex 1648  df-v 1809  df-dif 2046  df-un 2047  df-in 2048  df-ss 2050  df-nul 2278  df-pw 2399  df-sn 2409  df-pr 2410  df-op 2413  df-uni 2500  df-iun 2564  df-br 2616  df-opab 2663  df-id 2831  df-xp 3180  df-cnv 3182  df-co 3183  df-dm 3184  df-rn 3185  df-res 3186  df-ima 3187  df-fun 3188  df-fn 3189  df-fv 3194
Copyright terms: Public domain