Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > equsal | Structured version Visualization version Unicode version |
Description: An equivalence related to implicit substitution. See equsalvw 1931 and equsalv 2108 for versions with dv conditions proved from fewer axioms. See also the dual form equsex 2292. (Contributed by NM, 2-Jun-1993.) (Proof shortened by Andrew Salmon, 12-Aug-2011.) (Revised by Mario Carneiro, 3-Oct-2016.) (Proof shortened by Wolf Lammen, 5-Feb-2018.) |
Ref | Expression |
---|---|
equsal.1 | |
equsal.2 |
Ref | Expression |
---|---|
equsal |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | equsal.1 | . . 3 | |
2 | 1 | 19.23 2080 | . 2 |
3 | equsal.2 | . . . 4 | |
4 | 3 | pm5.74i 260 | . . 3 |
5 | 4 | albii 1747 | . 2 |
6 | ax6e 2250 | . . 3 | |
7 | 6 | a1bi 352 | . 2 |
8 | 2, 5, 7 | 3bitr4i 292 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 wal 1481 wex 1704 wnf 1708 |
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 ax-12 2047 ax-13 2246 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-ex 1705 df-nf 1710 |
This theorem is referenced by: equsex 2292 equsalh 2294 dvelimf 2334 sb6x 2384 sb6rf 2423 |
Copyright terms: Public domain | W3C validator |