|   | Metamath Proof Explorer | < Previous  
      Next > Nearby theorems | |
| Mirrors > Home > MPE Home > Th. List > exneq | Structured version Visualization version GIF version | ||
| Description: Given any set (the
"𝑦 " in the statement), there
exists a set not
       equal to it. The same statement without disjoint variable condition is false, since we do not have ∃𝑥¬ 𝑥 = 𝑥. This theorem is proved directly from set theory axioms (no class definitions) and does not depend on ax-ext 2707, ax-sep 5295, or ax-pow 5364 nor auxiliary logical axiom schemes ax-10 2140 to ax-13 2376. See dtruALT 5387 for a shorter proof using more axioms, and dtruALT2 5369 for a proof using ax-pow 5364 instead of ax-pr 5431. (Contributed by NM, 7-Nov-2006.) Avoid ax-13 2376. (Revised by BJ, 31-May-2019.) Avoid ax-8 2109. (Revised by SN, 21-Sep-2023.) Avoid ax-12 2176. (Revised by Rohan Ridenour, 9-Oct-2024.) Use ax-pr 5431 instead of ax-pow 5364. (Revised by BTernaryTau, 3-Dec-2024.) Extract this result from the proof of dtru 5440. (Revised by BJ, 2-Jan-2025.) | 
| Ref | Expression | 
|---|---|
| exneq | ⊢ ∃𝑥 ¬ 𝑥 = 𝑦 | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | exexneq 5438 | . 2 ⊢ ∃𝑧∃𝑤 ¬ 𝑧 = 𝑤 | |
| 2 | equeuclr 2021 | . . . . . 6 ⊢ (𝑤 = 𝑦 → (𝑧 = 𝑦 → 𝑧 = 𝑤)) | |
| 3 | 2 | con3d 152 | . . . . 5 ⊢ (𝑤 = 𝑦 → (¬ 𝑧 = 𝑤 → ¬ 𝑧 = 𝑦)) | 
| 4 | ax7v1 2008 | . . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑥 = 𝑦 → 𝑧 = 𝑦)) | |
| 5 | 4 | con3d 152 | . . . . . 6 ⊢ (𝑥 = 𝑧 → (¬ 𝑧 = 𝑦 → ¬ 𝑥 = 𝑦)) | 
| 6 | 5 | spimevw 1993 | . . . . 5 ⊢ (¬ 𝑧 = 𝑦 → ∃𝑥 ¬ 𝑥 = 𝑦) | 
| 7 | 3, 6 | syl6 35 | . . . 4 ⊢ (𝑤 = 𝑦 → (¬ 𝑧 = 𝑤 → ∃𝑥 ¬ 𝑥 = 𝑦)) | 
| 8 | ax7v1 2008 | . . . . . . 7 ⊢ (𝑥 = 𝑤 → (𝑥 = 𝑦 → 𝑤 = 𝑦)) | |
| 9 | 8 | con3d 152 | . . . . . 6 ⊢ (𝑥 = 𝑤 → (¬ 𝑤 = 𝑦 → ¬ 𝑥 = 𝑦)) | 
| 10 | 9 | spimevw 1993 | . . . . 5 ⊢ (¬ 𝑤 = 𝑦 → ∃𝑥 ¬ 𝑥 = 𝑦) | 
| 11 | 10 | a1d 25 | . . . 4 ⊢ (¬ 𝑤 = 𝑦 → (¬ 𝑧 = 𝑤 → ∃𝑥 ¬ 𝑥 = 𝑦)) | 
| 12 | 7, 11 | pm2.61i 182 | . . 3 ⊢ (¬ 𝑧 = 𝑤 → ∃𝑥 ¬ 𝑥 = 𝑦) | 
| 13 | 12 | exlimivv 1931 | . 2 ⊢ (∃𝑧∃𝑤 ¬ 𝑧 = 𝑤 → ∃𝑥 ¬ 𝑥 = 𝑦) | 
| 14 | 1, 13 | ax-mp 5 | 1 ⊢ ∃𝑥 ¬ 𝑥 = 𝑦 | 
| Colors of variables: wff setvar class | 
| Syntax hints: ¬ wn 3 → wi 4 ∃wex 1778 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-9 2117 ax-nul 5305 ax-pr 5431 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-ex 1779 | 
| This theorem is referenced by: dtru 5440 | 
| Copyright terms: Public domain | W3C validator |