![]() |
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 1910 | . 2 ⊢ Ⅎ𝑥𝜑 | |
2 | iuneq2dv.1 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐶) | |
3 | 1, 2 | iineq2d 5014 | 1 ⊢ (𝜑 → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ 𝐴 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1534 ∈ wcel 2099 ∩ ciin 4992 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-12 2167 ax-ext 2699 |
This theorem depends on definitions: df-bi 206 df-an 396 df-ex 1775 df-nf 1779 df-sb 2061 df-clab 2706 df-cleq 2720 df-clel 2806 df-ral 3058 df-iin 4994 |
This theorem is referenced by: cntziinsn 19281 ptbasfi 23478 fclsval 23905 taylfval 26286 polfvalN 39371 dihglblem3N 40762 dihmeetlem2N 40766 iineq12dv 44466 iccvonmbllem 46060 vonicclem2 46066 smflimlem3 46155 smflimlem4 46156 smflimlem6 46158 smflimsuplem3 46204 |
Copyright terms: Public domain | W3C validator |