| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Our Axiom of Choice (in the form of ac3 3568) implies the Axiom of Choice (first form) of [Enderton] p. 49. The proof uses neither AC nor the Axiom of Regularity. See aceq6b 3565 for the converse (which does use the Axiom of Regularity). |
| Ref | Expression |
|---|---|
| aceq6a |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq2 1150 |
. . . . . . . . . . . . . 14
| |
| 2 | eleq1 1149 |
. . . . . . . . . . . . . . . 16
| |
| 3 | 2 | anbi1d 469 |
. . . . . . . . . . . . . . 15
|
| 4 | 3 | birexdv 1220 |
. . . . . . . . . . . . . 14
|
| 5 | 1, 4 | anbi12d 476 |
. . . . . . . . . . . . 13
|
| 6 | 5 | biabdv 1183 |
. . . . . . . . . . . 12
|
| 7 | df-rab 1208 |
. . . . . . . . . . . 12
| |
| 8 | df-rab 1208 |
. . . . . . . . . . . 12
| |
| 9 | 6, 7, 8 | 3eqtr4g 1147 |
. . . . . . . . . . 11
|
| 10 | 9 | unieqd 1929 |
. . . . . . . . . 10
|
| 11 | cleqid 1102 |
. . . . . . . . . 10
| |
| 12 | visset 1350 |
. . . . . . . . . . . 12
| |
| 13 | 12 | rabex 1706 |
. . . . . . . . . . 11
|
| 14 | 13 | uniex 1947 |
. . . . . . . . . 10
|
| 15 | 10, 11, 14 | fvopab4 2871 |
. . . . . . . . 9
|
| 16 | 15 | eleq1d 1155 |
. . . . . . . 8
|
| 17 | reucl 1957 |
. . . . . . . 8
| |
| 18 | 16, 17 | syl5bir 184 |
. . . . . . 7
|
| 19 | 18 | syl3d 26 |
. . . . . 6
|
| 20 | 19 | r19.20i 1253 |
. . . . 5
|
| 21 | visset 1350 |
. . . . . . 7
| |
| 22 | moeq 1431 |
. . . . . . . 8
| |
| 23 | 22 | a1i 7 |
. . . . . . 7
|
| 24 | 21, 23 | funopabex 2742 |
. . . . . 6
|
| 25 | fveq1 2831 |
. . . . . . . . 9
| |
| 26 | 25 | eleq1d 1155 |
. . . . . . . 8
|
| 27 | 26 | imbi2d 464 |
. . . . . . 7
|
| 28 | 27 | biraldv 1219 |
. . . . . 6
|
| 29 | 24, 28 | cla4ev 1401 |
. . . . 5
|
| 30 | 20, 29 | syl 12 |
. . . 4
|
| 31 | 30 | 19.23aiv 952 |
. . 3
|
| 32 | 31 | 19.20i 691 |
. 2
|
| 33 | aceq3 3556 |
. 2
| |
| 34 | 32, 33 | sylibr 175 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: aceq7 3566 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-13 804 ax-14 805 ax-16 922 ax-17 925 ax-ext 1074 ax-rep 1075 ax-un 1076 ax-pow 1077 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-ex 679 df-sb 853 df-eu 1009 df-mo 1010 df-clab 1093 df-cleq 1097 df-clel 1099 df-ral 1205 df-rex 1206 df-reu 1207 df-rab 1208 df-v 1349 df-dif 1489 df-un 1490 df-in 1491 df-ss 1492 df-nul 1708 df-pw 1799 df-sn 1811 df-pr 1812 df-op 1815 df-uni 1920 df-br 2063 df-opab 2098 df-id 2125 df-xp 2424 df-rel 2425 df-cnv 2426 df-co 2427 df-dm 2428 df-rn 2429 df-res 2430 df-ima 2431 df-fun 2432 df-fn 2433 df-fv 2438 |