| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: An equality theorem for substitution. Used in proof of Theorem 9.7 in [Megill] p. 449 (p. 16 of the preprint). |
| Ref | Expression |
|---|---|
| sbequ |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbequi 1227 |
. 2
| |
| 2 | sbequi 1227 |
. . 3
| |
| 3 | 2 | equcoms 1129 |
. 2
|
| 4 | 1, 3 | impbid 515 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: sbco2 1254 sb10f 1341 findes 3156 tfinds 3157 tfindes 3160 nn1suc 5897 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 961 ax-gen 962 ax-8 963 ax-9 964 ax-10 965 ax-12 967 ax-4 972 ax-5o 974 ax-6o 977 ax-9o 1122 ax-10o 1139 ax-11o 1217 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 980 df-sb 1171 |