| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > exsnrex | GIF version | ||
| Description: There is a set being the element of a singleton if and only if there is an element of the singleton. (Contributed by Alexander van der Vekens, 1-Jan-2018.) |
| Ref | Expression |
|---|---|
| exsnrex | ⊢ (∃𝑥 𝑀 = {𝑥} ↔ ∃𝑥 ∈ 𝑀 𝑀 = {𝑥}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vex 2802 | . . . . . 6 ⊢ 𝑥 ∈ V | |
| 2 | 1 | snid 3697 | . . . . 5 ⊢ 𝑥 ∈ {𝑥} |
| 3 | eleq2 2293 | . . . . 5 ⊢ (𝑀 = {𝑥} → (𝑥 ∈ 𝑀 ↔ 𝑥 ∈ {𝑥})) | |
| 4 | 2, 3 | mpbiri 168 | . . . 4 ⊢ (𝑀 = {𝑥} → 𝑥 ∈ 𝑀) |
| 5 | 4 | pm4.71ri 392 | . . 3 ⊢ (𝑀 = {𝑥} ↔ (𝑥 ∈ 𝑀 ∧ 𝑀 = {𝑥})) |
| 6 | 5 | exbii 1651 | . 2 ⊢ (∃𝑥 𝑀 = {𝑥} ↔ ∃𝑥(𝑥 ∈ 𝑀 ∧ 𝑀 = {𝑥})) |
| 7 | df-rex 2514 | . 2 ⊢ (∃𝑥 ∈ 𝑀 𝑀 = {𝑥} ↔ ∃𝑥(𝑥 ∈ 𝑀 ∧ 𝑀 = {𝑥})) | |
| 8 | 6, 7 | bitr4i 187 | 1 ⊢ (∃𝑥 𝑀 = {𝑥} ↔ ∃𝑥 ∈ 𝑀 𝑀 = {𝑥}) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 = wceq 1395 ∃wex 1538 ∈ wcel 2200 ∃wrex 2509 {csn 3666 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-rex 2514 df-v 2801 df-sn 3672 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |