Theorem csbiedf 3778

Description: Conversion of implicit substitution to explicit substitution into a class. (Contributed by Mario Carneiro, 13-Oct-2016.)

Hypotheses

Ref	Expression
csbiedf.1	⊢ Ⅎ𝑥𝜑
csbiedf.2	⊢ (𝜑 → Ⅎ𝑥𝐶)
csbiedf.3	⊢ (𝜑 → 𝐴 ∈ 𝑉)
csbiedf.4	⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 = 𝐶)

Assertion

Ref	Expression
csbiedf	⊢ (𝜑 → ⦋𝐴 / 𝑥⦌𝐵 = 𝐶)

Distinct variable group:   𝑥,𝐴

Allowed substitution hints:   𝜑(𝑥)   𝐵(𝑥)   𝐶(𝑥)   𝑉(𝑥)

Proof of Theorem csbiedf

Step	Hyp	Ref	Expression
1		csbiedf.1	. . 3 ⊢ Ⅎ𝑥𝜑
2		csbiedf.4	. . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 = 𝐶)
3	2	ex 403	. . 3 ⊢ (𝜑 → (𝑥 = 𝐴 → 𝐵 = 𝐶))
4	1, 3	alrimi 2256	. 2 ⊢ (𝜑 → ∀𝑥(𝑥 = 𝐴 → 𝐵 = 𝐶))
5		csbiedf.3	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
6		csbiedf.2	. . 3 ⊢ (𝜑 → Ⅎ𝑥𝐶)
7		csbiebt 3777	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ Ⅎ𝑥𝐶) → (∀𝑥(𝑥 = 𝐴 → 𝐵 = 𝐶) ↔ ⦋𝐴 / 𝑥⦌𝐵 = 𝐶))
8	5, 6, 7	syl2anc 579	. 2 ⊢ (𝜑 → (∀𝑥(𝑥 = 𝐴 → 𝐵 = 𝐶) ↔ ⦋𝐴 / 𝑥⦌𝐵 = 𝐶))
9	4, 8	mpbid 224	1 ⊢ (𝜑 → ⦋𝐴 / 𝑥⦌𝐵 = 𝐶)

Syntax hints:   → wi 4   ↔ wb 198   ∧ wa 386  ∀wal 1654   = wceq 1656  Ⅎwnf 1882   ∈ wcel 2164  Ⅎwnfc 2956  ⦋csb 3757

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1894  ax-4 1908  ax-5 2009  ax-6 2075  ax-7 2112  ax-9 2173  ax-10 2192  ax-11 2207  ax-12 2220  ax-13 2389  ax-ext 2803

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 879  df-3an 1113  df-tru 1660  df-ex 1879  df-nf 1883  df-sb 2068  df-clab 2812  df-cleq 2818  df-clel 2821  df-nfc 2958  df-v 3416  df-sbc 3663  df-csb 3758

This theorem is referenced by:  csbied  3784  csbie2t  3786  fprodsplit1f  15100  natpropd  16995  fucpropd  16996  gsummptf1o  18722  gsummpt2d  30322  sumsnd  39998  fsumsplit1  40593