Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > stdpc7 | Structured version Visualization version Unicode version |
Description: One of the two equality axioms of standard predicate calculus, called substitutivity of equality. (The other one is stdpc6 1957.) Translated to traditional notation, it can be read: " , provided that is free for in ." Axiom 7 of [Mendelson] p. 95. (Contributed by NM, 15-Feb-2005.) |
Ref | Expression |
---|---|
stdpc7 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sbequ2 1882 | . 2 | |
2 | 1 | equcoms 1947 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wsb 1880 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 |
This theorem depends on definitions: df-bi 197 df-an 386 df-ex 1705 df-sb 1881 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |