| 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 | iuneq2dv.1 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐶) | |
| 2 | 1 | ralrimiva 3156 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶) |
| 3 | iineq2 4975 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ 𝐴 𝐶) | |
| 4 | 2, 3 | syl 18 | 1 ⊢ (𝜑 → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ 𝐴 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3078 ∩ ciin 4955 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1813 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-iin 4957 |
| This theorem is used by: cntziinsn 19465 ptbasfi 23808 fclsval 24235 taylfval 26592 polfvalN 40764 dihglblem3N 42155 dihmeetlem2N 42159 iineq12dv 45925 iccvonmbllem 47493 vonicclem2 47499 smflimlem3 47588 smflimlem4 47589 smflimlem6 47591 smflimsuplem3 47637 intxp 49747 iinfssclem1 49967 |
| Copyright terms: Public domain | W3C validator |