Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iineq2dv | Structured version Visualization version GIF version |
Description: Equality deduction for indexed intersection. (Contributed by NM, 3-Aug-2004.) |
Ref | Expression |
---|---|
iuneq2dv.1 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐶) |
Ref | Expression |
---|---|
iineq2dv | ⊢ (𝜑 → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ 𝐴 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1830 | . 2 ⊢ Ⅎ𝑥𝜑 | |
2 | iuneq2dv.1 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐶) | |
3 | 1, 2 | iineq2d 4477 | 1 ⊢ (𝜑 → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ 𝐴 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∩ ciin 4456 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-ral 2901 df-iin 4458 |
This theorem is referenced by: cntziinsn 17590 ptbasfi 21194 fclsval 21622 taylfval 23917 polfvalN 34208 dihglblem3N 35602 dihmeetlem2N 35606 iineq12dv 38319 saliincl 39221 iccvonmbllem 39569 vonicclem2 39575 smflimlem3 39659 smflimlem4 39660 smflimlem6 39662 |
Copyright terms: Public domain | W3C validator |