Theorem clelsb1f 2912

Description: Substitution for the first argument of the membership predicate in an atomic formula (class version of elsb1 2114). Usage of this theorem is discouraged because it depends on ax-13 2372. See clelsb1fw 2911 not requiring ax-13 2372, but extra disjoint variables. (Contributed by Rodolfo Medina, 28-Apr-2010.) (Proof shortened by Andrew Salmon, 14-Jun-2011.) (Revised by Thierry Arnoux, 13-Mar-2017.) (Proof shortened by Wolf Lammen, 7-May-2023.) (New usage is discouraged.)

Hypothesis

Ref	Expression
clelsb1f.1	⊢ Ⅎ𝑥𝐴

Assertion

Ref	Expression
clelsb1f	⊢ ([𝑦 / 𝑥]𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)

Proof of Theorem clelsb1f

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		clelsb1f.1	. . . 4 ⊢ Ⅎ𝑥𝐴
2	1	nfcri 2894	. . 3 ⊢ Ⅎ𝑥 𝑤 ∈ 𝐴
3	2	sbco2 2515	. 2 ⊢ ([𝑦 / 𝑥][𝑥 / 𝑤]𝑤 ∈ 𝐴 ↔ [𝑦 / 𝑤]𝑤 ∈ 𝐴)
4		clelsb1 2866	. . 3 ⊢ ([𝑥 / 𝑤]𝑤 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴)
5	4	sbbii 2079	. 2 ⊢ ([𝑦 / 𝑥][𝑥 / 𝑤]𝑤 ∈ 𝐴 ↔ [𝑦 / 𝑥]𝑥 ∈ 𝐴)
6		clelsb1 2866	. 2 ⊢ ([𝑦 / 𝑤]𝑤 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)
7	3, 5, 6	3bitr3i 301	1 ⊢ ([𝑦 / 𝑥]𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)

Syntax hints:   ↔ wb 205  [wsb 2067   ∈ wcel 2106  Ⅎwnfc 2887

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-10 2137  ax-11 2154  ax-12 2171  ax-13 2372

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-tru 1542  df-ex 1783  df-nf 1787  df-sb 2068  df-clel 2816  df-nfc 2889

This theorem is referenced by: (None)