Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > aevlem | Structured version Visualization version Unicode version |
Description: Lemma for aev 1983 and axc16g 2134. Change free and bound variables. Instance of aev 1983. (Contributed by NM, 22-Jul-2015.) (Proof shortened by Wolf Lammen, 17-Feb-2018.) Remove dependency on ax-13 2246, along an idea of BJ. (Revised by Wolf Lammen, 30-Nov-2019.) (Revised by BJ, 29-Mar-2021.) |
Ref | Expression |
---|---|
aevlem |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbvaev 1979 | . 2 | |
2 | aevlem0 1980 | . 2 | |
3 | cbvaev 1979 | . 2 | |
4 | aevlem0 1980 | . 2 | |
5 | 1, 2, 3, 4 | 4syl 19 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wal 1481 |
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 |
This theorem is referenced by: aeveq 1982 aev 1983 hbaevg 1984 axc16g 2134 axc11vOLD 2141 axc16gOLD 2161 aevOLD 2162 aevALTOLD 2321 bj-axc16g16 32674 bj-axc11nv 32745 |
Copyright terms: Public domain | W3C validator |