Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sbcbr1g | Structured version Visualization version GIF version |
Description: Move substitution in and out of a binary relation. (Contributed by NM, 13-Dec-2005.) |
Ref | Expression |
---|---|
sbcbr1g | ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝐵𝑅𝐶 ↔ ⦋𝐴 / 𝑥⦌𝐵𝑅𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sbcbr12g 5121 | . 2 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝐵𝑅𝐶 ↔ ⦋𝐴 / 𝑥⦌𝐵𝑅⦋𝐴 / 𝑥⦌𝐶)) | |
2 | csbconstg 3901 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌𝐶 = 𝐶) | |
3 | 2 | breq2d 5077 | . 2 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌𝐵𝑅⦋𝐴 / 𝑥⦌𝐶 ↔ ⦋𝐴 / 𝑥⦌𝐵𝑅𝐶)) |
4 | 1, 3 | bitrd 281 | 1 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑥]𝐵𝑅𝐶 ↔ ⦋𝐴 / 𝑥⦌𝐵𝑅𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∈ wcel 2110 [wsbc 3771 ⦋csb 3882 class class class wbr 5065 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-fal 1546 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4567 df-pr 4569 df-op 4573 df-br 5066 |
This theorem is referenced by: iscard4 39898 frege124d 40104 frege70 40277 frege92 40299 frege118 40325 |
Copyright terms: Public domain | W3C validator |