| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sbcbr2g | Structured version Visualization version GIF version | ||
| Description: Move substitution in and out of a binary relation. (Contributed by NM, 13-Dec-2005.) |
| Ref | Expression |
|---|---|
| sbcbr2g | ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝐵𝑅𝐶 ↔ 𝐵𝑅⦋𝐴 / 𝑥⦌𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbcbr12g 5165 | . 2 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝐵𝑅𝐶 ↔ ⦋𝐴 / 𝑥⦌𝐵𝑅⦋𝐴 / 𝑥⦌𝐶)) | |
| 2 | csbconstg 3869 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌𝐵 = 𝐵) | |
| 3 | 2 | breq1d 5117 | . 2 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌𝐵𝑅⦋𝐴 / 𝑥⦌𝐶 ↔ 𝐵𝑅⦋𝐴 / 𝑥⦌𝐶)) |
| 4 | 1, 3 | bitrd 282 | 1 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝐵𝑅𝐶 ↔ 𝐵𝑅⦋𝐴 / 𝑥⦌𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∈ wcel 2145 [wsbc 3742 ⦋csb 3850 class class class wbr 5107 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-br 5108 |
| This theorem is used by: prmgaplem7 17155 telgsums 20126 fvmptnn04if 23080 bnj110 35375 frege124d 44609 frege72 44783 frege91 44802 frege116 44827 frege120 44831 |
| Copyright terms: Public domain | W3C validator |