| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Move substitution in and out of a binary relation. |
| Ref | Expression |
|---|---|
| sbcbr1g |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbcbr12g 2668 |
. 2
| |
| 2 | ax-17 973 |
. . . 4
| |
| 3 | 2 | csbconstgf 2013 |
. . 3
|
| 4 | 3 | breq2d 2635 |
. 2
|
| 5 | 1, 4 | bitrd 530 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 964 ax-gen 965 ax-8 966 ax-9 967 ax-10 968 ax-11 969 ax-12 970 ax-17 973 ax-4 975 ax-5o 977 ax-6o 980 ax-9o 1125 ax-10o 1142 ax-16 1212 ax-11o 1220 ax-ext 1462 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-3an 779 df-ex 983 df-sb 1174 df-clab 1467 df-cleq 1472 df-clel 1475 df-v 1815 df-sbc 1945 df-csb 2005 df-un 2053 df-sn 2416 df-pr 2417 df-op 2420 df-br 2625 |