| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > intsng | Structured version Visualization version GIF version | ||
| Description: Intersection of a singleton. (Contributed by Stefan O'Rear, 22-Feb-2015.) |
| Ref | Expression |
|---|---|
| intsng | ⊢ (𝐴 ∈ 𝑉 → ∩ {𝐴} = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfsn2 4600 | . . 3 ⊢ {𝐴} = {𝐴, 𝐴} | |
| 2 | 1 | inteqi 4914 | . 2 ⊢ ∩ {𝐴} = ∩ {𝐴, 𝐴} |
| 3 | intprg 4944 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) → ∩ {𝐴, 𝐴} = (𝐴 ∩ 𝐴)) | |
| 4 | 3 | anidms 577 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ∩ {𝐴, 𝐴} = (𝐴 ∩ 𝐴)) |
| 5 | inidm 4175 | . . 3 ⊢ (𝐴 ∩ 𝐴) = 𝐴 | |
| 6 | 4, 5 | eqtrdi 2813 | . 2 ⊢ (𝐴 ∈ 𝑉 → ∩ {𝐴, 𝐴} = 𝐴) |
| 7 | 2, 6 | eqtrid 2809 | 1 ⊢ (𝐴 ∈ 𝑉 → ∩ {𝐴} = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ∩ cin 3901 {csn 4587 {cpr 4589 ∩ cint 4910 |
| 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-or 862 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-rex 3089 df-v 3455 df-un 3907 df-in 3909 df-sn 4588 df-pr 4590 df-int 4911 |
| This theorem is used by: intsn 4947 riinint 5960 bj-snmoore 37865 bj-prmoore 37867 elrfi 43541 |
| Copyright terms: Public domain | W3C validator |