Theorem iineq1 4976

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 3322	. . 3 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝐶))
2	1	abbidv 2831	. 2 ⊢ (𝐴 = 𝐵 → {𝑦 ∣ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶} = {𝑦 ∣ ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝐶})
3		df-iin 4961	. 2 ⊢ ∩ 𝑥 ∈ 𝐴 𝐶 = {𝑦 ∣ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶}
4		df-iin 4961	. 2 ⊢ ∩ 𝑥 ∈ 𝐵 𝐶 = {𝑦 ∣ ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝐶}
5	2, 3, 4	3eqtr4g 2825	1 ⊢ (𝐴 = 𝐵 → ∩ 𝑥 ∈ 𝐴 𝐶 = ∩ 𝑥 ∈ 𝐵 𝐶)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2146  {cab 2743  ∀wral 3081  ∩ ciin 4959

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-9 2156  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-ral 3082  df-rex 3092  df-iin 4961

This theorem is used by:  iinrab2  5036  iinvdif  5048  riin0  5050  iin0  5335  xpriindi  5824  cmpfi  23617  ptbasfi  23791  fclsval  24218  taylfval  26575  polvalN  40739  iineq1d  45868