| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ceqex | Structured version Visualization version GIF version | ||
| Description: Equality implies equivalence with substitution. (Contributed by NM, 2-Mar-1995.) (Proof shortened by BJ, 1-May-2019.) |
| Ref | Expression |
|---|---|
| ceqex | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ ∃𝑥(𝑥 = 𝐴 ∧ 𝜑))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 19.8a 2180 | . . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝜑) → ∃𝑥(𝑥 = 𝐴 ∧ 𝜑)) | |
| 2 | 1 | ex 412 | . 2 ⊢ (𝑥 = 𝐴 → (𝜑 → ∃𝑥(𝑥 = 𝐴 ∧ 𝜑))) |
| 3 | eqvisset 3483 | . . . 4 ⊢ (𝑥 = 𝐴 → 𝐴 ∈ V) | |
| 4 | alexeqg 3634 | . . . 4 ⊢ (𝐴 ∈ V → (∀𝑥(𝑥 = 𝐴 → 𝜑) ↔ ∃𝑥(𝑥 = 𝐴 ∧ 𝜑))) | |
| 5 | 3, 4 | syl 17 | . . 3 ⊢ (𝑥 = 𝐴 → (∀𝑥(𝑥 = 𝐴 → 𝜑) ↔ ∃𝑥(𝑥 = 𝐴 ∧ 𝜑))) |
| 6 | sp 2182 | . . . 4 ⊢ (∀𝑥(𝑥 = 𝐴 → 𝜑) → (𝑥 = 𝐴 → 𝜑)) | |
| 7 | 6 | com12 32 | . . 3 ⊢ (𝑥 = 𝐴 → (∀𝑥(𝑥 = 𝐴 → 𝜑) → 𝜑)) |
| 8 | 5, 7 | sylbird 260 | . 2 ⊢ (𝑥 = 𝐴 → (∃𝑥(𝑥 = 𝐴 ∧ 𝜑) → 𝜑)) |
| 9 | 2, 8 | impbid 212 | 1 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ ∃𝑥(𝑥 = 𝐴 ∧ 𝜑))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∀wal 1537 = wceq 1539 ∃wex 1778 ∈ wcel 2107 Vcvv 3463 |
| 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-8 2109 ax-9 2117 ax-10 2140 ax-12 2176 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1542 df-ex 1779 df-nf 1783 df-sb 2064 df-clab 2713 df-cleq 2726 df-clel 2808 df-v 3465 |
| This theorem is referenced by: ceqsexg 3636 |
| Copyright terms: Public domain | W3C validator |