| 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 7752 | . . 3 ⊢ ∪ 𝐴 ∈ V |
| 3 | numth3 10472 | . . 3 ⊢ (∪ 𝐴 ∈ V → ∪ 𝐴 ∈ dom card) | |
| 4 | 2, 3 | ax-mp 5 | . 2 ⊢ ∪ 𝐴 ∈ dom card |
| 5 | ttukeyg 10519 | . 2 ⊢ ((∪ 𝐴 ∈ dom card ∧ 𝐴 ≠ ∅ ∧ ∀𝑥(𝑥 ∈ 𝐴 ↔ (𝒫 𝑥 ∩ Fin) ⊆ 𝐴)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) | |
| 6 | 4, 5 | mp3an1 1477 | 1 ⊢ ((𝐴 ≠ ∅ ∧ ∀𝑥(𝑥 ∈ 𝐴 ↔ (𝒫 𝑥 ∩ Fin) ⊆ 𝐴)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∀wal 1568 ∈ wcel 2146 ≠ wne 2961 ∀wral 3082 ∃wrex 3092 Vcvv 3458 ∩ cin 3907 ⊆ wss 3908 ⊊ wpss 3909 ∅c0 4289 𝒫 cpw 4567 ∪ cuni 4877 dom cdm 5666 Fincfn 8952 cardccrd 9940 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-ac2 10465 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-int 4918 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-se 5620 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7380 df-ov 7426 df-om 7872 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-1o 8462 df-er 8703 df-en 8953 df-dom 8954 df-fin 8956 df-card 9944 df-ac 10119 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |