| 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 4169 | . 2 ⊢ (∩ 𝐴 ∩ ∩ {𝐵}) = (∩ 𝐴 ∩ 𝐵) |
| 5 | 1, 4 | eqtri 2784 | 1 ⊢ ∩ (𝐴 ∪ {𝐵}) = (∩ 𝐴 ∩ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1559 ∈ wcel 2141 Vcvv 3453 ∪ cun 3902 ∩ cin 3903 {csn 4581 ∩ cint 4904 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1562 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-un 3909 df-in 3911 df-sn 4582 df-pr 4584 df-int 4905 |
| This theorem is referenced by: fiint 9267 incexclem 15849 heibor1lem 38272 |
| Copyright terms: Public domain | W3C validator |