| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Equivalence involving substitution for a variable not free. |
| Ref | Expression |
|---|---|
| sb6x.1 |
|
| Ref | Expression |
|---|---|
| sb6x |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sb6x.1 |
. . . 4
| |
| 2 | 1 | sbf 1186 |
. . 3
|
| 3 | ax-1 4 |
. . . 4
| |
| 4 | 1, 3 | 19.21ai 998 |
. . 3
|
| 5 | 2, 4 | sylbi 199 |
. 2
|
| 6 | sb2 1177 |
. 2
| |
| 7 | 5, 6 | impbi 157 |
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 963 ax-4 973 ax-5o 975 ax-6o 978 ax-9o 1123 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 981 df-sb 1172 |