| 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 5419, but its meaning is different. It only depends on the axioms ax-mp 5 to ax-4 1839, ax-6 1997, and ax-pr 5404. 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 5416. (Contributed by SN, 23-Dec-2024.) |
| Ref | Expression |
|---|---|
| exel | ⊢ ∃𝑦∃𝑥 𝑥 ∈ 𝑦 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-pr 5404 | . 2 ⊢ ∃𝑦∀𝑥((𝑥 = 𝑧 ∨ 𝑥 = 𝑧) → 𝑥 ∈ 𝑦) | |
| 2 | ax6ev 1999 | . . . 4 ⊢ ∃𝑥 𝑥 = 𝑧 | |
| 3 | pm2.07 915 | . . . 4 ⊢ (𝑥 = 𝑧 → (𝑥 = 𝑧 ∨ 𝑥 = 𝑧)) | |
| 4 | 2, 3 | eximii 1867 | . . 3 ⊢ ∃𝑥(𝑥 = 𝑧 ∨ 𝑥 = 𝑧) |
| 5 | exim 1864 | . . 3 ⊢ (∀𝑥((𝑥 = 𝑧 ∨ 𝑥 = 𝑧) → 𝑥 ∈ 𝑦) → (∃𝑥(𝑥 = 𝑧 ∨ 𝑥 = 𝑧) → ∃𝑥 𝑥 ∈ 𝑦)) | |
| 6 | 4, 5 | mpi 21 | . 2 ⊢ (∀𝑥((𝑥 = 𝑧 ∨ 𝑥 = 𝑧) → 𝑥 ∈ 𝑦) → ∃𝑥 𝑥 ∈ 𝑦) |
| 7 | 1, 6 | eximii 1867 | 1 ⊢ ∃𝑦∃𝑥 𝑥 ∈ 𝑦 |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 860 ∀wal 1568 ∃wex 1809 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-6 1997 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-or 861 df-ex 1810 |
| This theorem is referenced by: exexneq 5416 |
| Copyright terms: Public domain | W3C validator |