| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rext | 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 3701 | . . 3 ⊢ 𝑥 ∈ {𝑥} | |
| 2 | vex 2805 | . . . . 5 ⊢ 𝑥 ∈ V | |
| 3 | 2 | snex 4275 | . . . 4 ⊢ {𝑥} ∈ V |
| 4 | eleq2 2295 | . . . . 5 ⊢ (𝑧 = {𝑥} → (𝑥 ∈ 𝑧 ↔ 𝑥 ∈ {𝑥})) | |
| 5 | eleq2 2295 | . . . . 5 ⊢ (𝑧 = {𝑥} → (𝑦 ∈ 𝑧 ↔ 𝑦 ∈ {𝑥})) | |
| 6 | 4, 5 | imbi12d 234 | . . . 4 ⊢ (𝑧 = {𝑥} → ((𝑥 ∈ 𝑧 → 𝑦 ∈ 𝑧) ↔ (𝑥 ∈ {𝑥} → 𝑦 ∈ {𝑥}))) |
| 7 | 3, 6 | spcv 2900 | . . 3 ⊢ (∀𝑧(𝑥 ∈ 𝑧 → 𝑦 ∈ 𝑧) → (𝑥 ∈ {𝑥} → 𝑦 ∈ {𝑥})) |
| 8 | 1, 7 | mpi 15 | . 2 ⊢ (∀𝑧(𝑥 ∈ 𝑧 → 𝑦 ∈ 𝑧) → 𝑦 ∈ {𝑥}) |
| 9 | velsn 3686 | . . 3 ⊢ (𝑦 ∈ {𝑥} ↔ 𝑦 = 𝑥) | |
| 10 | equcomi 1752 | . . 3 ⊢ (𝑦 = 𝑥 → 𝑥 = 𝑦) | |
| 11 | 9, 10 | sylbi 121 | . 2 ⊢ (𝑦 ∈ {𝑥} → 𝑥 = 𝑦) |
| 12 | 8, 11 | syl 14 | 1 ⊢ (∀𝑧(𝑥 ∈ 𝑧 → 𝑦 ∈ 𝑧) → 𝑥 = 𝑦) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∀wal 1395 = wceq 1397 ∈ wcel 2202 {csn 3669 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-v 2804 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |