Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > axacndlem1 | Structured version Visualization version Unicode version |
Description: Lemma for the Axiom of Choice with no distinct variable conditions. (Contributed by NM, 3-Jan-2002.) |
Ref | Expression |
---|---|
axacndlem1 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfae 2316 | . . 3 | |
2 | nfae 2316 | . . . 4 | |
3 | simpl 473 | . . . . . 6 | |
4 | 3 | alimi 1739 | . . . . 5 |
5 | nd1 9409 | . . . . . 6 | |
6 | 5 | pm2.21d 118 | . . . . 5 |
7 | 4, 6 | syl5 34 | . . . 4 |
8 | 2, 7 | alrimi 2082 | . . 3 |
9 | 1, 8 | alrimi 2082 | . 2 |
10 | 19.8a 2052 | . 2 | |
11 | 9, 10 | syl 17 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 wa 384 wal 1481 wex 1704 |
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-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 ax-reg 8497 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-v 3202 df-dif 3577 df-un 3579 df-nul 3916 df-sn 4178 df-pr 4180 |
This theorem is referenced by: axacndlem4 9432 axacndlem5 9433 |
Copyright terms: Public domain | W3C validator |