| 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 4976 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ 𝐴 𝐶) | |
| 4 | 2, 3 | syl 18 | 1 ⊢ (𝜑 → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ 𝐴 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 400 = wceq 1569 ∈ wcel 2142 ∀wral 3078 ∩ ciin 4956 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-iin 4958 |
| This theorem is used by: cntziinsn 19413 ptbasfi 23749 fclsval 24176 taylfval 26533 polfvalN 40706 dihglblem3N 42097 dihmeetlem2N 42101 iineq12dv 45852 iccvonmbllem 47420 vonicclem2 47426 smflimlem3 47515 smflimlem4 47516 smflimlem6 47518 smflimsuplem3 47564 intxp 49638 iinfssclem1 49860 |
| Copyright terms: Public domain | W3C validator |