Theorem bj-sbel1 37892

Description: Version of sbcel1g 4373 when substituting a set. (Note: one could have a corresponding version of sbcel12 4368 when substituting a set, but the point here is that the antecedent of sbcel1g 4373 is not needed when substituting a set.) (Contributed by BJ, 6-Oct-2018.)

Assertion

Ref	Expression
bj-sbel1	⊢ ([𝑦 / 𝑥]𝐴 ∈ 𝐵 ↔ ⦋𝑦 / 𝑥⦌𝐴 ∈ 𝐵)

Distinct variable group:   𝑥,𝐵

Allowed substitution hints:   𝐴(𝑥, 𝑦)   𝐵(𝑦)

Proof of Theorem bj-sbel1

Step	Hyp	Ref	Expression
1		sbsbc 3742	. 2 ⊢ ([𝑦 / 𝑥]𝐴 ∈ 𝐵 ↔ [𝑦 / 𝑥]𝐴 ∈ 𝐵)
2		sbcel1g 4373	. . 3 ⊢ (𝑦 ∈ V → ([𝑦 / 𝑥]𝐴 ∈ 𝐵 ↔ ⦋𝑦 / 𝑥⦌𝐴 ∈ 𝐵))
3	2	elv 3455	. 2 ⊢ ([𝑦 / 𝑥]𝐴 ∈ 𝐵 ↔ ⦋𝑦 / 𝑥⦌𝐴 ∈ 𝐵)
4	1, 3	bitri 278	1 ⊢ ([𝑦 / 𝑥]𝐴 ∈ 𝐵 ↔ ⦋𝑦 / 𝑥⦌𝐴 ∈ 𝐵)

This proof depends on syntax axioms:   ↔ wb 209  [wsb 2098   ∈ wcel 2144  Vcvv 3450  [wsbc 3738  ⦋csb 3846

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 4047  df-nul 4279

This theorem is used by:  bj-snsetex  37951