| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Equivalence for substitution. |
| Ref | Expression |
|---|---|
| sb6a |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sb6 1266 |
. 2
| |
| 2 | sbequ12 1180 |
. . . . 5
| |
| 3 | 2 | equcoms 1129 |
. . . 4
|
| 4 | 3 | pm5.74i 583 |
. . 3
|
| 5 | 4 | albii 998 |
. 2
|
| 6 | 1, 5 | bitr 173 |
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-gen 962 ax-8 963 ax-12 967 ax-4 972 ax-5o 974 ax-6o 977 ax-9o 1122 ax-16 1209 ax-11o 1217 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 980 df-sb 1171 |