| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > stdpc7 | Unicode version | ||
| Description: One of the two equality
axioms of standard predicate calculus, called
substitutivity of equality. (The other one is stdpc6 1717.) Translated to
traditional notation, it can be read: " |
| Ref | Expression |
|---|---|
| stdpc7 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbequ2 1783 |
. 2
| |
| 2 | 1 | equcoms 1722 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-gen 1463 ax-ie2 1508 ax-8 1518 ax-17 1540 ax-i9 1544 |
| This theorem depends on definitions: df-bi 117 df-sb 1777 |
| This theorem is referenced by: ax16 1827 sbequi 1853 sb5rf 1866 |
| Copyright terms: Public domain | W3C validator |