| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > intsn | Structured version Visualization version GIF version | ||
| Description: The intersection of a singleton is its member. Theorem 70 of [Suppes] p. 41. (Contributed by NM, 29-Sep-2002.) |
| Ref | Expression |
|---|---|
| intsn.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| intsn | ⊢ ∩ {𝐴} = 𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | intsn.1 | . 2 ⊢ 𝐴 ∈ V | |
| 2 | intsng 4946 | . 2 ⊢ (𝐴 ∈ V → ∩ {𝐴} = 𝐴) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ ∩ {𝐴} = 𝐴 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2145 Vcvv 3453 {csn 4587 ∩ 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: uniintsn 4948 intunsn 4950 op1stb 5451 op2ndb 6227 ssfii 9392 cf0 10255 cflecard 10257 uffix 24148 iotain 45228 |
| Copyright terms: Public domain | W3C validator |