| 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 4597 | . . 3 ⊢ {𝐴} = {𝐴, 𝐴} | |
| 2 | 1 | inteqi 4914 | . 2 ⊢ ∩ {𝐴} = ∩ {𝐴, 𝐴} |
| 3 | intprg 4944 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ∈ 𝑉) → ∩ {𝐴, 𝐴} = (𝐴 ∩ 𝐴)) | |
| 4 | 3 | anidms 577 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ∩ {𝐴, 𝐴} = (𝐴 ∩ 𝐴)) |
| 5 | inidm 4126 | . . 3 ⊢ (𝐴 ∩ 𝐴) = 𝐴 | |
| 6 | 4, 5 | eqtrdi 2814 | . 2 ⊢ (𝐴 ∈ 𝑉 → ∩ {𝐴, 𝐴} = 𝐴) |
| 7 | 2, 6 | eqtrid 2810 | 1 ⊢ (𝐴 ∈ 𝑉 → ∩ {𝐴} = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ∩ cin 4092 {csn 4588 {cpr 4590 ∩ 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-v 3456 df-in 4094 df-un 4154 df-sn 4589 df-pr 4591 df-int 4911 |
| This theorem is used by: intsn 4947 riinint 5961 bj-snmoore 38225 bj-prmoore 38227 elrfi 43898 |
| Copyright terms: Public domain | W3C validator |