Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > clel3g | Structured version Visualization version GIF version |
Description: An alternate definition of class membership when the class is a set. (Contributed by NM, 13-Aug-2005.) |
Ref | Expression |
---|---|
clel3g | ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ 𝐵 ↔ ∃𝑥(𝑥 = 𝐵 ∧ 𝐴 ∈ 𝑥))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eleq2 2901 | . . 3 ⊢ (𝑥 = 𝐵 → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ 𝐵)) | |
2 | 1 | ceqsexgv 3647 | . 2 ⊢ (𝐵 ∈ 𝑉 → (∃𝑥(𝑥 = 𝐵 ∧ 𝐴 ∈ 𝑥) ↔ 𝐴 ∈ 𝐵)) |
3 | 2 | bicomd 225 | 1 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ 𝐵 ↔ ∃𝑥(𝑥 = 𝐵 ∧ 𝐴 ∈ 𝑥))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∃wex 1776 ∈ wcel 2110 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-ex 1777 df-cleq 2814 df-clel 2893 |
This theorem is referenced by: clel3 3655 dfiun2g 4948 dfiun2gOLD 4949 |
Copyright terms: Public domain | W3C validator |