Theorem iineq1 4978

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

Syntax hints:   → wi 4   = wceq 1567   ∈ wcel 2149  {cab 2747  ∀wral 3085  ∩ ciin 4961

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-9 2159  ax-ext 2741

This theorem depends on definitions:  df-bi 210  df-an 401  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-ral 3086  df-rex 3096  df-iin 4963

This theorem is referenced by:  iinrab2  5038  iinvdif  5050  riin0  5052  iin0  5334  xpriindi  5823  cmpfi  23533  ptbasfi  23706  fclsval  24133  taylfval  26487  polvalN  40568  iineq1d  45699