| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ttukey | Structured version Visualization version GIF version | ||
| Description: The Teichmüller-Tukey Lemma, an Axiom of Choice equivalent. If 𝐴 is a nonempty collection of finite character, then 𝐴 has a maximal element with respect to inclusion. Here "finite character" means that 𝑥 ∈ 𝐴 iff every finite subset of 𝑥 is in 𝐴. (Contributed by Mario Carneiro, 15-May-2015.) |
| Ref | Expression |
|---|---|
| ttukey.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| ttukey | ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥(𝑥 ∈ 𝐴 ↔ (𝒫 𝑥 ∩ Fin) ⊆ 𝐴)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ttukey.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 2 | 1 | uniex 7728 | . . 3 ⊢ ∪ 𝐴 ∈ V |
| 3 | numth3 10442 | . . 3 ⊢ (∪ 𝐴 ∈ V → ∪ 𝐴 ∈ dom card) | |
| 4 | 2, 3 | ax-mp 5 | . 2 ⊢ ∪ 𝐴 ∈ dom card |
| 5 | ttukeyg 10489 | . 2 ⊢ ((∪ 𝐴 ∈ dom card ∧ 𝐴 ≠ ∅ ∧ ∀𝑥(𝑥 ∈ 𝐴 ↔ (𝒫 𝑥 ∩ Fin) ⊆ 𝐴)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) | |
| 6 | 4, 5 | mp3an1 1472 | 1 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥(𝑥 ∈ 𝐴 ↔ (𝒫 𝑥 ∩ Fin) ⊆ 𝐴)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∀wal 1561 ∈ wcel 2145 ≠ wne 2960 ∀wral 3079 ∃wrex 3089 Vcvv 3457 ∩ cin 3906 ⊆ wss 3907 ⊊ wpss 3908 ∅c0 4288 𝒫 cpw 4558 ∪ cuni 4868 dom cdm 5652 Fincfn 8931 cardccrd 9909 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-ac2 10435 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-int 4909 df-iun 4954 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-se 5606 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-isom 6534 df-riota 7357 df-ov 7403 df-om 7851 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-1o 8441 df-er 8682 df-en 8932 df-dom 8933 df-fin 8935 df-card 9913 df-ac 10088 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |