| 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 1223 |
. 2
| |
| 2 | sbequi 1223 |
. . 3
| |
| 3 | 2 | equcoms 1126 |
. 2
|
| 4 | 1, 3 | impbid 514 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: sbco2 1250 sb10f 1337 findes 3150 tfinds 3151 tfindes 3154 nn1suc 5887 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 959 ax-gen 960 ax-8 961 ax-9 962 ax-10 963 ax-12 965 ax-4 970 ax-5o 972 ax-6o 975 ax-9o 1119 ax-10o 1136 ax-11o 1213 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 978 df-sb 1168 |