Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iineq2d | Structured version Visualization version GIF version |
Description: Equality deduction for indexed intersection. (Contributed by NM, 7-Dec-2011.) |
Ref | Expression |
---|---|
iineq2d.1 | ⊢ Ⅎ𝑥𝜑 |
iineq2d.2 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐶) |
Ref | Expression |
---|---|
iineq2d | ⊢ (𝜑 → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ 𝐴 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iineq2d.1 | . . 3 ⊢ Ⅎ𝑥𝜑 | |
2 | iineq2d.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐶) | |
3 | 2 | ex 415 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝐵 = 𝐶)) |
4 | 1, 3 | ralrimi 3216 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶) |
5 | iineq2 4939 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ 𝐴 𝐶) | |
6 | 4, 5 | syl 17 | 1 ⊢ (𝜑 → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑥 ∈ 𝐴 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 Ⅎwnf 1784 ∈ wcel 2114 ∀wral 3138 ∩ ciin 4920 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-ral 3143 df-iin 4922 |
This theorem is referenced by: iineq2dv 4944 pmapglbx 36920 smflimmpt 43104 smfsupmpt 43109 smfinfmpt 43113 smflimsuplem4 43117 smflimsupmpt 43123 smfliminfmpt 43126 |
Copyright terms: Public domain | W3C validator |