| 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 2820 | . . 3 ⊢ (𝑥 = 𝐵 → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ 𝐵)) | |
| 2 | 1 | ceqsexgv 3604 | . 2 ⊢ (𝐵 ∈ 𝑉 → (∃𝑥(𝑥 = 𝐵 ∧ 𝐴 ∈ 𝑥) ↔ 𝐴 ∈ 𝐵)) |
| 3 | 2 | bicomd 223 | 1 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ 𝐵 ↔ ∃𝑥(𝑥 = 𝐵 ∧ 𝐴 ∈ 𝑥))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∃wex 1780 ∈ wcel 2111 |
| 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-8 2113 ax-9 2121 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 |
| This theorem is referenced by: clel3 3612 uniprg 4872 |
| Copyright terms: Public domain | W3C validator |