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

Theorem fniinfv 6963
Description: The indexed intersection of a function's values is the intersection of its range. (Contributed by NM, 20-Oct-2005.)
Assertion
Ref Expression
fniinfv (𝐹 Fn 𝐴 → ∩ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∩ ran 𝐹)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹

Proof of Theorem fniinfv
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 fvex 6898 . . 3 (𝐹‘𝑥) ∈ V
21dfiin2 4990 . 2 ∩ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}
3 fnrnfv 6944 . . 3 (𝐹 Fn 𝐴 → ran 𝐹 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})
43inteqd 4911 . 2 (𝐹 Fn 𝐴 → ∩ ran 𝐹 = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})
52, 4eqtr4id 2814 1 (𝐹 Fn 𝐴 → ∩ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∩ ran 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569  {cab 2738  ∃wrex 3086  ∩ cint 4906  ∩ ciin 4951  ran crn 5651   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-int 4907  df-iin 4953  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-iota 6494  df-fun 6540  df-fn 6541  df-fv 6546
This theorem is used by:  firest  17604  pnrmopn  23662  txtube  23960  bcth3  25653  diaintclN  42191  dibintclN  42300  dihintcl  42477  imaiinfv  43780
  Copyright terms: Public domain W3C validator