Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > alcomiw | Structured version Visualization version Unicode version |
Description: Weak version of alcom 2037. Uses only Tarski's FOL axiom schemes. (Contributed by NM, 10-Apr-2017.) |
Ref | Expression |
---|---|
alcomiw.1 |
Ref | Expression |
---|---|
alcomiw |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | alcomiw.1 | . . . . 5 | |
2 | 1 | biimpd 219 | . . . 4 |
3 | 2 | cbvalivw 1934 | . . 3 |
4 | 3 | alimi 1739 | . 2 |
5 | ax-5 1839 | . 2 | |
6 | 1 | biimprd 238 | . . . . . 6 |
7 | 6 | equcoms 1947 | . . . . 5 |
8 | 7 | spimvw 1927 | . . . 4 |
9 | 8 | alimi 1739 | . . 3 |
10 | 9 | alimi 1739 | . 2 |
11 | 4, 5, 10 | 3syl 18 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 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: hbalw 1977 ax11w 2007 bj-ssblem2 32631 |
Copyright terms: Public domain | W3C validator |