| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > sb9 | Unicode version | ||
| Description: Commutation of quantification and substitution variables. (Contributed by NM, 5-Aug-1993.) (Proof rewritten by Jim Kingdon, 23-Mar-2018.) |
| Ref | Expression |
|---|---|
| sb9 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sb9v 1895 |
. . 3
| |
| 2 | sbcom 1890 |
. . . 4
| |
| 3 | 2 | albii 1399 |
. . 3
|
| 4 | sb9v 1895 |
. . 3
| |
| 5 | 1, 3, 4 | 3bitri 204 |
. 2
|
| 6 | ax-17 1459 |
. . . 4
| |
| 7 | 6 | sbco2h 1879 |
. . 3
|
| 8 | 7 | albii 1399 |
. 2
|
| 9 | 6 | sbco2h 1879 |
. . 3
|
| 10 | 9 | albii 1399 |
. 2
|
| 11 | 5, 8, 10 | 3bitr3ri 209 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 |
| This theorem depends on definitions: df-bi 115 df-nf 1390 df-sb 1686 |
| This theorem is referenced by: sb9i 1897 |
| Copyright terms: Public domain | W3C validator |