|   | Metamath Proof Explorer | < Previous  
      Next > Nearby theorems | |
| Mirrors > Home > MPE Home > Th. List > 2mos | Structured version Visualization version GIF version | ||
| Description: Double "there exists at most one", using implicit substitution. (Contributed by NM, 10-Feb-2005.) (Proof shortened by Wolf Lammen, 21-May-2025.) | 
| Ref | Expression | 
|---|---|
| 2mos.1 | ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (𝜑 ↔ 𝜓)) | 
| Ref | Expression | 
|---|---|
| 2mos | ⊢ (∃𝑧∃𝑤∀𝑥∀𝑦(𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤)) ↔ ∀𝑥∀𝑦∀𝑧∀𝑤((𝜑 ∧ 𝜓) → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | 2mo 2647 | . 2 ⊢ (∃𝑧∃𝑤∀𝑥∀𝑦(𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤)) ↔ ∀𝑥∀𝑦∀𝑧∀𝑤((𝜑 ∧ [𝑧 / 𝑥][𝑤 / 𝑦]𝜑) → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))) | |
| 2 | 2mos.1 | . . . . . . 7 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (𝜑 ↔ 𝜓)) | |
| 3 | 2 | 2sbievw 2095 | . . . . . 6 ⊢ ([𝑧 / 𝑥][𝑤 / 𝑦]𝜑 ↔ 𝜓) | 
| 4 | 3 | anbi2i 623 | . . . . 5 ⊢ ((𝜑 ∧ [𝑧 / 𝑥][𝑤 / 𝑦]𝜑) ↔ (𝜑 ∧ 𝜓)) | 
| 5 | 4 | imbi1i 349 | . . . 4 ⊢ (((𝜑 ∧ [𝑧 / 𝑥][𝑤 / 𝑦]𝜑) → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤)) ↔ ((𝜑 ∧ 𝜓) → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))) | 
| 6 | 5 | 2albii 1819 | . . 3 ⊢ (∀𝑧∀𝑤((𝜑 ∧ [𝑧 / 𝑥][𝑤 / 𝑦]𝜑) → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤)) ↔ ∀𝑧∀𝑤((𝜑 ∧ 𝜓) → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))) | 
| 7 | 6 | 2albii 1819 | . 2 ⊢ (∀𝑥∀𝑦∀𝑧∀𝑤((𝜑 ∧ [𝑧 / 𝑥][𝑤 / 𝑦]𝜑) → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤)) ↔ ∀𝑥∀𝑦∀𝑧∀𝑤((𝜑 ∧ 𝜓) → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))) | 
| 8 | 1, 7 | bitri 275 | 1 ⊢ (∃𝑧∃𝑤∀𝑥∀𝑦(𝜑 → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤)) ↔ ∀𝑥∀𝑦∀𝑧∀𝑤((𝜑 ∧ 𝜓) → (𝑥 = 𝑧 ∧ 𝑦 = 𝑤))) | 
| Colors of variables: wff setvar class | 
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∀wal 1537 ∃wex 1778 [wsb 2063 | 
| 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-10 2140 ax-11 2156 ax-12 2176 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1542 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2539 | 
| This theorem is referenced by: (None) | 
| Copyright terms: Public domain | W3C validator |