| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: An alternate definition of class membership when the class is a set. |
| Ref | Expression |
|---|---|
| clel3.1 | ⊢ B ∈ V |
| Ref | Expression |
|---|---|
| clel3 | ⊢ (A ∈ B ↔ ∃x(x = B ∧ A ∈ x)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | clel3.1 | . . 3 ⊢ B ∈ V | |
| 2 | eleq2 1150 | . . 3 ⊢ (x = B → (A ∈ x ↔ A ∈ B)) | |
| 3 | 1, 2 | ceqsexv 1371 | . 2 ⊢ (∃x(x = B ∧ A ∈ x) ↔ A ∈ B) |
| 4 | 3 | bicomi 150 | 1 ⊢ (A ∈ B ↔ ∃x(x = B ∧ A ∈ x)) |
| Colors of variables: wff set class |
| Syntax hints: ↔ wb 127 ∧ wa 196 ∃wex 678 = wceq 1091 ∈ wcel 1092 Vcvv 1348 |
| This theorem is referenced by: unpr 1930 dfiun2 2014 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-gen 677 ax-9 799 ax-12 802 ax-17 925 ax-ext 1074 |
| This theorem depends on definitions: df-bi 128 df-an 198 df-ex 679 df-sb 853 df-clab 1093 df-cleq 1097 df-clel 1099 df-v 1349 |