Theorem bj-sbceqgALT 34343

Description: Distribute proper substitution through an equality relation. Alternate proof of sbceqg 4317. (Contributed by BJ, 6-Oct-2018.) Proof modification is discouraged to avoid using sbceqg 4317, but the Metamath program "MM-PA> MINIMIZE_WITH * / EXCEPT sbceqg" command is ok. (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
bj-sbceqgALT	⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝐵 = 𝐶 ↔ ⦋𝐴 / 𝑥⦌𝐵 = ⦋𝐴 / 𝑥⦌𝐶))

Proof of Theorem bj-sbceqgALT

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfcleq 2792	. . . . . 6 ⊢ (𝐵 = 𝐶 ↔ ∀𝑦(𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶))
2	1	sbcth 3735	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → [𝐴 / 𝑥](𝐵 = 𝐶 ↔ ∀𝑦(𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶)))
3		sbcbig 3770	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥](𝐵 = 𝐶 ↔ ∀𝑦(𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶)) ↔ ([𝐴 / 𝑥]𝐵 = 𝐶 ↔ [𝐴 / 𝑥]∀𝑦(𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶))))
4	2, 3	mpbid 235	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝐵 = 𝐶 ↔ [𝐴 / 𝑥]∀𝑦(𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶)))
5		sbcal 3780	. . . 4 ⊢ ([𝐴 / 𝑥]∀𝑦(𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶) ↔ ∀𝑦[𝐴 / 𝑥](𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶))
6	4, 5	syl6bb 290	. . 3 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝐵 = 𝐶 ↔ ∀𝑦[𝐴 / 𝑥](𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶)))
7		sbcbig 3770	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥](𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶) ↔ ([𝐴 / 𝑥]𝑦 ∈ 𝐵 ↔ [𝐴 / 𝑥]𝑦 ∈ 𝐶)))
8	7	albidv 1921	. . 3 ⊢ (𝐴 ∈ 𝑉 → (∀𝑦[𝐴 / 𝑥](𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶) ↔ ∀𝑦([𝐴 / 𝑥]𝑦 ∈ 𝐵 ↔ [𝐴 / 𝑥]𝑦 ∈ 𝐶)))
9		sbcel2 4323	. . . . . 6 ⊢ ([𝐴 / 𝑥]𝑦 ∈ 𝐵 ↔ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵)
10	9	a1i 11	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑦 ∈ 𝐵 ↔ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵))
11		sbcel2 4323	. . . . . 6 ⊢ ([𝐴 / 𝑥]𝑦 ∈ 𝐶 ↔ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶)
12	11	a1i 11	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑦 ∈ 𝐶 ↔ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶))
13	10, 12	bibi12d 349	. . . 4 ⊢ (𝐴 ∈ 𝑉 → (([𝐴 / 𝑥]𝑦 ∈ 𝐵 ↔ [𝐴 / 𝑥]𝑦 ∈ 𝐶) ↔ (𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵 ↔ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶)))
14	13	albidv 1921	. . 3 ⊢ (𝐴 ∈ 𝑉 → (∀𝑦([𝐴 / 𝑥]𝑦 ∈ 𝐵 ↔ [𝐴 / 𝑥]𝑦 ∈ 𝐶) ↔ ∀𝑦(𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵 ↔ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶)))
15	6, 8, 14	3bitrd 308	. 2 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝐵 = 𝐶 ↔ ∀𝑦(𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵 ↔ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶)))
16		dfcleq 2792	. 2 ⊢ (⦋𝐴 / 𝑥⦌𝐵 = ⦋𝐴 / 𝑥⦌𝐶 ↔ ∀𝑦(𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵 ↔ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶))
17	15, 16	syl6bbr 292	1 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝐵 = 𝐶 ↔ ⦋𝐴 / 𝑥⦌𝐵 = ⦋𝐴 / 𝑥⦌𝐶))

Syntax hints:   → wi 4   ↔ wb 209  ∀wal 1536   = wceq 1538   ∈ wcel 2111  [wsbc 3720  ⦋csb 3828

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-nul 4244

This theorem is referenced by: (None)