| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Equivalence for substitution. Compare Theorem 6.2 of [Quine] p. 40. Also proved as Lemmas 16 and 17 of [Tarski] p. 70. |
| Ref | Expression |
|---|---|
| sb6 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sb56 1304 |
. . 3
| |
| 2 | 1 | anbi2i 483 |
. 2
|
| 3 | df-sb 1209 |
. 2
| |
| 4 | ax-4 1009 |
. . 3
| |
| 5 | 4 | pm4.71ri 641 |
. 2
|
| 6 | 2, 3, 5 | 3bitr4i 181 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: sb5 1306 2sb6 1375 sb6a 1376 exsb 1389 sbal2 1397 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-gen 999 ax-4 1009 ax-5o 1011 ax-6o 1014 ax-9o 1159 ax-16 1247 ax-11o 1255 |
| This theorem depends on definitions: df-bi 145 df-an 223 df-ex 1017 df-sb 1209 |