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 4156 | . . 3 ⊢ 𝑥 ∈ {𝑥} | |
2 | snex 4835 | . . . 4 ⊢ {𝑥} ∈ V | |
3 | eleq2 2677 | . . . . 5 ⊢ (𝑧 = {𝑥} → (𝑥 ∈ 𝑧 ↔ 𝑥 ∈ {𝑥})) | |
4 | eleq2 2677 | . . . . 5 ⊢ (𝑧 = {𝑥} → (𝑦 ∈ 𝑧 ↔ 𝑦 ∈ {𝑥})) | |
5 | 3, 4 | imbi12d 333 | . . . 4 ⊢ (𝑧 = {𝑥} → ((𝑥 ∈ 𝑧 → 𝑦 ∈ 𝑧) ↔ (𝑥 ∈ {𝑥} → 𝑦 ∈ {𝑥}))) |
6 | 2, 5 | spcv 3272 | . . 3 ⊢ (∀𝑧(𝑥 ∈ 𝑧 → 𝑦 ∈ 𝑧) → (𝑥 ∈ {𝑥} → 𝑦 ∈ {𝑥})) |
7 | 1, 6 | mpi 20 | . 2 ⊢ (∀𝑧(𝑥 ∈ 𝑧 → 𝑦 ∈ 𝑧) → 𝑦 ∈ {𝑥}) |
8 | velsn 4141 | . . 3 ⊢ (𝑦 ∈ {𝑥} ↔ 𝑦 = 𝑥) | |
9 | equcomi 1931 | . . 3 ⊢ (𝑦 = 𝑥 → 𝑥 = 𝑦) | |
10 | 8, 9 | sylbi 206 | . 2 ⊢ (𝑦 ∈ {𝑥} → 𝑥 = 𝑦) |
11 | 7, 10 | syl 17 | 1 ⊢ (∀𝑧(𝑥 ∈ 𝑧 → 𝑦 ∈ 𝑧) → 𝑥 = 𝑦) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∀wal 1473 = wceq 1475 ∈ wcel 1977 {csn 4125 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-v 3175 df-dif 3543 df-un 3545 df-nul 3875 df-sn 4126 df-pr 4128 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |