| 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 2597 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 2597 was then proved as dfeu 2623. (Revised by BJ, 30-Sep-2022.) (Proof shortened by Wolf Lammen, 3-Jan-2023.) Remove use of ax-11 2192. (Revised by SN, 21-Sep-2023.) |
| Ref | Expression |
|---|---|
| eu6 | ⊢ (∃!𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfmoeu 2563 | . . . 4 ⊢ ((∃𝑥𝜑 → ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) ↔ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦)) | |
| 2 | 1 | anbi2i 632 | . . 3 ⊢ ((∃𝑥𝜑 ∧ (∃𝑥𝜑 → ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦))) ↔ (∃𝑥𝜑 ∧ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))) |
| 3 | abai 836 | . . 3 ⊢ ((∃𝑥𝜑 ∧ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) ↔ (∃𝑥𝜑 ∧ (∃𝑥𝜑 → ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)))) | |
| 4 | eu3v 2598 | . . 3 ⊢ (∃!𝑥𝜑 ↔ (∃𝑥𝜑 ∧ ∃𝑦∀𝑥(𝜑 → 𝑥 = 𝑦))) | |
| 5 | 2, 3, 4 | 3bitr4ri 306 | . 2 ⊢ (∃!𝑥𝜑 ↔ (∃𝑥𝜑 ∧ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦))) |
| 6 | abai 836 | . . 3 ⊢ ((∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) ∧ ∃𝑥𝜑) ↔ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) ∧ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∃𝑥𝜑))) | |
| 7 | ancom 464 | . . 3 ⊢ ((∃𝑥𝜑 ∧ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) ↔ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) ∧ ∃𝑥𝜑)) | |
| 8 | biimpr 222 | . . . . . . 7 ⊢ ((𝜑 ↔ 𝑥 = 𝑦) → (𝑥 = 𝑦 → 𝜑)) | |
| 9 | 8 | alimi 1832 | . . . . . 6 ⊢ (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∀𝑥(𝑥 = 𝑦 → 𝜑)) |
| 10 | 9 | eximi 1856 | . . . . 5 ⊢ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∃𝑦∀𝑥(𝑥 = 𝑦 → 𝜑)) |
| 11 | exsbim 2023 | . . . . 5 ⊢ (∃𝑦∀𝑥(𝑥 = 𝑦 → 𝜑) → ∃𝑥𝜑) | |
| 12 | 10, 11 | syl 17 | . . . 4 ⊢ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∃𝑥𝜑) |
| 13 | 12 | biantru 537 | . . 3 ⊢ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) ↔ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) ∧ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) → ∃𝑥𝜑))) |
| 14 | 6, 7, 13 | 3bitr4i 305 | . 2 ⊢ ((∃𝑥𝜑 ∧ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) ↔ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) |
| 15 | 5, 14 | bitri 277 | 1 ⊢ (∃!𝑥𝜑 ↔ ∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∀wal 1559 ∃wex 1800 ∃!weu 2596 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-10 2176 ax-12 2213 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-ex 1801 df-nf 1805 df-mo 2567 df-eu 2597 |
| This theorem is referenced by: euf 2604 nfeu1ALT 2616 dfmo2 2624 sb8eulem 2626 reu6 3690 euabsn2 4685 eunex 5348 euotd 5483 iotauni 6499 iota1 6501 iotanul 6502 iota4 6503 fv3 6886 eufnfv 7214 seqomlem2 8423 aceq1 10074 dfac5 10086 bnj89 35018 cbveud 37867 wl-eudf 38076 wl-euequf 38078 wl-sb8eut 38082 wl-sb8eutv 38083 iotain 44994 iotaexeu 44995 iotasbc 44996 iotavalsb 45010 sbiota1 45011 dfac5prim 45567 permac8prim 45591 eusnsn 47621 mo0sn 49438 |
| Copyright terms: Public domain | W3C validator |