Theorem fniinfv 6966

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.

Step	Hyp	Ref	Expression
1		fvex 6901	. . 3 ⊢ (𝐹‘𝑥) ∈ V
2	1	dfiin2 5002	. 2 ⊢ ∩ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}
3		fnrnfv 6947	. . 3 ⊢ (𝐹 Fn 𝐴 → ran 𝐹 = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})
4	3	inteqd 4922	. 2 ⊢ (𝐹 Fn 𝐴 → ∩ ran 𝐹 = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})
5	2, 4	eqtr4id 2820	1 ⊢ (𝐹 Fn 𝐴 → ∩ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∩ ran 𝐹)

This proof depends on syntax axioms:   → wi 4   = wceq 1570  {cab 2744  ∃wrex 3092  ∩ cint 4917  ∩ ciin 4962  ran crn 5667   Fn wfn 6538  ‘cfv 6543

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409

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 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-int 4918  df-iin 4964  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-iota 6499  df-fun 6545  df-fn 6546  df-fv 6551

This theorem is used by:  firest  17510  pnrmopn  23537  txtube  23834  bcth3  25527  diaintclN  41872  dibintclN  41981  dihintcl  42158  imaiinfv  43464