Theorem bj-sbceqgALT 34708

Description: Distribute proper substitution through an equality relation. Alternate proof of sbceqg 4296. (Contributed by BJ, 6-Oct-2018.) Proof modification is discouraged to avoid using sbceqg 4296, 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 2731	. . . . . 6 ⊢ (𝐵 = 𝐶 ↔ ∀𝑦(𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶))
2	1	sbcth 3694	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → [𝐴 / 𝑥](𝐵 = 𝐶 ↔ ∀𝑦(𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶)))
3		sbcbig 3730	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥](𝐵 = 𝐶 ↔ ∀𝑦(𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶)) ↔ ([𝐴 / 𝑥]𝐵 = 𝐶 ↔ [𝐴 / 𝑥]∀𝑦(𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶))))
4	2, 3	mpbid 235	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝐵 = 𝐶 ↔ [𝐴 / 𝑥]∀𝑦(𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶)))
5		sbcal 3740	. . . 4 ⊢ ([𝐴 / 𝑥]∀𝑦(𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶) ↔ ∀𝑦[𝐴 / 𝑥](𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶))
6	4, 5	bitrdi 290	. . 3 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝐵 = 𝐶 ↔ ∀𝑦[𝐴 / 𝑥](𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶)))
7		sbcbig 3730	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥](𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶) ↔ ([𝐴 / 𝑥]𝑦 ∈ 𝐵 ↔ [𝐴 / 𝑥]𝑦 ∈ 𝐶)))
8	7	albidv 1926	. . 3 ⊢ (𝐴 ∈ 𝑉 → (∀𝑦[𝐴 / 𝑥](𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶) ↔ ∀𝑦([𝐴 / 𝑥]𝑦 ∈ 𝐵 ↔ [𝐴 / 𝑥]𝑦 ∈ 𝐶)))
9		sbcel2 4302	. . . . . 6 ⊢ ([𝐴 / 𝑥]𝑦 ∈ 𝐵 ↔ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵)
10	9	a1i 11	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑦 ∈ 𝐵 ↔ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵))
11		sbcel2 4302	. . . . . 6 ⊢ ([𝐴 / 𝑥]𝑦 ∈ 𝐶 ↔ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶)
12	11	a1i 11	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝑦 ∈ 𝐶 ↔ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶))
13	10, 12	bibi12d 349	. . . 4 ⊢ (𝐴 ∈ 𝑉 → (([𝐴 / 𝑥]𝑦 ∈ 𝐵 ↔ [𝐴 / 𝑥]𝑦 ∈ 𝐶) ↔ (𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵 ↔ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶)))
14	13	albidv 1926	. . 3 ⊢ (𝐴 ∈ 𝑉 → (∀𝑦([𝐴 / 𝑥]𝑦 ∈ 𝐵 ↔ [𝐴 / 𝑥]𝑦 ∈ 𝐶) ↔ ∀𝑦(𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵 ↔ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶)))
15	6, 8, 14	3bitrd 308	. 2 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝐵 = 𝐶 ↔ ∀𝑦(𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵 ↔ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶)))
16		dfcleq 2731	. 2 ⊢ (⦋𝐴 / 𝑥⦌𝐵 = ⦋𝐴 / 𝑥⦌𝐶 ↔ ∀𝑦(𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐵 ↔ 𝑦 ∈ ⦋𝐴 / 𝑥⦌𝐶))
17	15, 16	bitr4di 292	1 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝐵 = 𝐶 ↔ ⦋𝐴 / 𝑥⦌𝐵 = ⦋𝐴 / 𝑥⦌𝐶))

Syntax hints:   → wi 4   ↔ wb 209  ∀wal 1540   = wceq 1542   ∈ wcel 2113  [wsbc 3679  ⦋csb 3788

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1916  ax-6 1974  ax-7 2019  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2161  ax-12 2178  ax-ext 2710

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2074  df-clab 2717  df-cleq 2730  df-clel 2811  df-nfc 2881  df-v 3399  df-sbc 3680  df-csb 3789  df-dif 3844  df-nul 4210

This theorem is referenced by: (None)