| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Move substitution in and out of a binary relation. |
| Ref | Expression |
|---|---|
| sbcbr2g |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbcbr12g 2678 |
. 2
| |
| 2 | ax-17 975 |
. . . 4
| |
| 3 | 2 | csbconstgf 2021 |
. . 3
|
| 4 | 3 | breq1d 2644 |
. 2
|
| 5 | 1, 4 | bitrd 531 |
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 966 ax-gen 967 ax-8 968 ax-9 969 ax-10 970 ax-11 971 ax-12 972 ax-17 975 ax-4 977 ax-5o 979 ax-6o 982 ax-9o 1127 ax-10o 1144 ax-16 1214 ax-11o 1222 ax-ext 1464 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-3an 781 df-ex 985 df-sb 1176 df-clab 1470 df-cleq 1475 df-clel 1478 df-v 1819 df-sbc 1949 df-csb 2012 df-un 2061 df-sn 2424 df-pr 2425 df-op 2428 df-br 2635 |