Theorem intimafv 31932

Description: The intersection of an image set, as an indexed intersection of function values. (Contributed by Thierry Arnoux, 15-Jun-2024.)

Assertion

Ref	Expression
intimafv	⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → ∩ (𝐹 “ 𝐴) = ∩ 𝑥 ∈ 𝐴 (𝐹‘𝑥))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐹

Proof of Theorem intimafv

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfimafn 6955	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦})
2	1	inteqd 4956	. 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → ∩ (𝐹 “ 𝐴) = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦})
3		fvex 6905	. . . . 5 ⊢ (𝐹‘𝑥) ∈ V
4	3	rgenw 3066	. . . 4 ⊢ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ V
5		iinabrex 31800	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ V → ∩ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})
6	4, 5	ax-mp 5	. . 3 ⊢ ∩ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}
7		eqcom 2740	. . . . . 6 ⊢ ((𝐹‘𝑥) = 𝑦 ↔ 𝑦 = (𝐹‘𝑥))
8	7	rexbii 3095	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 ↔ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
9	8	abbii 2803	. . . 4 ⊢ {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}
10	9	inteqi 4955	. . 3 ⊢ ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦} = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}
11	6, 10	eqtr4i 2764	. 2 ⊢ ∩ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦}
12	2, 11	eqtr4di 2791	1 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → ∩ (𝐹 “ 𝐴) = ∩ 𝑥 ∈ 𝐴 (𝐹‘𝑥))

Syntax hints:   → wi 4   ∧ wa 397   = wceq 1542   ∈ wcel 2107  {cab 2710  ∀wral 3062  ∃wrex 3071  Vcvv 3475   ⊆ wss 3949  ∩ cint 4951  ∩ ciin 4999  dom cdm 5677   “ cima 5680  Fun wfun 6538  ‘cfv 6544

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pr 5428

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-int 4952  df-iin 5001  df-br 5150  df-opab 5212  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-iota 6496  df-fun 6546  df-fn 6547  df-fv 6552

This theorem is referenced by:  zarclsint  32852  zarcmplem  32861