| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: One of the two equality
axioms of standard predicate calculus, called
substitutivity of equality. (The other one is stdpc6 1123.) Translated
to traditional notation, it can be read:
" |
| Ref | Expression |
|---|---|
| stdpc7 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbequ2 1175 |
. 2
| |
| 2 | 1 | equcoms 1126 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: ax16 1205 sbequi 1223 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-gen 960 ax-8 961 ax-12 965 ax-4 970 ax-5o 972 ax-6o 975 ax-9o 1119 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-sb 1168 |