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

Theorem fniinfv 6986
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 6921 . . 3 (𝐹‘𝑥) ∈ V
21dfiin2 4994 . 2 ∩ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}
3 fnrnfv 6967 . . 3 (𝐹 Fn 𝐴 → ran 𝐹 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})
43inteqd 4915 . 2 (𝐹 Fn 𝐴 → ∩ ran 𝐹 = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})
52, 4eqtr4id 2817 1 (𝐹 Fn 𝐴 → ∩ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∩ ran 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570  {cab 2741  ∃wrex 3090  ∩ cint 4910  ∩ ciin 4955  ran crn 5656   Fn wfn 6553  ‘cfv 6558
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-int 4911  df-iin 4957  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-iota 6512  df-fun 6560  df-fn 6561  df-fv 6566
This theorem is used by:  firest  17632  pnrmopn  23691  txtube  23989  bcth3  25682  diaintclN  42307  dibintclN  42416  dihintcl  42593  imaiinfv  43897
  Copyright terms: Public domain W3C validator