| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eu6 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of the unique existential quantifier df-eu 2570 not using the at-most-one quantifier. (Contributed by NM, 12-Aug-1993.) This used to be the definition of the unique existential quantifier, while df-eu 2570 was then proved as dfeu 2596. (Revised by BJ, 30-Sep-2022.) (Proof shortened by Wolf Lammen, 3-Jan-2023.) Remove use of ax-11 2163. (Revised by SN, 21-Sep-2023.) |
| Ref | Expression |
|---|---|
| eu6 | ⊢ (∃!𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfmoeu 2536 | . . . 4 ⊢ ((∃𝑥𝜑 → ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) ↔ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦)) | |
| 2 | 1 | anbi2i 624 | . . 3 ⊢ ((∃𝑥𝜑 ∧ (∃𝑥𝜑 → ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦))) ↔ (∃𝑥𝜑 ∧ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))) |
| 3 | abai 827 | . . 3 ⊢ ((∃𝑥𝜑 ∧ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) ↔ (∃𝑥𝜑 ∧ (∃𝑥𝜑 → ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)))) | |
| 4 | eu3v 2571 | . . 3 ⊢ (∃!𝑥𝜑 ↔ (∃𝑥𝜑 ∧ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))) | |
| 5 | 2, 3, 4 | 3bitr4ri 304 | . 2 ⊢ (∃!𝑥𝜑 ↔ (∃𝑥𝜑 ∧ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦))) |
| 6 | abai 827 | . . 3 ⊢ ((∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) ∧ ∃𝑥𝜑) ↔ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) ∧ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∃𝑥𝜑))) | |
| 7 | ancom 460 | . . 3 ⊢ ((∃𝑥𝜑 ∧ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) ↔ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) ∧ ∃𝑥𝜑)) | |
| 8 | biimpr 220 | . . . . . . 7 ⊢ ((𝜑 ↔ 𝑥 = 𝑦) → (𝑥 = 𝑦 → 𝜑)) | |
| 9 | 8 | alimi 1813 | . . . . . 6 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∀𝑥(𝑥 = 𝑦 → 𝜑)) |
| 10 | 9 | eximi 1837 | . . . . 5 ⊢ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∃𝑦∀𝑥(𝑥 = 𝑦 → 𝜑)) |
| 11 | exsbim 2004 | . . . . 5 ⊢ (∃𝑦∀𝑥(𝑥 = 𝑦 → 𝜑) → ∃𝑥𝜑) | |
| 12 | 10, 11 | syl 17 | . . . 4 ⊢ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∃𝑥𝜑) |
| 13 | 12 | biantru 529 | . . 3 ⊢ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) ↔ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) ∧ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∃𝑥𝜑))) |
| 14 | 6, 7, 13 | 3bitr4i 303 | . 2 ⊢ ((∃𝑥𝜑 ∧ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) ↔ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) |
| 15 | 5, 14 | bitri 275 | 1 ⊢ (∃!𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∀wal 1540 ∃wex 1781 ∃!weu 2569 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-10 2147 ax-12 2185 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-ex 1782 df-nf 1786 df-mo 2540 df-eu 2570 |
| This theorem is referenced by: euf 2577 nfeu1ALT 2589 dfmo2 2597 sb8eulem 2599 reu6 3673 euabsn2 4670 eunex 5328 euotd 5462 iotauni 6470 iota1 6472 iotanul 6473 iota4 6474 fv3 6853 eufnfv 7178 seqomlem2 8384 aceq1 10033 dfac5 10045 bnj89 34883 cbveud 37705 wl-eudf 37914 wl-euequf 37916 wl-sb8eut 37920 wl-sb8eutv 37921 iotain 44865 iotaexeu 44866 iotasbc 44867 iotavalsb 44881 sbiota1 44882 dfac5prim 45438 permac8prim 45462 eusnsn 47489 mo0sn 49306 |
| Copyright terms: Public domain | W3C validator |