| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Move universal quantifier in and out of substitution. |
| Ref | Expression |
|---|---|
| sbal |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | a16gb 1259 |
. . . . 5
| |
| 2 | 1 | sbimi 1156 |
. . . 4
|
| 3 | sbequ5 1173 |
. . . 4
| |
| 4 | sbbi 1223 |
. . . 4
| |
| 5 | 2, 3, 4 | 3imtr3 218 |
. . 3
|
| 6 | a16gb 1259 |
. . 3
| |
| 7 | 5, 6 | bitr3d 528 |
. 2
|
| 8 | sbal1 1328 |
. 2
| |
| 9 | 7, 8 | pm2.61i 126 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: sbex 1330 sbalv 1331 sbabel 1560 sbcalg 1945 |
| 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-16 1194 ax-11o 1202 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 957 df-sb 1155 |