Theorem csbiedf 3881

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 418	. . 3 ⊢ (𝜑 → (𝑥 = 𝐴 → 𝐵 = 𝐶))
4	1, 3	alrimi 2253	. 2 ⊢ (𝜑 → ∀𝑥(𝑥 = 𝐴 → 𝐵 = 𝐶))
5		csbiedf.3	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
6		csbiedf.2	. . 3 ⊢ (𝜑 → Ⅎ𝑥𝐶)
7		csbiebt 3880	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ Ⅎ𝑥𝐶) → (∀𝑥(𝑥 = 𝐴 → 𝐵 = 𝐶) ↔ ⦋𝐴 / 𝑥⦌𝐵 = 𝐶))
8	5, 6, 7	syl2anc 596	. 2 ⊢ (𝜑 → (∀𝑥(𝑥 = 𝐴 → 𝐵 = 𝐶) ↔ ⦋𝐴 / 𝑥⦌𝐵 = 𝐶))
9	4, 8	mpbid 235	1 ⊢ (𝜑 → ⦋𝐴 / 𝑥⦌𝐵 = 𝐶)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2147  Ⅎwnfc 2911  ⦋csb 3851

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-v 3456  df-sbc 3743  df-csb 3852

This theorem is used by:  csbie2t  3889  fvmptdf  7031  fsumsplit1  15955  fprodsplit1f  16201  natpropd  18204  fucpropd  18205  gsummptf1o  20228  gsummpt2d  33709  gsummptf1od  33715  gsummptfsf1o  33720  mnringvald  45472  sumsnd  46317