| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: An idempotent law for substitution. |
| Ref | Expression |
|---|---|
| sbidm |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbequ12 1164 |
. . . 4
| |
| 2 | 1 | bicomd 519 |
. . 3
|
| 3 | 2 | a4s 960 |
. 2
|
| 4 | hbnae 1130 |
. . 3
| |
| 5 | hbsb2 1211 |
. . 3
| |
| 6 | pm4.2i 171 |
. . . 4
| |
| 7 | 6 | a1i 8 |
. . 3
|
| 8 | 4, 5, 7 | sbied 1178 |
. 2
|
| 9 | 3, 8 | pm2.61i 126 |
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-4 951 ax-5 952 ax-6 953 ax-7 954 ax-gen 955 ax-8 1101 ax-9 1102 ax-10 1103 ax-12 1104 ax-11o 1202 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 957 df-sb 1155 |