Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dfac7 | Structured version Visualization version Unicode version |
Description: Equivalence of the Axiom of Choice (first form) of [Enderton] p. 49 and our Axiom of Choice (in the form of ac2 9283). The proof does not depend AC on but does depend on the Axiom of Regularity. (Contributed by Mario Carneiro, 17-May-2015.) |
Ref | Expression |
---|---|
dfac7 | CHOICE |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfac2 8953 | . 2 CHOICE | |
2 | aceq2 8942 | . . 3 | |
3 | 2 | albii 1747 | . 2 |
4 | 1, 3 | bitr4i 267 | 1 CHOICE |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 wa 384 wal 1481 wex 1704 wne 2794 wral 2912 wrex 2913 wreu 2914 c0 3915 CHOICEwac 8938 |
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-pow 4843 ax-pr 4906 ax-un 6949 ax-reg 8497 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-eprel 5029 df-fr 5073 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-fv 5896 df-riota 6611 df-ac 8939 |
This theorem is referenced by: dfac0 8955 dfac1 8956 |
Copyright terms: Public domain | W3C validator |