Theorem sbcbr 5166

Description: Move substitution in and out of a binary relation. (Contributed by NM, 23-Aug-2018.)

Assertion

Ref	Expression
sbcbr	⊢ ([𝐴 / 𝑥]𝐵𝑅𝐶 ↔ 𝐵⦋𝐴 / 𝑥⦌𝑅𝐶)

Distinct variable groups:   𝑥,𝐵   𝑥,𝐶

Allowed substitution hints:   𝐴(𝑥)   𝑅(𝑥)

Proof of Theorem sbcbr

Step	Hyp	Ref	Expression
1		sbcbr123 5165	. 2 ⊢ ([𝐴 / 𝑥]𝐵𝑅𝐶 ↔ ⦋𝐴 / 𝑥⦌𝐵⦋𝐴 / 𝑥⦌𝑅⦋𝐴 / 𝑥⦌𝐶)
2		csbconstg 3872	. . . 4 ⊢ (𝐴 ∈ V → ⦋𝐴 / 𝑥⦌𝐵 = 𝐵)
3		csbconstg 3872	. . . 4 ⊢ (𝐴 ∈ V → ⦋𝐴 / 𝑥⦌𝐶 = 𝐶)
4	2, 3	breq12d 5122	. . 3 ⊢ (𝐴 ∈ V → (⦋𝐴 / 𝑥⦌𝐵⦋𝐴 / 𝑥⦌𝑅⦋𝐴 / 𝑥⦌𝐶 ↔ 𝐵⦋𝐴 / 𝑥⦌𝑅𝐶))
5		br0 5160	. . . . 5 ⊢ ¬ ⦋𝐴 / 𝑥⦌𝐵∅⦋𝐴 / 𝑥⦌𝐶
6		csbprc 4374	. . . . . 6 ⊢ (¬ 𝐴 ∈ V → ⦋𝐴 / 𝑥⦌𝑅 = ∅)
7	6	breqd 5120	. . . . 5 ⊢ (¬ 𝐴 ∈ V → (⦋𝐴 / 𝑥⦌𝐵⦋𝐴 / 𝑥⦌𝑅⦋𝐴 / 𝑥⦌𝐶 ↔ ⦋𝐴 / 𝑥⦌𝐵∅⦋𝐴 / 𝑥⦌𝐶))
8	5, 7	mtbiri 330	. . . 4 ⊢ (¬ 𝐴 ∈ V → ¬ ⦋𝐴 / 𝑥⦌𝐵⦋𝐴 / 𝑥⦌𝑅⦋𝐴 / 𝑥⦌𝐶)
9		br0 5160	. . . . 5 ⊢ ¬ 𝐵∅𝐶
10	6	breqd 5120	. . . . 5 ⊢ (¬ 𝐴 ∈ V → (𝐵⦋𝐴 / 𝑥⦌𝑅𝐶 ↔ 𝐵∅𝐶))
11	9, 10	mtbiri 330	. . . 4 ⊢ (¬ 𝐴 ∈ V → ¬ 𝐵⦋𝐴 / 𝑥⦌𝑅𝐶)
12	8, 11	2falsed 379	. . 3 ⊢ (¬ 𝐴 ∈ V → (⦋𝐴 / 𝑥⦌𝐵⦋𝐴 / 𝑥⦌𝑅⦋𝐴 / 𝑥⦌𝐶 ↔ 𝐵⦋𝐴 / 𝑥⦌𝑅𝐶))
13	4, 12	pm2.61i 184	. 2 ⊢ (⦋𝐴 / 𝑥⦌𝐵⦋𝐴 / 𝑥⦌𝑅⦋𝐴 / 𝑥⦌𝐶 ↔ 𝐵⦋𝐴 / 𝑥⦌𝑅𝐶)
14	1, 13	bitri 278	1 ⊢ ([𝐴 / 𝑥]𝐵𝑅𝐶 ↔ 𝐵⦋𝐴 / 𝑥⦌𝑅𝐶)

Syntax hints:  ¬ wn 3   ↔ wb 209   ∈ wcel 2143  Vcvv 3455  [wsbc 3744  ⦋csb 3853  ∅c0 4286   class class class wbr 5109

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-br 5110

This theorem is referenced by:  csbcnv  5872  csbcnvOLD  5873