![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > iineq1 | Structured version Visualization version GIF version |
Description: Equality theorem for indexed intersection. (Contributed by NM, 27-Jun-1998.) |
Ref | Expression |
---|---|
iineq1 | ⊢ (𝐴 = 𝐵 → ∩ 𝑥 ∈ 𝐴 𝐶 = ∩ 𝑥 ∈ 𝐵 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | raleq 3321 | . . 3 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝐶)) | |
2 | 1 | abbidv 2806 | . 2 ⊢ (𝐴 = 𝐵 → {𝑦 ∣ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶} = {𝑦 ∣ ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝐶}) |
3 | df-iin 4999 | . 2 ⊢ ∩ 𝑥 ∈ 𝐴 𝐶 = {𝑦 ∣ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶} | |
4 | df-iin 4999 | . 2 ⊢ ∩ 𝑥 ∈ 𝐵 𝐶 = {𝑦 ∣ ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝐶} | |
5 | 2, 3, 4 | 3eqtr4g 2800 | 1 ⊢ (𝐴 = 𝐵 → ∩ 𝑥 ∈ 𝐴 𝐶 = ∩ 𝑥 ∈ 𝐵 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2106 {cab 2712 ∀wral 3059 ∩ ciin 4997 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-9 2116 ax-ext 2706 |
This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1777 df-sb 2063 df-clab 2713 df-cleq 2727 df-ral 3060 df-rex 3069 df-iin 4999 |
This theorem is referenced by: iinrab2 5075 iinvdif 5085 riin0 5087 iin0 5368 xpriindi 5850 cmpfi 23432 ptbasfi 23605 fclsval 24032 taylfval 26415 polvalN 39888 iineq1d 45030 |
Copyright terms: Public domain | W3C validator |