Theorem intimafv 33093

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 6950	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦})
2	1	inteqd 4922	. 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → ∩ (𝐹 “ 𝐴) = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦})
3		fvex 6901	. . . . 5 ⊢ (𝐹‘𝑥) ∈ V
4	3	rgenw 3086	. . . 4 ⊢ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ V
5		iinabrex 32951	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ V → ∩ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})
6	4, 5	ax-mp 5	. . 3 ⊢ ∩ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}
7		eqcom 2773	. . . . . 6 ⊢ ((𝐹‘𝑥) = 𝑦 ↔ 𝑦 = (𝐹‘𝑥))
8	7	rexbii 3115	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 ↔ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
9	8	abbii 2833	. . . 4 ⊢ {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}
10	9	inteqi 4921	. . 3 ⊢ ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦} = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}
11	6, 10	eqtr4i 2792	. 2 ⊢ ∩ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦}
12	2, 11	eqtr4di 2819	1 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → ∩ (𝐹 “ 𝐴) = ∩ 𝑥 ∈ 𝐴 (𝐹‘𝑥))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  {cab 2744  ∀wral 3082  ∃wrex 3092  Vcvv 3458   ⊆ wss 3908  ∩ cint 4917  ∩ ciin 4962  dom cdm 5666   “ cima 5669  Fun wfun 6537  ‘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-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-fv 6551

This theorem is used by:  zarclsint  34293  zarcmplem  34302