Theorem clel2g 3647

Description: Alternate definition of membership when the member is a set. (Contributed by NM, 18-Aug-1993.) Strengthen from sethood hypothesis to sethood antecedent. (Revised by BJ, 12-Feb-2022.) Avoid ax-12 2170. (Revised by BJ, 1-Sep-2024.)

Assertion

Ref	Expression
clel2g	⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ 𝐵 ↔ ∀𝑥(𝑥 = 𝐴 → 𝑥 ∈ 𝐵)))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem clel2g

Step	Hyp	Ref	Expression
1		elisset 2814	. . 3 ⊢ (𝐴 ∈ 𝑉 → ∃𝑥 𝑥 = 𝐴)
2		biimt 360	. . 3 ⊢ (∃𝑥 𝑥 = 𝐴 → (𝐴 ∈ 𝐵 ↔ (∃𝑥 𝑥 = 𝐴 → 𝐴 ∈ 𝐵)))
3	1, 2	syl 17	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ 𝐵 ↔ (∃𝑥 𝑥 = 𝐴 → 𝐴 ∈ 𝐵)))
4		19.23v 1944	. . 3 ⊢ (∀𝑥(𝑥 = 𝐴 → 𝐴 ∈ 𝐵) ↔ (∃𝑥 𝑥 = 𝐴 → 𝐴 ∈ 𝐵))
5		eleq1 2820	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵))
6	5	bicomd 222	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝐴 ∈ 𝐵 ↔ 𝑥 ∈ 𝐵))
7	6	pm5.74i 271	. . . 4 ⊢ ((𝑥 = 𝐴 → 𝐴 ∈ 𝐵) ↔ (𝑥 = 𝐴 → 𝑥 ∈ 𝐵))
8	7	albii 1820	. . 3 ⊢ (∀𝑥(𝑥 = 𝐴 → 𝐴 ∈ 𝐵) ↔ ∀𝑥(𝑥 = 𝐴 → 𝑥 ∈ 𝐵))
9	4, 8	bitr3i 277	. 2 ⊢ ((∃𝑥 𝑥 = 𝐴 → 𝐴 ∈ 𝐵) ↔ ∀𝑥(𝑥 = 𝐴 → 𝑥 ∈ 𝐵))
10	3, 9	bitrdi 287	1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ 𝐵 ↔ ∀𝑥(𝑥 = 𝐴 → 𝑥 ∈ 𝐵)))

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:  clel2  3649  snssgOLD  4788