| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > clel3g | Structured version Visualization version GIF version | ||
| Description: Alternate definition of membership in a set. (Contributed by NM, 13-Aug-2005.) |
| Ref | Expression |
|---|---|
| clel3g | ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ 𝐵 ↔ ∃𝑥(𝑥 = 𝐵 ∧ 𝐴 ∈ 𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq2 2854 | . . 3 ⊢ (𝑥 = 𝐵 → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ 𝐵)) | |
| 2 | 1 | ceqsexgv 3615 | . 2 ⊢ (𝐵 ∈ 𝑉 → (∃𝑥(𝑥 = 𝐵 ∧ 𝐴 ∈ 𝑥) ↔ 𝐴 ∈ 𝐵)) |
| 3 | 2 | bicomd 226 | 1 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ 𝐵 ↔ ∃𝑥(𝑥 = 𝐵 ∧ 𝐴 ∈ 𝑥))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2146 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 |
| This theorem is used by: clel3 3623 uniprg 4890 |
| Copyright terms: Public domain | W3C validator |