| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: All variables are effectively bound in an identical variable specifier. |
| Ref | Expression |
|---|---|
| hbae |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-12 968 |
. . . . 5
| |
| 2 | ax-4 973 |
. . . . 5
| |
| 3 | 1, 2 | syl7 23 |
. . . 4
|
| 4 | ax-10o 1140 |
. . . . 5
| |
| 5 | 4 | alequcoms 1143 |
. . . 4
|
| 6 | ax-10o 1140 |
. . . . . 6
| |
| 7 | ax-10o 1140 |
. . . . . . 7
| |
| 8 | 7 | pm2.43i 64 |
. . . . . 6
|
| 9 | 6, 8 | syl5 21 |
. . . . 5
|
| 10 | 9 | alequcoms 1143 |
. . . 4
|
| 11 | 3, 5, 10 | pm2.61ii 130 |
. . 3
|
| 12 | 11 | a5i 989 |
. 2
|
| 13 | ax-7 962 |
. 2
| |
| 14 | 12, 13 | syl 10 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: hbaes 1146 hbnae 1147 dral1 1154 dral2 1155 drex2 1157 equvini 1168 sbequ5 1190 aev 1208 hbsb4 1248 sbcom 1258 a16g 1276 sbcom2 1334 a12stdy3 1374 exists1 1457 axextnd 4943 axrepnd 4946 axunndlem1 4947 axunnd 4948 axpowndlem3 4951 axpownd 4953 axregndlem1 4954 axregnd 4956 axacndlem1 4959 axacndlem2 4960 axacndlem3 4961 axacndlem4 4962 axacndlem5 4963 axacnd 4964 |
| 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-10o 1140 |