| 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 3293 | . . 3 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶 ↔ ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝐶)) | |
| 2 | 1 | abbidv 2802 | . 2 ⊢ (𝐴 = 𝐵 → {𝑦 ∣ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶} = {𝑦 ∣ ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝐶}) |
| 3 | df-iin 4949 | . 2 ⊢ ∩ 𝑥 ∈ 𝐴 𝐶 = {𝑦 ∣ ∀𝑥 ∈ 𝐴 𝑦 ∈ 𝐶} | |
| 4 | df-iin 4949 | . 2 ⊢ ∩ 𝑥 ∈ 𝐵 𝐶 = {𝑦 ∣ ∀𝑥 ∈ 𝐵 𝑦 ∈ 𝐶} | |
| 5 | 2, 3, 4 | 3eqtr4g 2796 | 1 ⊢ (𝐴 = 𝐵 → ∩ 𝑥 ∈ 𝐴 𝐶 = ∩ 𝑥 ∈ 𝐵 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 {cab 2714 ∀wral 3051 ∩ ciin 4947 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-9 2123 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-ral 3052 df-rex 3061 df-iin 4949 |
| This theorem is referenced by: iinrab2 5025 iinvdif 5035 riin0 5037 iin0 5307 xpriindi 5785 cmpfi 23352 ptbasfi 23525 fclsval 23952 taylfval 26322 polvalN 40165 iineq1d 45334 |
| Copyright terms: Public domain | W3C validator |