Theorem intimafv 33297

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 6945	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → (𝐹 “ 𝐴) = {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦})
2	1	inteqd 4912	. 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → ∩ (𝐹 “ 𝐴) = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦})
3		fvex 6896	. . . . 5 ⊢ (𝐹‘𝑥) ∈ V
4	3	rgenw 3081	. . . 4 ⊢ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ V
5		iinabrex 33156	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ V → ∩ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)})
6	4, 5	ax-mp 5	. . 3 ⊢ ∩ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}
7		eqcom 2768	. . . . . 6 ⊢ ((𝐹‘𝑥) = 𝑦 ↔ 𝑦 = (𝐹‘𝑥))
8	7	rexbii 3110	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 ↔ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
9	8	abbii 2828	. . . 4 ⊢ {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}
10	9	inteqi 4911	. . 3 ⊢ ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦} = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)}
11	6, 10	eqtr4i 2787	. 2 ⊢ ∩ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∩ {𝑦 ∣ ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦}
12	2, 11	eqtr4di 2814	1 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ dom 𝐹) → ∩ (𝐹 “ 𝐴) = ∩ 𝑥 ∈ 𝐴 (𝐹‘𝑥))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2739  ∀wral 3077  ∃wrex 3087  Vcvv 3451   ⊆ wss 3899  ∩ cint 4907  ∩ ciin 4952  dom cdm 5651   “ cima 5654  Fun wfun 6531  ‘cfv 6537

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iin 4954  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-fv 6545

This theorem is used by:  zarclsint  34497  zarcmplem  34506