| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ceqsexgv | Structured version Visualization version GIF version | ||
| Description: Elimination of an existential quantifier, using implicit substitution. (Contributed by NM, 29-Dec-1996.) Drop ax-10 2183 and ax-12 2219. (Revised by GG, 1-Dec-2023.) |
| Ref | Expression |
|---|---|
| ceqsexgv.1 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| ceqsexgv | ⊢ (𝐴 ∈ 𝑉 → (∃𝑥(𝑥 = 𝐴 ∧ 𝜑) ↔ 𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 23 | . 2 ⊢ (𝑥 = 𝐴 → 𝑥 = 𝐴) | |
| 2 | ceqsexgv.1 | . 2 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
| 3 | 1, 2 | cgsexg 3497 | 1 ⊢ (𝐴 ∈ 𝑉 → (∃𝑥(𝑥 = 𝐴 ∧ 𝜑) ↔ 𝜓)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1572 ∃wex 1814 ∈ wcel 2150 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1575 df-ex 1815 df-sb 2104 df-clab 2745 df-clel 2842 |
| This theorem is used by: ceqsrexv 3611 clel3g 3617 elxp5 7968 xpsnen 9117 isssc 18047 metuel2 24941 isgrpo 31158 bj-finsumval0 38476 ismgmOLD 39052 brxrn 39583 pmapjat1 41178 dfatdmfcoafv2 48657 |
| Copyright terms: Public domain | W3C validator |