| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > intunsn | Structured version Visualization version GIF version | ||
| Description: Theorem joining a singleton to an intersection. (Contributed by NM, 29-Sep-2002.) |
| Ref | Expression |
|---|---|
| intunsn.1 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| intunsn | ⊢ ∩ (𝐴 ∪ {𝐵}) = (∩ 𝐴 ∩ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | intun 4937 | . 2 ⊢ ∩ (𝐴 ∪ {𝐵}) = (∩ 𝐴 ∩ ∩ {𝐵}) | |
| 2 | intunsn.1 | . . . 4 ⊢ 𝐵 ∈ V | |
| 3 | 2 | intsn 4941 | . . 3 ⊢ ∩ {𝐵} = 𝐵 |
| 4 | 3 | ineq2i 4171 | . 2 ⊢ (∩ 𝐴 ∩ ∩ {𝐵}) = (∩ 𝐴 ∩ 𝐵) |
| 5 | 1, 4 | eqtri 2760 | 1 ⊢ ∩ (𝐴 ∪ {𝐵}) = (∩ 𝐴 ∩ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∈ wcel 2114 Vcvv 3442 ∪ cun 3901 ∩ cin 3902 {csn 4582 ∩ cint 4904 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-un 3908 df-in 3910 df-sn 4583 df-pr 4585 df-int 4905 |
| This theorem is referenced by: fiint 9239 incexclem 15771 heibor1lem 38054 |
| Copyright terms: Public domain | W3C validator |