Theorem csbie2t 3920

Description: Conversion of implicit substitution to explicit substitution into a class (closed form of csbie2 3921). (Contributed by NM, 3-Sep-2007.) (Revised by Mario Carneiro, 13-Oct-2016.)

Hypotheses

Ref	Expression
csbie2t.1	⊢ 𝐴 ∈ V
csbie2t.2	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
csbie2t	⊢ (∀𝑥∀𝑦((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝐶 = 𝐷) → ⦋𝐴 / 𝑥⦌⦋𝐵 / 𝑦⦌𝐶 = 𝐷)

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐷,𝑦

Allowed substitution hints:   𝐶(𝑥,𝑦)

Proof of Theorem csbie2t

Step	Hyp	Ref	Expression
1		nfa1 2151	. 2 ⊢ Ⅎ𝑥∀𝑥∀𝑦((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝐶 = 𝐷)
2		nfcvd 2978	. 2 ⊢ (∀𝑥∀𝑦((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝐶 = 𝐷) → Ⅎ𝑥𝐷)
3		csbie2t.1	. . 3 ⊢ 𝐴 ∈ V
4	3	a1i 11	. 2 ⊢ (∀𝑥∀𝑦((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝐶 = 𝐷) → 𝐴 ∈ V)
5		nfa2 2172	. . . 4 ⊢ Ⅎ𝑦∀𝑥∀𝑦((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝐶 = 𝐷)
6		nfv 1911	. . . 4 ⊢ Ⅎ𝑦 𝑥 = 𝐴
7	5, 6	nfan 1896	. . 3 ⊢ Ⅎ𝑦(∀𝑥∀𝑦((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝐶 = 𝐷) ∧ 𝑥 = 𝐴)
8		nfcvd 2978	. . 3 ⊢ ((∀𝑥∀𝑦((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝐶 = 𝐷) ∧ 𝑥 = 𝐴) → Ⅎ𝑦𝐷)
9		csbie2t.2	. . . 4 ⊢ 𝐵 ∈ V
10	9	a1i 11	. . 3 ⊢ ((∀𝑥∀𝑦((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝐶 = 𝐷) ∧ 𝑥 = 𝐴) → 𝐵 ∈ V)
11		2sp 2181	. . . 4 ⊢ (∀𝑥∀𝑦((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝐶 = 𝐷) → ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝐶 = 𝐷))
12	11	impl 458	. . 3 ⊢ (((∀𝑥∀𝑦((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝐶 = 𝐷) ∧ 𝑥 = 𝐴) ∧ 𝑦 = 𝐵) → 𝐶 = 𝐷)
13	7, 8, 10, 12	csbiedf 3912	. 2 ⊢ ((∀𝑥∀𝑦((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝐶 = 𝐷) ∧ 𝑥 = 𝐴) → ⦋𝐵 / 𝑦⦌𝐶 = 𝐷)
14	1, 2, 4, 13	csbiedf 3912	1 ⊢ (∀𝑥∀𝑦((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → 𝐶 = 𝐷) → ⦋𝐴 / 𝑥⦌⦋𝐵 / 𝑦⦌𝐶 = 𝐷)

Syntax hints:   → wi 4   ∧ wa 398  ∀wal 1531   = wceq 1533   ∈ wcel 2110  Vcvv 3494  ⦋csb 3882

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-v 3496  df-sbc 3772  df-csb 3883

This theorem is referenced by:  csbie2  3921