Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > clelabOLD | Structured version Visualization version GIF version |
Description: Obsolete version of clelab 2883 as of 2-Sep-2024. (Contributed by NM, 23-Dec-1993.) (Proof shortened by Wolf Lammen, 16-Nov-2019.) (New usage is discouraged.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
clelabOLD | ⊢ (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ ∃𝑥(𝑥 = 𝐴 ∧ 𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfclel 2817 | . 2 ⊢ (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ ∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ {𝑥 ∣ 𝜑})) | |
2 | nfv 1917 | . . 3 ⊢ Ⅎ𝑦(𝑥 = 𝐴 ∧ 𝜑) | |
3 | nfv 1917 | . . . 4 ⊢ Ⅎ𝑥 𝑦 = 𝐴 | |
4 | nfsab1 2723 | . . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ {𝑥 ∣ 𝜑} | |
5 | 3, 4 | nfan 1902 | . . 3 ⊢ Ⅎ𝑥(𝑦 = 𝐴 ∧ 𝑦 ∈ {𝑥 ∣ 𝜑}) |
6 | eqeq1 2742 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 = 𝐴 ↔ 𝑦 = 𝐴)) | |
7 | sbequ12 2244 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ [𝑦 / 𝑥]𝜑)) | |
8 | df-clab 2716 | . . . . 5 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ [𝑦 / 𝑥]𝜑) | |
9 | 7, 8 | bitr4di 289 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝑦 ∈ {𝑥 ∣ 𝜑})) |
10 | 6, 9 | anbi12d 631 | . . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 = 𝐴 ∧ 𝜑) ↔ (𝑦 = 𝐴 ∧ 𝑦 ∈ {𝑥 ∣ 𝜑}))) |
11 | 2, 5, 10 | cbvexv1 2339 | . 2 ⊢ (∃𝑥(𝑥 = 𝐴 ∧ 𝜑) ↔ ∃𝑦(𝑦 = 𝐴 ∧ 𝑦 ∈ {𝑥 ∣ 𝜑})) |
12 | 1, 11 | bitr4i 277 | 1 ⊢ (𝐴 ∈ {𝑥 ∣ 𝜑} ↔ ∃𝑥(𝑥 = 𝐴 ∧ 𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 396 = wceq 1539 ∃wex 1782 [wsb 2067 ∈ wcel 2106 {cab 2715 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-tru 1542 df-ex 1783 df-nf 1787 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |