![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > clel4g | Structured version Visualization version GIF version |
Description: Alternate definition of membership in a set. (Contributed by NM, 18-Aug-1993.) Strengthen from sethood hypothesis to sethood antecedent and avoid ax-12 2170. (Revised by BJ, 1-Sep-2024.) |
Ref | Expression |
---|---|
clel4g | ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ 𝐵 ↔ ∀𝑥(𝑥 = 𝐵 → 𝐴 ∈ 𝑥))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elisset 2814 | . . . 4 ⊢ (𝐵 ∈ 𝑉 → ∃𝑥 𝑥 = 𝐵) | |
2 | biimt 360 | . . . 4 ⊢ (∃𝑥 𝑥 = 𝐵 → (𝐴 ∈ 𝐵 ↔ (∃𝑥 𝑥 = 𝐵 → 𝐴 ∈ 𝐵))) | |
3 | 1, 2 | syl 17 | . . 3 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ 𝐵 ↔ (∃𝑥 𝑥 = 𝐵 → 𝐴 ∈ 𝐵))) |
4 | 19.23v 1944 | . . 3 ⊢ (∀𝑥(𝑥 = 𝐵 → 𝐴 ∈ 𝐵) ↔ (∃𝑥 𝑥 = 𝐵 → 𝐴 ∈ 𝐵)) | |
5 | 3, 4 | bitr4di 289 | . 2 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ 𝐵 ↔ ∀𝑥(𝑥 = 𝐵 → 𝐴 ∈ 𝐵))) |
6 | eleq2 2821 | . . . . 5 ⊢ (𝑥 = 𝐵 → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ 𝐵)) | |
7 | 6 | bicomd 222 | . . . 4 ⊢ (𝑥 = 𝐵 → (𝐴 ∈ 𝐵 ↔ 𝐴 ∈ 𝑥)) |
8 | 7 | pm5.74i 271 | . . 3 ⊢ ((𝑥 = 𝐵 → 𝐴 ∈ 𝐵) ↔ (𝑥 = 𝐵 → 𝐴 ∈ 𝑥)) |
9 | 8 | albii 1820 | . 2 ⊢ (∀𝑥(𝑥 = 𝐵 → 𝐴 ∈ 𝐵) ↔ ∀𝑥(𝑥 = 𝐵 → 𝐴 ∈ 𝑥)) |
10 | 5, 9 | bitrdi 287 | 1 ⊢ (𝐵 ∈ 𝑉 → (𝐴 ∈ 𝐵 ↔ ∀𝑥(𝑥 = 𝐵 → 𝐴 ∈ 𝑥))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∀wal 1538 = wceq 1540 ∃wex 1780 ∈ wcel 2105 |
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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-ext 2702 |
This theorem depends on definitions: df-bi 206 df-an 396 df-tru 1543 df-ex 1781 df-sb 2067 df-clab 2709 df-cleq 2723 df-clel 2809 |
This theorem is referenced by: clel4 3653 intprg 4985 |
Copyright terms: Public domain | W3C validator |