| 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 4948 | . 2 ⊢ (𝐴 ∈ V → ∩ {𝐴} = 𝐴) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ ∩ {𝐴} = 𝐴 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: = wceq 1570 ∈ wcel 2147 Vcvv 3454 {csn 4588 ∩ cint 4912 |
| 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 4913 |
| This theorem is used by: uniintsn 4950 intunsn 4952 op1stb 5447 op2ndb 6247 iotain 6539 ssfii 9448 cf0 10367 cflecard 10369 uffix 24295 |
| Copyright terms: Public domain | W3C validator |