Theorem sbcbr 5170

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 5169	. 2 ⊢ ([𝐴 / 𝑥]𝐵𝑅𝐶 ↔ ⦋𝐴 / 𝑥⦌𝐵⦋𝐴 / 𝑥⦌𝑅⦋𝐴 / 𝑥⦌𝐶)
2		csbconstg 3880	. . . 4 ⊢ (𝐴 ∈ V → ⦋𝐴 / 𝑥⦌𝐵 = 𝐵)
3		csbconstg 3880	. . . 4 ⊢ (𝐴 ∈ V → ⦋𝐴 / 𝑥⦌𝐶 = 𝐶)
4	2, 3	breq12d 5126	. . 3 ⊢ (𝐴 ∈ V → (⦋𝐴 / 𝑥⦌𝐵⦋𝐴 / 𝑥⦌𝑅⦋𝐴 / 𝑥⦌𝐶 ↔ 𝐵⦋𝐴 / 𝑥⦌𝑅𝐶))
5		br0 5164	. . . . 5 ⊢ ¬ ⦋𝐴 / 𝑥⦌𝐵∅⦋𝐴 / 𝑥⦌𝐶
6		csbprc 4380	. . . . . 6 ⊢ (¬ 𝐴 ∈ V → ⦋𝐴 / 𝑥⦌𝑅 = ∅)
7	6	breqd 5124	. . . . 5 ⊢ (¬ 𝐴 ∈ V → (⦋𝐴 / 𝑥⦌𝐵⦋𝐴 / 𝑥⦌𝑅⦋𝐴 / 𝑥⦌𝐶 ↔ ⦋𝐴 / 𝑥⦌𝐵∅⦋𝐴 / 𝑥⦌𝐶))
8	5, 7	mtbiri 330	. . . 4 ⊢ (¬ 𝐴 ∈ V → ¬ ⦋𝐴 / 𝑥⦌𝐵⦋𝐴 / 𝑥⦌𝑅⦋𝐴 / 𝑥⦌𝐶)
9		br0 5164	. . . . 5 ⊢ ¬ 𝐵∅𝐶
10	6	breqd 5124	. . . . 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 2149  Vcvv 3463  [wsbc 3753  ⦋csb 3861  ∅c0 4294   class class class wbr 5113

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5114

This theorem is referenced by:  csbcnv  5873  csbcnvOLD  5874