Theorem iineq1 4938

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

Syntax hints:   → wi 4   = wceq 1539   ∈ wcel 2108  {cab 2715  ∀wral 3063  ∩ ciin 4922

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-9 2118  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 396  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-ral 3068  df-iin 4924

This theorem is referenced by:  iinrab2  4995  iinvdif  5005  riin0  5007  iin0  5279  xpriindi  5734  cmpfi  22467  ptbasfi  22640  fclsval  23067  taylfval  25423  polvalN  37846  iineq1d  42529