| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > exel | Structured version Visualization version GIF version | ||
| Description: There exist two sets, one
a member of the other.
This theorem looks similar to el 5406, but its meaning is different. It only depends on the axioms ax-mp 5 to ax-4 1841, ax-6 1999, and ax-pr 5391. This theorem does not exclude that these two sets could actually be one single set containing itself. That two different sets exist is proved by exexneq 5403. (Contributed by SN, 23-Dec-2024.) |
| Ref | Expression |
|---|---|
| exel | ⊢ ∃𝑦∃𝑥 𝑥 ∈ 𝑦 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-pr 5391 | . 2 ⊢ ∃𝑦∀𝑥((𝑥 = 𝑧 ∨ 𝑥 = 𝑧) → 𝑥 ∈ 𝑦) | |
| 2 | ax6ev 2001 | . . . 4 ⊢ ∃𝑥 𝑥 = 𝑧 | |
| 3 | pm2.07 916 | . . . 4 ⊢ (𝑥 = 𝑧 → (𝑥 = 𝑧 ∨ 𝑥 = 𝑧)) | |
| 4 | 2, 3 | eximii 1869 | . . 3 ⊢ ∃𝑥(𝑥 = 𝑧 ∨ 𝑥 = 𝑧) |
| 5 | exim 1866 | . . 3 ⊢ (∀𝑥((𝑥 = 𝑧 ∨ 𝑥 = 𝑧) → 𝑥 ∈ 𝑦) → (∃𝑥(𝑥 = 𝑧 ∨ 𝑥 = 𝑧) → ∃𝑥 𝑥 ∈ 𝑦)) | |
| 6 | 4, 5 | mpi 21 | . 2 ⊢ (∀𝑥((𝑥 = 𝑧 ∨ 𝑥 = 𝑧) → 𝑥 ∈ 𝑦) → ∃𝑥 𝑥 ∈ 𝑦) |
| 7 | 1, 6 | eximii 1869 | 1 ⊢ ∃𝑦∃𝑥 𝑥 ∈ 𝑦 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∨ wo 861 ∀wal 1567 ∃wex 1811 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-6 1999 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-or 862 df-ex 1812 |
| This theorem is used by: exexneq 5403 |
| Copyright terms: Public domain | W3C validator |