| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: An identity law for substitution. Used in proof of Theorem 9.7 of [Megill] p. 449 (p. 16 of the preprint). |
| Ref | Expression |
|---|---|
| sbid2v |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-17 968 |
. 2
| |
| 2 | 1 | sbid2 1248 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: sbelx 1339 |
| 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-10 963 ax-12 965 ax-17 968 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 |