![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > exexneq | Structured version Visualization version GIF version |
Description: There exist two different sets. (Contributed by NM, 7-Nov-2006.) Avoid ax-13 2372. (Revised by BJ, 31-May-2019.) Avoid ax-8 2109. (Revised by SN, 21-Sep-2023.) Avoid ax-12 2172. (Revised by Rohan Ridenour, 9-Oct-2024.) Use ax-pr 5427 instead of ax-pow 5363. (Revised by BTernaryTau, 3-Dec-2024.) Extract this result from the proof of dtru 5436. (Revised by BJ, 2-Jan-2025.) |
Ref | Expression |
---|---|
exexneq | ⊢ ∃𝑥∃𝑦 ¬ 𝑥 = 𝑦 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | exel 5433 | . . 3 ⊢ ∃𝑥∃𝑧 𝑧 ∈ 𝑥 | |
2 | ax-nul 5306 | . . 3 ⊢ ∃𝑦∀𝑧 ¬ 𝑧 ∈ 𝑦 | |
3 | exdistrv 1960 | . . 3 ⊢ (∃𝑥∃𝑦(∃𝑧 𝑧 ∈ 𝑥 ∧ ∀𝑧 ¬ 𝑧 ∈ 𝑦) ↔ (∃𝑥∃𝑧 𝑧 ∈ 𝑥 ∧ ∃𝑦∀𝑧 ¬ 𝑧 ∈ 𝑦)) | |
4 | 1, 2, 3 | mpbir2an 710 | . 2 ⊢ ∃𝑥∃𝑦(∃𝑧 𝑧 ∈ 𝑥 ∧ ∀𝑧 ¬ 𝑧 ∈ 𝑦) |
5 | ax9v1 2119 | . . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝑧 ∈ 𝑥 → 𝑧 ∈ 𝑦)) | |
6 | 5 | eximdv 1921 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → (∃𝑧 𝑧 ∈ 𝑥 → ∃𝑧 𝑧 ∈ 𝑦)) |
7 | df-ex 1783 | . . . . . . 7 ⊢ (∃𝑧 𝑧 ∈ 𝑦 ↔ ¬ ∀𝑧 ¬ 𝑧 ∈ 𝑦) | |
8 | 6, 7 | imbitrdi 250 | . . . . . 6 ⊢ (𝑥 = 𝑦 → (∃𝑧 𝑧 ∈ 𝑥 → ¬ ∀𝑧 ¬ 𝑧 ∈ 𝑦)) |
9 | 8 | com12 32 | . . . . 5 ⊢ (∃𝑧 𝑧 ∈ 𝑥 → (𝑥 = 𝑦 → ¬ ∀𝑧 ¬ 𝑧 ∈ 𝑦)) |
10 | 9 | con2d 134 | . . . 4 ⊢ (∃𝑧 𝑧 ∈ 𝑥 → (∀𝑧 ¬ 𝑧 ∈ 𝑦 → ¬ 𝑥 = 𝑦)) |
11 | 10 | imp 408 | . . 3 ⊢ ((∃𝑧 𝑧 ∈ 𝑥 ∧ ∀𝑧 ¬ 𝑧 ∈ 𝑦) → ¬ 𝑥 = 𝑦) |
12 | 11 | 2eximi 1839 | . 2 ⊢ (∃𝑥∃𝑦(∃𝑧 𝑧 ∈ 𝑥 ∧ ∀𝑧 ¬ 𝑧 ∈ 𝑦) → ∃𝑥∃𝑦 ¬ 𝑥 = 𝑦) |
13 | 4, 12 | ax-mp 5 | 1 ⊢ ∃𝑥∃𝑦 ¬ 𝑥 = 𝑦 |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∧ wa 397 ∀wal 1540 ∃wex 1782 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-9 2117 ax-nul 5306 ax-pr 5427 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-ex 1783 |
This theorem is referenced by: exneq 5435 |
Copyright terms: Public domain | W3C validator |