| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iseqsetvlem | Structured version Visualization version GIF version | ||
| Description: Lemma for iseqsetv-cleq 2795. (Contributed by Wolf Lammen, 17-Aug-2025.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| iseqsetvlem | ⊢ (∃𝑥 𝑥 = 𝐴 ↔ ∃𝑧 𝑧 = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeq1 2735 | . 2 ⊢ (𝑥 = 𝑧 → (𝑥 = 𝐴 ↔ 𝑧 = 𝐴)) | |
| 2 | 1 | cbvexvw 2038 | 1 ⊢ (∃𝑥 𝑥 = 𝐴 ↔ ∃𝑧 𝑧 = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 = wceq 1541 ∃wex 1780 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-9 2121 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1781 df-cleq 2723 |
| This theorem is referenced by: iseqsetv-cleq 2795 |
| Copyright terms: Public domain | W3C validator |