| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Two ways to express
substitution of |
| Ref | Expression |
|---|---|
| alexeq.1 |
|
| Ref | Expression |
|---|---|
| alexeq |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | alexeq.1 |
. . 3
| |
| 2 | eqeq2 1487 |
. . . . 5
| |
| 3 | 2 | anbi1d 619 |
. . . 4
|
| 4 | 3 | exbidv 1281 |
. . 3
|
| 5 | 2 | imbi1d 615 |
. . . 4
|
| 6 | 5 | albidv 1280 |
. . 3
|
| 7 | sb56 1268 |
. . 3
| |
| 8 | 1, 4, 6, 7 | vtoclb 1848 |
. 2
|
| 9 | 8 | bicomi 172 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: ceqex 1889 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-gen 965 ax-12 970 ax-17 973 ax-4 975 ax-5o 977 ax-6o 980 ax-9o 1125 ax-16 1212 ax-11o 1220 ax-ext 1462 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 983 df-sb 1174 df-clab 1467 df-cleq 1472 df-clel 1475 df-v 1815 |