| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: An idempotent law for substitution. |
| Ref | Expression |
|---|---|
| sbidm |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbequ12 1181 |
. . . 4
| |
| 2 | 1 | bicomd 521 |
. . 3
|
| 3 | 2 | a4s 984 |
. 2
|
| 4 | hbnae 1147 |
. . 3
| |
| 5 | hbsb2 1227 |
. . 3
| |
| 6 | pm4.2d 171 |
. . . 4
| |
| 7 | 6 | a1i 8 |
. . 3
|
| 8 | 4, 5, 7 | sbied 1195 |
. 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-7 962 ax-gen 963 ax-10 966 ax-12 968 ax-4 973 ax-5o 975 ax-6o 978 ax-9o 1123 ax-10o 1140 ax-11o 1218 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 981 df-sb 1172 |