Theorem iineq1 4968

Description: Equality theorem for indexed intersection. (Contributed by NM, 27-Jun-1998.)

Assertion

Ref	Expression
iineq1	⊢ (𝐴 = 𝐵 → ∩ 𝑥 ∈ 𝐴 𝐶 = ∩ 𝑥 ∈ 𝐵 𝐶)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem iineq1

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		raleq 3316	. . 3 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝐶))
2	1	abbidv 2826	. 2 ⊢ (𝐴 = 𝐵 → {𝑦 ∣ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶} = {𝑦 ∣ ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝐶})
3		df-iin 4953	. 2 ⊢ ∩ 𝑥 ∈ 𝐴 𝐶 = {𝑦 ∣ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶}
4		df-iin 4953	. 2 ⊢ ∩ 𝑥 ∈ 𝐵 𝐶 = {𝑦 ∣ ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝐶}
5	2, 3, 4	3eqtr4g 2820	1 ⊢ (𝐴 = 𝐵 → ∩ 𝑥 ∈ 𝐴 𝐶 = ∩ 𝑥 ∈ 𝐵 𝐶)

This proof depends on syntax axioms:   → wi 4   = wceq 1569   ∈ wcel 2144  {cab 2738  ∀wral 3076  ∩ ciin 4951

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-ral 3077  df-rex 3087  df-iin 4953

This theorem is used by:  iinrab2  5027  iinvdif  5039  riin0  5041  iin0  5324  xpriindi  5814  cmpfi  23735  ptbasfi  23909  fclsval  24336  taylfval  26695  polvalN  41099  iineq1d  46241