Theorem sbcie2g 3463

Description: Conversion of implicit substitution to explicit class substitution. This version of sbcie 3464 avoids a disjointness condition on 𝑥, 𝐴 by substituting twice. (Contributed by Mario Carneiro, 15-Oct-2016.)

Hypotheses

Ref	Expression
sbcie2g.1	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
sbcie2g.2	⊢ (𝑦 = 𝐴 → (𝜓 ↔ 𝜒))

Assertion

Ref	Expression
sbcie2g	⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝜑 ↔ 𝜒))

Distinct variable groups:   𝑥,𝑦   𝑦,𝐴   𝜒,𝑦   𝜑,𝑦   𝜓,𝑥

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝜒(𝑥)   𝐴(𝑥)   𝑉(𝑥,𝑦)

Proof of Theorem sbcie2g

Step	Hyp	Ref	Expression
1		dfsbcq 3431	. 2 ⊢ (𝑦 = 𝐴 → ([𝑦 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑))
2		sbcie2g.2	. 2 ⊢ (𝑦 = 𝐴 → (𝜓 ↔ 𝜒))
3		sbsbc 3433	. . 3 ⊢ ([𝑦 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑)
4		nfv 1841	. . . 4 ⊢ Ⅎ𝑥𝜓
5		sbcie2g.1	. . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
6	4, 5	sbie 2406	. . 3 ⊢ ([𝑦 / 𝑥]𝜑 ↔ 𝜓)
7	3, 6	bitr3i 266	. 2 ⊢ ([𝑦 / 𝑥]𝜑 ↔ 𝜓)
8	1, 2, 7	vtoclbg 3262	1 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝜑 ↔ 𝜒))

Syntax hints:   → wi 4   ↔ wb 196   = wceq 1481  [wsb 1878   ∈ wcel 1988  [wsbc 3429

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1720  ax-4 1735  ax-5 1837  ax-6 1886  ax-7 1933  ax-9 1997  ax-10 2017  ax-12 2045  ax-13 2244  ax-ext 2600

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1484  df-ex 1703  df-nf 1708  df-sb 1879  df-clab 2607  df-cleq 2613  df-clel 2616  df-v 3197  df-sbc 3430

This theorem is referenced by:  sbcel2gv  3490  csbie2g  3557  brab1  4691  bnj90  30762  bnj124  30915  riotasvd  34061