| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ceqsex | Structured version Visualization version GIF version | ||
| Description: Elimination of an existential quantifier, using implicit substitution. (Contributed by NM, 2-Mar-1995.) (Revised by Mario Carneiro, 10-Oct-2016.) (Proof shortened by Wolf Lammen, 22-Jan-2025.) |
| Ref | Expression |
|---|---|
| ceqsex.1 | ⊢ Ⅎ𝑥𝜓 |
| ceqsex.2 | ⊢ 𝐴 ∈ V |
| ceqsex.3 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| ceqsex | ⊢ (∃𝑥(𝑥 = 𝐴 ∧ 𝜑) ↔ 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | alinexa 1853 | . . 3 ⊢ (∀𝑥(𝑥 = 𝐴 → ¬ 𝜑) ↔ ¬ ∃𝑥(𝑥 = 𝐴 ∧ 𝜑)) | |
| 2 | ceqsex.1 | . . . . 5 ⊢ Ⅎ𝑥𝜓 | |
| 3 | 2 | nfn 1867 | . . . 4 ⊢ Ⅎ𝑥 ¬ 𝜓 |
| 4 | ceqsex.2 | . . . 4 ⊢ 𝐴 ∈ V | |
| 5 | ceqsex.3 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
| 6 | 5 | notbid 320 | . . . 4 ⊢ (𝑥 = 𝐴 → (¬ 𝜑 ↔ ¬ 𝜓)) |
| 7 | 3, 4, 6 | ceqsal 3481 | . . 3 ⊢ (∀𝑥(𝑥 = 𝐴 → ¬ 𝜑) ↔ ¬ 𝜓) |
| 8 | 1, 7 | bitr3i 279 | . 2 ⊢ (¬ ∃𝑥(𝑥 = 𝐴 ∧ 𝜑) ↔ ¬ 𝜓) |
| 9 | 8 | con4bii 323 | 1 ⊢ (∃𝑥(𝑥 = 𝐴 ∧ 𝜑) ↔ 𝜓) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∀wal 1548 = wceq 1550 ∃wex 1789 Ⅎwnf 1793 ∈ wcel 2132 Vcvv 3444 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-12 2202 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-ex 1790 df-nf 1794 df-clel 2827 |
| This theorem is referenced by: ceqsex2 3494 |
| Copyright terms: Public domain | W3C validator |