|   | Metamath Proof Explorer | < Previous  
      Next > Nearby theorems | |
| Mirrors > Home > MPE Home > Th. List > eujust | Structured version Visualization version GIF version | ||
| Description: Soundness justification theorem for eu6 2574 when this was the definition of the unique existential quantifier (note that 𝑦 and 𝑧 need not be disjoint, although the weaker theorem with that disjoint variable condition added would be enough to justify the soundness of the definition). See eujustALT 2572 for a proof that provides an example of how it can be achieved through the use of dvelim 2456. (Contributed by NM, 11-Mar-2010.) (Proof shortened by Andrew Salmon, 9-Jul-2011.) | 
| Ref | Expression | 
|---|---|
| eujust | ⊢ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) ↔ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | equequ2 2025 | . . . . 5 ⊢ (𝑦 = 𝑤 → (𝑥 = 𝑦 ↔ 𝑥 = 𝑤)) | |
| 2 | 1 | bibi2d 342 | . . . 4 ⊢ (𝑦 = 𝑤 → ((𝜑 ↔ 𝑥 = 𝑦) ↔ (𝜑 ↔ 𝑥 = 𝑤))) | 
| 3 | 2 | albidv 1920 | . . 3 ⊢ (𝑦 = 𝑤 → (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑤))) | 
| 4 | 3 | cbvexvw 2036 | . 2 ⊢ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) ↔ ∃𝑤∀𝑥(𝜑 ↔ 𝑥 = 𝑤)) | 
| 5 | equequ2 2025 | . . . . 5 ⊢ (𝑤 = 𝑧 → (𝑥 = 𝑤 ↔ 𝑥 = 𝑧)) | |
| 6 | 5 | bibi2d 342 | . . . 4 ⊢ (𝑤 = 𝑧 → ((𝜑 ↔ 𝑥 = 𝑤) ↔ (𝜑 ↔ 𝑥 = 𝑧))) | 
| 7 | 6 | albidv 1920 | . . 3 ⊢ (𝑤 = 𝑧 → (∀𝑥(𝜑 ↔ 𝑥 = 𝑤) ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧))) | 
| 8 | 7 | cbvexvw 2036 | . 2 ⊢ (∃𝑤∀𝑥(𝜑 ↔ 𝑥 = 𝑤) ↔ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) | 
| 9 | 4, 8 | bitri 275 | 1 ⊢ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) ↔ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) | 
| Colors of variables: wff setvar class | 
| Syntax hints: ↔ wb 206 ∀wal 1538 ∃wex 1779 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1780 | 
| This theorem is referenced by: (None) | 
| Copyright terms: Public domain | W3C validator |