| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rext | Structured version Visualization version GIF version | ||
| Description: A theorem similar to extensionality, requiring the existence of a singleton. Exercise 8 of [TakeutiZaring] p. 16. (Contributed by NM, 10-Aug-1993.) |
| Ref | Expression |
|---|---|
| rext | ⊢ (∀𝑧(𝑥 ∈ 𝑧 → 𝑦 ∈ 𝑧) → 𝑥 = 𝑦) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vsnid 4623 | . . 3 ⊢ 𝑥 ∈ {𝑥} | |
| 2 | vsnex 5396 | . . . 4 ⊢ {𝑥} ∈ V | |
| 3 | eleq2 2852 | . . . . 5 ⊢ (𝑧 = {𝑥} → (𝑥 ∈ 𝑧 ↔ 𝑥 ∈ {𝑥})) | |
| 4 | eleq2 2852 | . . . . 5 ⊢ (𝑧 = {𝑥} → (𝑦 ∈ 𝑧 ↔ 𝑦 ∈ {𝑥})) | |
| 5 | 3, 4 | imbi12d 347 | . . . 4 ⊢ (𝑧 = {𝑥} → ((𝑥 ∈ 𝑧 → 𝑦 ∈ 𝑧) ↔ (𝑥 ∈ {𝑥} → 𝑦 ∈ {𝑥}))) |
| 6 | 2, 5 | spcv 3562 | . . 3 ⊢ (∀𝑧(𝑥 ∈ 𝑧 → 𝑦 ∈ 𝑧) → (𝑥 ∈ {𝑥} → 𝑦 ∈ {𝑥})) |
| 7 | 1, 6 | mpi 21 | . 2 ⊢ (∀𝑧(𝑥 ∈ 𝑧 → 𝑦 ∈ 𝑧) → 𝑦 ∈ {𝑥}) |
| 8 | velsn 4599 | . . 3 ⊢ (𝑦 ∈ {𝑥} ↔ 𝑦 = 𝑥) | |
| 9 | equcomi 2051 | . . 3 ⊢ (𝑦 = 𝑥 → 𝑥 = 𝑦) | |
| 10 | 8, 9 | sylbi 220 | . 2 ⊢ (𝑦 ∈ {𝑥} → 𝑥 = 𝑦) |
| 11 | 7, 10 | syl 18 | 1 ⊢ (∀𝑧(𝑥 ∈ 𝑧 → 𝑦 ∈ 𝑧) → 𝑥 = 𝑦) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∀wal 1567 = wceq 1569 ∈ wcel 2146 {csn 4587 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-ext 2735 ax-sep 5251 ax-pr 5394 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1572 df-ex 1812 df-sb 2101 df-clab 2742 df-cleq 2755 df-clel 2838 df-v 3455 df-un 4153 df-sn 4588 df-pr 4590 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |